NOISSUE reorganize and document libraries

96 files changed, 0 insertions, 25116 deletions

diff --git a/depends/LogicalGui/CMakeLists.txt b/depends/LogicalGui/CMakeLists.txt
deleted file mode 100644
index 12665738..00000000
--- a/depends/LogicalGui/CMakeLists.txt
+++ /dev/null
@@ -1,4 +0,0 @@
-project(LogicalGui)
-add_library(LogicalGui STATIC LogicalGui.h)
-target_include_directories(LogicalGui PUBLIC "${CMAKE_CURRENT_SOURCE_DIR}")
-qt5_use_modules(LogicalGui Core)
diff --git a/depends/LogicalGui/LogicalGui.h b/depends/LogicalGui/LogicalGui.h
deleted file mode 100644
index 729f0353..00000000
--- a/depends/LogicalGui/LogicalGui.h
+++ /dev/null
@@ -1,254 +0,0 @@
-/* Copyright 2013-2015 Jan Dalheimer
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-#pragma once
-
-#include <QObject>
-#include <QMetaMethod>
-#include <QThread>
-#include <QCoreApplication>
-#include <QSemaphore>
-#include <memory>
-
-#if QT_VERSION == QT_VERSION_CHECK(5, 1, 1)
-#include <5.1.1/QtCore/private/qobject_p.h>
-#elif QT_VERSION == QT_VERSION_CHECK(5, 2, 0)
-#include <5.2.0/QtCore/private/qobject_p.h>
-#elif QT_VERSION == QT_VERSION_CHECK(5, 2, 1)
-#include <5.2.1/QtCore/private/qobject_p.h>
-#elif QT_VERSION == QT_VERSION_CHECK(5, 3, 0)
-#include <5.3.0/QtCore/private/qobject_p.h>
-#elif QT_VERSION == QT_VERSION_CHECK(5, 3, 1)
-#include <5.3.1/QtCore/private/qobject_p.h>
-#else
-#error Please add support for this version of Qt
-#endif
-
-class Bindable
-{
-	friend class tst_LogicalGui;
-
-public:
-	Bindable(Bindable *parent = 0) : m_parent(parent)
-	{
-	}
-	virtual ~Bindable()
-	{
-	}
-
-	void setBindableParent(Bindable *parent)
-	{
-		m_parent = parent;
-	}
-
-	void bind(const QString &id, const QObject *receiver, const char *methodSignature)
-	{
-		auto mo = receiver->metaObject();
-		Q_ASSERT_X(mo, "Bindable::bind",
-				   "Invalid metaobject. Did you forget the QObject macro?");
-		const QMetaMethod method = mo->method(mo->indexOfMethod(
-			QMetaObject::normalizedSignature(methodSignature + 1).constData()));
-		Q_ASSERT_X(method.isValid(), "Bindable::bind", "Invalid method signature");
-		m_bindings.insert(id, Binding(receiver, method));
-	}
-	template <typename Func>
-	void bind(const QString &id,
-			  const typename QtPrivate::FunctionPointer<Func>::Object *receiver, Func slot)
-	{
-		typedef QtPrivate::FunctionPointer<Func> SlotType;
-		m_bindings.insert(
-			id,
-			Binding(receiver, new QtPrivate::QSlotObject<Func, typename SlotType::Arguments,
-														 typename SlotType::ReturnType>(slot)));
-	}
-	template <typename Func> void bind(const QString &id, Func slot)
-	{
-		typedef QtPrivate::FunctionPointer<Func> SlotType;
-		m_bindings.insert(
-			id,
-			Binding(nullptr, new QtPrivate::QSlotObject<Func, typename SlotType::Arguments,
-														typename SlotType::ReturnType>(slot)));
-	}
-	void unbind(const QString &id)
-	{
-		m_bindings.remove(id);
-	}
-
-private:
-	struct Binding
-	{
-		Binding(const QObject *receiver, const QMetaMethod &method)
-			: receiver(receiver), method(method)
-		{
-		}
-		Binding(const QObject *receiver, QtPrivate::QSlotObjectBase *object)
-			: receiver(receiver), object(object)
-		{
-		}
-		Binding()
-		{
-		}
-		const QObject *receiver;
-		QMetaMethod method;
-		QtPrivate::QSlotObjectBase *object = nullptr;
-	};
-	QMap<QString, Binding> m_bindings;
-
-	Bindable *m_parent;
-
-private:
-	inline Qt::ConnectionType connectionType(const QObject *receiver)
-	{
-		return receiver == nullptr ? Qt::DirectConnection
-								   : (QThread::currentThread() == receiver->thread()
-										  ? Qt::DirectConnection
-										  : Qt::BlockingQueuedConnection);
-	}
-
-protected:
-	template <typename Ret, typename... Params> Ret wait(const QString &id, Params... params)
-	{
-		static_assert(!std::is_same<Ret, void>::value, "You need to use Bindable::waitVoid");
-
-		if (!m_bindings.contains(id) && m_parent)
-		{
-			return m_parent->wait<Ret, Params...>(id, params...);
-		}
-		Q_ASSERT(m_bindings.contains(id));
-		const auto binding = m_bindings[id];
-		const Qt::ConnectionType type = connectionType(binding.receiver);
-		Ret ret;
-		if (binding.object)
-		{
-			void *args[] = {&ret,
-							const_cast<void *>(reinterpret_cast<const void *>(&params))...};
-			if (type == Qt::BlockingQueuedConnection)
-			{
-				QSemaphore semaphore;
-				QMetaCallEvent *ev =
-					new QMetaCallEvent(binding.object, nullptr, -1, 0, 0, args, &semaphore);
-				QCoreApplication::postEvent(const_cast<QObject *>(binding.receiver), ev);
-				semaphore.acquire();
-			}
-			else
-			{
-				binding.object->call(const_cast<QObject *>(binding.receiver), args);
-			}
-		}
-		else
-		{
-			const QMetaMethod method = binding.method;
-			Q_ASSERT_X(method.parameterCount() == sizeof...(params), "Bindable::wait",
-					   qPrintable(QString("Incompatible argument count (expected %1, got %2)")
-									  .arg(method.parameterCount(), sizeof...(params))));
-			Q_ASSERT_X(
-				qMetaTypeId<Ret>() != QMetaType::UnknownType, "Bindable::wait",
-				"Requested return type is not registered, please use the Q_DECLARE_METATYPE "
-				"macro to make it known to Qt's meta-object system");
-			Q_ASSERT_X(
-				method.returnType() == qMetaTypeId<Ret>() ||
-					QMetaType::hasRegisteredConverterFunction(method.returnType(),
-															  qMetaTypeId<Ret>()),
-				"Bindable::wait",
-				qPrintable(
-					QString(
-						"Requested return type (%1) is incompatible method return type (%2)")
-						.arg(QMetaType::typeName(qMetaTypeId<Ret>()),
-							 QMetaType::typeName(method.returnType()))));
-			const auto retArg = QReturnArgument<Ret>(
-				QMetaType::typeName(qMetaTypeId<Ret>()),
-				ret); // because Q_RETURN_ARG doesn't work with templates...
-			method.invoke(const_cast<QObject *>(binding.receiver), type, retArg,
-						  Q_ARG(Params, params)...);
-		}
-		return ret;
-	}
-	template <typename... Params>
-	typename std::enable_if<sizeof...(Params) != 0, void>::type waitVoid(const QString &id,
-																		 Params... params)
-	{
-		if (!m_bindings.contains(id) && m_parent)
-		{
-			m_parent->waitVoid<Params...>(id, params...);
-			return;
-		}
-		Q_ASSERT(m_bindings.contains(id));
-		const auto binding = m_bindings[id];
-		const Qt::ConnectionType type = connectionType(binding.receiver);
-		if (binding.object)
-		{
-			void *args[] = {0, const_cast<void *>(reinterpret_cast<const void *>(&params))...};
-			if (type == Qt::BlockingQueuedConnection)
-			{
-				QSemaphore semaphore;
-				QMetaCallEvent *ev =
-					new QMetaCallEvent(binding.object, nullptr, -1, 0, 0, args, &semaphore);
-				QCoreApplication::postEvent(const_cast<QObject *>(binding.receiver), ev);
-				semaphore.acquire();
-			}
-			else
-			{
-				binding.object->call(const_cast<QObject *>(binding.receiver), args);
-			}
-		}
-		else
-		{
-			const QMetaMethod method = binding.method;
-			Q_ASSERT_X(method.parameterCount() == sizeof...(params), "Bindable::wait",
-					   qPrintable(QString("Incompatible argument count (expected %1, got %2)")
-									  .arg(method.parameterCount(), sizeof...(params))));
-			method.invoke(const_cast<QObject *>(binding.receiver), type,
-						  Q_ARG(Params, params)...);
-		}
-	}
-	void waitVoid(const QString &id)
-	{
-		if (!m_bindings.contains(id) && m_parent)
-		{
-			m_parent->waitVoid(id);
-			return;
-		}
-		Q_ASSERT(m_bindings.contains(id));
-		const auto binding = m_bindings[id];
-		const Qt::ConnectionType type = connectionType(binding.receiver);
-		if (binding.object)
-		{
-			void *args[] = {0};
-			if (type == Qt::BlockingQueuedConnection)
-			{
-				QSemaphore semaphore;
-				QMetaCallEvent *ev =
-					new QMetaCallEvent(binding.object, nullptr, -1, 0, 0, args, &semaphore);
-				QCoreApplication::postEvent(const_cast<QObject *>(binding.receiver), ev);
-				semaphore.acquire();
-			}
-			else
-			{
-				binding.object->call(const_cast<QObject *>(binding.receiver), args);
-			}
-		}
-		else
-		{
-			const QMetaMethod method = binding.method;
-			Q_ASSERT_X(method.parameterCount() == 0, "Bindable::wait",
-					   qPrintable(QString("Incompatible argument count (expected %1, got %2)")
-									  .arg(method.parameterCount(), 0)));
-			method.invoke(const_cast<QObject *>(binding.receiver), type);
-		}
-	}
-};
-
-// used frequently
-Q_DECLARE_METATYPE(bool *)
diff --git a/depends/classparser/CMakeLists.txt b/depends/classparser/CMakeLists.txt
deleted file mode 100644
index a6c3fa14..00000000
--- a/depends/classparser/CMakeLists.txt
+++ /dev/null
@@ -1,41 +0,0 @@
-project(classparser)
-
-set(CMAKE_AUTOMOC ON)
-
-######## Check endianness ########
-include(TestBigEndian)
-test_big_endian(BIGENDIAN)
-if(${BIGENDIAN})
-	add_definitions(-DMULTIMC_BIG_ENDIAN)
-endif(${BIGENDIAN})
-
-# Find Qt
-find_package(Qt5Core REQUIRED)
-
-# Include Qt headers.
-include_directories(${Qt5Base_INCLUDE_DIRS})
-
-set(CLASSPARSER_HEADERS
-# Public headers
-include/classparser_config.h
-include/javautils.h
-
-# Private headers
-src/annotations.h
-src/classfile.h
-src/constants.h
-src/errors.h
-src/javaendian.h
-src/membuffer.h
-)
-
-set(CLASSPARSER_SOURCES
-src/javautils.cpp
-src/annotations.cpp
-)
-
-add_definitions(-DCLASSPARSER_LIBRARY)
-
-add_library(classparser SHARED ${CLASSPARSER_SOURCES} ${CLASSPARSER_HEADERS})
-target_include_directories(classparser PUBLIC "${CMAKE_CURRENT_SOURCE_DIR}/include")
-qt5_use_modules(classparser Core)
diff --git a/depends/classparser/include/classparser_config.h b/depends/classparser/include/classparser_config.h
deleted file mode 100644
index bfd4dcb4..00000000
--- a/depends/classparser/include/classparser_config.h
+++ /dev/null
@@ -1,22 +0,0 @@
-/* Copyright 2013-2015 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-#include <QtCore/QtGlobal>
-
-#ifdef CLASSPARSER_LIBRARY
-#define CLASSPARSER_EXPORT Q_DECL_EXPORT
-#else
-#define CLASSPARSER_EXPORT Q_DECL_IMPORT
-#endif
diff --git a/depends/classparser/include/javautils.h b/depends/classparser/include/javautils.h
deleted file mode 100644
index 43cca4bc..00000000
--- a/depends/classparser/include/javautils.h
+++ /dev/null
@@ -1,29 +0,0 @@
-/* Copyright 2013-2015 MultiMC Contributors
- *
- * Authors: Orochimarufan <orochimarufan.x3@gmail.com>
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-#pragma once
-#include <QString>
-#include "classparser_config.h"
-
-#define MCVer_Unknown "Unknown"
-
-namespace javautils
-{
-/**
- * @brief Get the version from a minecraft.jar by parsing its class files. Expensive!
- */
-QString GetMinecraftJarVersion(QString jar);
-}
diff --git a/depends/classparser/src/annotations.cpp b/depends/classparser/src/annotations.cpp
deleted file mode 100644
index d1a7c046..00000000
--- a/depends/classparser/src/annotations.cpp
+++ /dev/null
@@ -1,85 +0,0 @@
-#include "classfile.h"
-#include "annotations.h"
-#include <sstream>
-
-namespace java
-{
-std::string annotation::toString()
-{
-	std::ostringstream ss;
-	ss << "Annotation type : " << type_index << " - " << pool[type_index].str_data << std::endl;
-	ss << "Contains " << name_val_pairs.size() << " pairs:" << std::endl;
-	for (unsigned i = 0; i < name_val_pairs.size(); i++)
-	{
-		std::pair<uint16_t, element_value *> &val = name_val_pairs[i];
-		auto name_idx = val.first;
-		ss << pool[name_idx].str_data << "(" << name_idx << ")"
-		   << " = " << val.second->toString() << std::endl;
-	}
-	return ss.str();
-}
-
-annotation *annotation::read(util::membuffer &input, constant_pool &pool)
-{
-	uint16_t type_index = 0;
-	input.read_be(type_index);
-	annotation *ann = new annotation(type_index, pool);
-
-	uint16_t num_pairs = 0;
-	input.read_be(num_pairs);
-	while (num_pairs)
-	{
-		uint16_t name_idx = 0;
-		// read name index
-		input.read_be(name_idx);
-		auto elem = element_value::readElementValue(input, pool);
-		// read value
-		ann->add_pair(name_idx, elem);
-		num_pairs--;
-	}
-	return ann;
-}
-
-element_value *element_value::readElementValue(util::membuffer &input,
-											   java::constant_pool &pool)
-{
-	element_value_type type = INVALID;
-	input.read(type);
-	uint16_t index = 0;
-	uint16_t index2 = 0;
-	std::vector<element_value *> vals;
-	switch (type)
-	{
-	case PRIMITIVE_BYTE:
-	case PRIMITIVE_CHAR:
-	case PRIMITIVE_DOUBLE:
-	case PRIMITIVE_FLOAT:
-	case PRIMITIVE_INT:
-	case PRIMITIVE_LONG:
-	case PRIMITIVE_SHORT:
-	case PRIMITIVE_BOOLEAN:
-	case STRING:
-		input.read_be(index);
-		return new element_value_simple(type, index, pool);
-	case ENUM_CONSTANT:
-		input.read_be(index);
-		input.read_be(index2);
-		return new element_value_enum(type, index, index2, pool);
-	case CLASS: // Class
-		input.read_be(index);
-		return new element_value_class(type, index, pool);
-	case ANNOTATION: // Annotation
-		// FIXME: runtime visibility info needs to be passed from parent
-		return new element_value_annotation(ANNOTATION, annotation::read(input, pool), pool);
-	case ARRAY: // Array
-		input.read_be(index);
-		for (int i = 0; i < index; i++)
-		{
-			vals.push_back(element_value::readElementValue(input, pool));
-		}
-		return new element_value_array(ARRAY, vals, pool);
-	default:
-		throw new java::classfile_exception();
-	}
-}
-}
\ No newline at end of file
diff --git a/depends/classparser/src/annotations.h b/depends/classparser/src/annotations.h
deleted file mode 100644
index aa25d241..00000000
--- a/depends/classparser/src/annotations.h
+++ /dev/null
@@ -1,277 +0,0 @@
-#pragma once
-#include "classfile.h"
-#include <map>
-#include <vector>
-
-namespace java
-{
-enum element_value_type : uint8_t
-{
-	INVALID = 0,
-	STRING = 's',
-	ENUM_CONSTANT = 'e',
-	CLASS = 'c',
-	ANNOTATION = '@',
-	ARRAY = '[',			// one array dimension
-	PRIMITIVE_INT = 'I',	// integer
-	PRIMITIVE_BYTE = 'B',   // signed byte
-	PRIMITIVE_CHAR = 'C',   // Unicode character code point in the Basic Multilingual Plane,
-							// encoded with UTF-16
-	PRIMITIVE_DOUBLE = 'D', // double-precision floating-point value
-	PRIMITIVE_FLOAT = 'F',  // single-precision floating-point value
-	PRIMITIVE_LONG = 'J',   // long integer
-	PRIMITIVE_SHORT = 'S',  // signed short
-	PRIMITIVE_BOOLEAN = 'Z' // true or false
-};
-/**
- * The element_value structure is a discriminated union representing the value of an
- *element-value pair.
- * It is used to represent element values in all attributes that describe annotations
- * - RuntimeVisibleAnnotations
- * - RuntimeInvisibleAnnotations
- * - RuntimeVisibleParameterAnnotations
- * - RuntimeInvisibleParameterAnnotations).
- *
- * The element_value structure has the following format:
- */
-class element_value
-{
-protected:
-	element_value_type type;
-	constant_pool &pool;
-
-public:
-	element_value(element_value_type type, constant_pool &pool) : type(type), pool(pool) {};
-
-	element_value_type getElementValueType()
-	{
-		return type;
-	}
-
-	virtual std::string toString() = 0;
-
-	static element_value *readElementValue(util::membuffer &input, constant_pool &pool);
-};
-
-/**
- * Each value of the annotations table represents a single runtime-visible annotation on a
- * program element.
- * The annotation structure has the following format:
- */
-class annotation
-{
-public:
-	typedef std::vector<std::pair<uint16_t, element_value *>> value_list;
-
-protected:
-	/**
-	 * The value of the type_index item must be a valid index into the constant_pool table.
-	 * The constant_pool entry at that index must be a CONSTANT_Utf8_info (§4.4.7) structure
-	 * representing a field descriptor representing the annotation type corresponding
-	 * to the annotation represented by this annotation structure.
-	 */
-	uint16_t type_index;
-	/**
-	 * map between element_name_index and value.
-	 *
-	 * The value of the element_name_index item must be a valid index into the constant_pool
-	 *table.
-	 * The constant_pool entry at that index must be a CONSTANT_Utf8_info (§4.4.7) structure
-	 *representing
-	 * a valid field descriptor (§4.3.2) that denotes the name of the annotation type element
-	 *represented
-	 * by this element_value_pairs entry.
-	 */
-	value_list name_val_pairs;
-	/**
-	 * Reference to the parent constant pool
-	 */
-	constant_pool &pool;
-
-public:
-	annotation(uint16_t type_index, constant_pool &pool)
-		: type_index(type_index), pool(pool) {};
-	~annotation()
-	{
-		for (unsigned i = 0; i < name_val_pairs.size(); i++)
-		{
-			delete name_val_pairs[i].second;
-		}
-	}
-	void add_pair(uint16_t key, element_value *value)
-	{
-		name_val_pairs.push_back(std::make_pair(key, value));
-	}
-	;
-	value_list::const_iterator begin()
-	{
-		return name_val_pairs.cbegin();
-	}
-	value_list::const_iterator end()
-	{
-		return name_val_pairs.cend();
-	}
-	std::string toString();
-	static annotation *read(util::membuffer &input, constant_pool &pool);
-};
-typedef std::vector<annotation *> annotation_table;
-
-/// type for simple value annotation elements
-class element_value_simple : public element_value
-{
-protected:
-	/// index of the constant in the constant pool
-	uint16_t index;
-
-public:
-	element_value_simple(element_value_type type, uint16_t index, constant_pool &pool)
-		: element_value(type, pool), index(index) {
-										 // TODO: verify consistency
-									 };
-	uint16_t getIndex()
-	{
-		return index;
-	}
-	virtual std::string toString()
-	{
-		return pool[index].toString();
-	}
-	;
-};
-/// The enum_const_value item is used if the tag item is 'e'.
-class element_value_enum : public element_value
-{
-protected:
-	/**
-	 * The value of the type_name_index item must be a valid index into the constant_pool table.
-	 * The constant_pool entry at that index must be a CONSTANT_Utf8_info (§4.4.7) structure
-	 * representing a valid field descriptor (§4.3.2) that denotes the internal form of the
-	 * binary
-	 * name (§4.2.1) of the type of the enum constant represented by this element_value
-	 * structure.
-	 */
-	uint16_t typeIndex;
-	/**
-	 * The value of the const_name_index item must be a valid index into the constant_pool
-	 * table.
-	 * The constant_pool entry at that index must be a CONSTANT_Utf8_info (§4.4.7) structure
-	 * representing the simple name of the enum constant represented by this element_value
-	 * structure.
-	 */
-	uint16_t valueIndex;
-
-public:
-	element_value_enum(element_value_type type, uint16_t typeIndex, uint16_t valueIndex,
-					   constant_pool &pool)
-		: element_value(type, pool), typeIndex(typeIndex), valueIndex(valueIndex)
-	{
-		// TODO: verify consistency
-	}
-	uint16_t getValueIndex()
-	{
-		return valueIndex;
-	}
-	uint16_t getTypeIndex()
-	{
-		return typeIndex;
-	}
-	virtual std::string toString()
-	{
-		return "enum value";
-	}
-	;
-};
-
-class element_value_class : public element_value
-{
-protected:
-	/**
-	 * The class_info_index item must be a valid index into the constant_pool table.
-	 * The constant_pool entry at that index must be a CONSTANT_Utf8_info (§4.4.7) structure
-	 * representing the return descriptor (§4.3.3) of the type that is reified by the class
-	 * represented by this element_value structure.
-	 *
-	 * For example, 'V' for Void.class, 'Ljava/lang/Object;' for Object, etc.
-	 *
-	 * Or in plain english, you can store type information in annotations. Yay.
-	 */
-	uint16_t classIndex;
-
-public:
-	element_value_class(element_value_type type, uint16_t classIndex, constant_pool &pool)
-		: element_value(type, pool), classIndex(classIndex)
-	{
-		// TODO: verify consistency
-	}
-	uint16_t getIndex()
-	{
-		return classIndex;
-	}
-	virtual std::string toString()
-	{
-		return "class";
-	}
-	;
-};
-
-/// nested annotations... yay
-class element_value_annotation : public element_value
-{
-private:
-	annotation *nestedAnnotation;
-
-public:
-	element_value_annotation(element_value_type type, annotation *nestedAnnotation,
-							 constant_pool &pool)
-		: element_value(type, pool), nestedAnnotation(nestedAnnotation) {};
-	~element_value_annotation()
-	{
-		if (nestedAnnotation)
-		{
-			delete nestedAnnotation;
-			nestedAnnotation = nullptr;
-		}
-	}
-	virtual std::string toString()
-	{
-		return "nested annotation";
-	}
-	;
-};
-
-/// and arrays!
-class element_value_array : public element_value
-{
-public:
-	typedef std::vector<element_value *> elem_vec;
-
-protected:
-	elem_vec values;
-
-public:
-	element_value_array(element_value_type type, std::vector<element_value *> &values,
-						constant_pool &pool)
-		: element_value(type, pool), values(values) {};
-	~element_value_array()
-	{
-		for (unsigned i = 0; i < values.size(); i++)
-		{
-			delete values[i];
-		}
-	}
-	;
-	elem_vec::const_iterator begin()
-	{
-		return values.cbegin();
-	}
-	elem_vec::const_iterator end()
-	{
-		return values.cend();
-	}
-	virtual std::string toString()
-	{
-		return "array";
-	}
-	;
-};
-}
\ No newline at end of file
diff --git a/depends/classparser/src/classfile.h b/depends/classparser/src/classfile.h
deleted file mode 100644
index a5e7ee50..00000000
--- a/depends/classparser/src/classfile.h
+++ /dev/null
@@ -1,156 +0,0 @@
-#pragma once
-#include "membuffer.h"
-#include "constants.h"
-#include "annotations.h"
-#include <map>
-namespace java
-{
-/**
- * Class representing a Java .class file
- */
-class classfile : public util::membuffer
-{
-public:
-	classfile(char *data, std::size_t size) : membuffer(data, size)
-	{
-		valid = false;
-		is_synthetic = false;
-		read_be(magic);
-		if (magic != 0xCAFEBABE)
-			throw new classfile_exception();
-		read_be(minor_version);
-		read_be(major_version);
-		constants.load(*this);
-		read_be(access_flags);
-		read_be(this_class);
-		read_be(super_class);
-
-		// Interfaces
-		uint16_t iface_count = 0;
-		read_be(iface_count);
-		while (iface_count)
-		{
-			uint16_t iface;
-			read_be(iface);
-			interfaces.push_back(iface);
-			iface_count--;
-		}
-
-		// Fields
-		// read fields (and attributes from inside fields) (and possible inner classes. yay for
-		// recursion!)
-		// for now though, we will ignore all attributes
-		/*
-		 * field_info
-		 * {
-		 * 	u2 access_flags;
-		 * 	u2 name_index;
-		 * 	u2 descriptor_index;
-		 * 	u2 attributes_count;
-		 * 	attribute_info attributes[attributes_count];
-		 * }
-		 */
-		uint16_t field_count = 0;
-		read_be(field_count);
-		while (field_count)
-		{
-			// skip field stuff
-			skip(6);
-			// and skip field attributes
-			uint16_t attr_count = 0;
-			read_be(attr_count);
-			while (attr_count)
-			{
-				skip(2);
-				uint32_t attr_length = 0;
-				read_be(attr_length);
-				skip(attr_length);
-				attr_count--;
-			}
-			field_count--;
-		}
-
-		// class methods
-		/*
-		 * method_info
-		 * {
-		 * 	u2 access_flags;
-		 * 	u2 name_index;
-		 * 	u2 descriptor_index;
-		 * 	u2 attributes_count;
-		 * 	attribute_info attributes[attributes_count];
-		 * }
-		 */
-		uint16_t method_count = 0;
-		read_be(method_count);
-		while (method_count)
-		{
-			skip(6);
-			// and skip method attributes
-			uint16_t attr_count = 0;
-			read_be(attr_count);
-			while (attr_count)
-			{
-				skip(2);
-				uint32_t attr_length = 0;
-				read_be(attr_length);
-				skip(attr_length);
-				attr_count--;
-			}
-			method_count--;
-		}
-
-		// class attributes
-		// there are many kinds of attributes. this is just the generic wrapper structure.
-		// type is decided by attribute name. extensions to the standard are *possible*
-		// class annotations are one kind of a attribute (one per class)
-		/*
-		 * attribute_info
-		 * {
-		 * 	u2 attribute_name_index;
-		 * 	u4 attribute_length;
-		 * 	u1 info[attribute_length];
-		 * }
-		 */
-		uint16_t class_attr_count = 0;
-		read_be(class_attr_count);
-		while (class_attr_count)
-		{
-			uint16_t name_idx = 0;
-			read_be(name_idx);
-			uint32_t attr_length = 0;
-			read_be(attr_length);
-
-			auto name = constants[name_idx];
-			if (name.str_data == "RuntimeVisibleAnnotations")
-			{
-				uint16_t num_annotations = 0;
-				read_be(num_annotations);
-				while (num_annotations)
-				{
-					visible_class_annotations.push_back(annotation::read(*this, constants));
-					num_annotations--;
-				}
-			}
-			else
-				skip(attr_length);
-			class_attr_count--;
-		}
-		valid = true;
-	}
-	;
-	bool valid;
-	bool is_synthetic;
-	uint32_t magic;
-	uint16_t minor_version;
-	uint16_t major_version;
-	constant_pool constants;
-	uint16_t access_flags;
-	uint16_t this_class;
-	uint16_t super_class;
-	// interfaces this class implements ? must be. investigate.
-	std::vector<uint16_t> interfaces;
-	// FIXME: doesn't free up memory on delete
-	java::annotation_table visible_class_annotations;
-};
-}
\ No newline at end of file
diff --git a/depends/classparser/src/constants.h b/depends/classparser/src/constants.h
deleted file mode 100644
index 242b943e..00000000
--- a/depends/classparser/src/constants.h
+++ /dev/null
@@ -1,220 +0,0 @@
-#pragma once
-#include "errors.h"
-#include <sstream>
-
-namespace java
-{
-class constant
-{
-public:
-	enum type_t : uint8_t
-	{
-		j_hole = 0, // HACK: this is a hole in the array, because java is crazy
-		j_string_data = 1,
-		j_int = 3,
-		j_float = 4,
-		j_long = 5,
-		j_double = 6,
-		j_class = 7,
-		j_string = 8,
-		j_fieldref = 9,
-		j_methodref = 10,
-		j_interface_methodref = 11,
-		j_nameandtype = 12
-	} type;
-
-	constant(util::membuffer &buf)
-	{
-		buf.read(type);
-		// invalid constant type!
-		if (type > j_nameandtype || type == (type_t)0 || type == (type_t)2)
-			throw new classfile_exception();
-
-		// load data depending on type
-		switch (type)
-		{
-		case j_float:
-		case j_int:
-			buf.read_be(int_data); // same as float data really
-			break;
-		case j_double:
-		case j_long:
-			buf.read_be(long_data); // same as double
-			break;
-		case j_class:
-			buf.read_be(ref_type.class_idx);
-			break;
-		case j_fieldref:
-		case j_methodref:
-		case j_interface_methodref:
-			buf.read_be(ref_type.class_idx);
-			buf.read_be(ref_type.name_and_type_idx);
-			break;
-		case j_string:
-			buf.read_be(index);
-			break;
-		case j_string_data:
-			// HACK HACK: for now, we call these UTF-8 and do no further processing.
-			// Later, we should do some decoding. It's really modified UTF-8
-			// * U+0000 is represented as 0xC0,0x80 invalid character
-			// * any single zero byte ends the string
-			// * characters above U+10000 are encoded like in CESU-8
-			buf.read_jstr(str_data);
-			break;
-		case j_nameandtype:
-			buf.read_be(name_and_type.name_index);
-			buf.read_be(name_and_type.descriptor_index);
-			break;
-		}
-	}
-
-	constant(int fake)
-	{
-		type = j_hole;
-	}
-
-	std::string toString()
-	{
-		std::ostringstream ss;
-		switch (type)
-		{
-		case j_hole:
-			ss << "Fake legacy entry";
-			break;
-		case j_float:
-			ss << "Float: " << float_data;
-			break;
-		case j_double:
-			ss << "Double: " << double_data;
-			break;
-		case j_int:
-			ss << "Int: " << int_data;
-			break;
-		case j_long:
-			ss << "Long: " << long_data;
-			break;
-		case j_string_data:
-			ss << "StrData: " << str_data;
-			break;
-		case j_string:
-			ss << "Str: " << index;
-			break;
-		case j_fieldref:
-			ss << "FieldRef: " << ref_type.class_idx << " " << ref_type.name_and_type_idx;
-			break;
-		case j_methodref:
-			ss << "MethodRef: " << ref_type.class_idx << " " << ref_type.name_and_type_idx;
-			break;
-		case j_interface_methodref:
-			ss << "IfMethodRef: " << ref_type.class_idx << " " << ref_type.name_and_type_idx;
-			break;
-		case j_class:
-			ss << "Class: " << ref_type.class_idx;
-			break;
-		case j_nameandtype:
-			ss << "NameAndType: " << name_and_type.name_index << " "
-			   << name_and_type.descriptor_index;
-			break;
-		}
-		return ss.str();
-	}
-
-	std::string str_data; /** String data in 'modified utf-8'.*/
-	// store everything here.
-	union
-	{
-		int32_t int_data;
-		int64_t long_data;
-		float float_data;
-		double double_data;
-		uint16_t index;
-		struct
-		{
-			/**
-			 * Class reference:
-			 *   an index within the constant pool to a UTF-8 string containing
-			 *   the fully qualified class name (in internal format)
-			 * Used for j_class, j_fieldref, j_methodref and j_interface_methodref
-			 */
-			uint16_t class_idx;
-			// used for j_fieldref, j_methodref and j_interface_methodref
-			uint16_t name_and_type_idx;
-		} ref_type;
-		struct
-		{
-			uint16_t name_index;
-			uint16_t descriptor_index;
-		} name_and_type;
-	};
-};
-
-/**
- * A helper class that represents the custom container used in Java class file for storage of
- * constants
- */
-class constant_pool
-{
-public:
-	/**
-	 * Create a pool of constants
-	 */
-	constant_pool()
-	{
-	}
-	/**
-	 * Load a java constant pool
-	 */
-	void load(util::membuffer &buf)
-	{
-		uint16_t length = 0;
-		buf.read_be(length);
-		length--;
-		uint16_t index = 1;
-		const constant *last_constant = nullptr;
-		while (length)
-		{
-			const constant &cnst = constant(buf);
-			constants.push_back(cnst);
-			last_constant = &constants[constants.size() - 1];
-			if (last_constant->type == constant::j_double ||
-				last_constant->type == constant::j_long)
-			{
-				// push in a fake constant to preserve indexing
-				constants.push_back(constant(0));
-				length -= 2;
-				index += 2;
-			}
-			else
-			{
-				length--;
-				index++;
-			}
-		}
-	}
-	typedef std::vector<java::constant> container_type;
-	/**
-	 * Access constants based on jar file index numbers (index of the first element is 1)
-	 */
-	java::constant &operator[](std::size_t constant_index)
-	{
-		if (constant_index == 0 || constant_index > constants.size())
-		{
-			throw new classfile_exception();
-		}
-		return constants[constant_index - 1];
-	}
-	;
-	container_type::const_iterator begin() const
-	{
-		return constants.begin();
-	}
-	;
-	container_type::const_iterator end() const
-	{
-		return constants.end();
-	}
-
-private:
-	container_type constants;
-};
-}
diff --git a/depends/classparser/src/errors.h b/depends/classparser/src/errors.h
deleted file mode 100644
index ddbbd828..00000000
--- a/depends/classparser/src/errors.h
+++ /dev/null
@@ -1,8 +0,0 @@
-#pragma once
-#include <exception>
-namespace java
-{
-class classfile_exception : public std::exception
-{
-};
-}
diff --git a/depends/classparser/src/javaendian.h b/depends/classparser/src/javaendian.h
deleted file mode 100644
index d488b382..00000000
--- a/depends/classparser/src/javaendian.h
+++ /dev/null
@@ -1,76 +0,0 @@
-#pragma once
-#include <stdint.h>
-
-/**
- * Swap bytes between big endian and local number representation
- */
-namespace util
-{
-#ifdef MULTIMC_BIG_ENDIAN
-inline uint64_t bigswap(uint64_t x)
-{
-	return x;
-}
-;
-inline uint32_t bigswap(uint32_t x)
-{
-	return x;
-}
-;
-inline uint16_t bigswap(uint16_t x)
-{
-	return x;
-}
-;
-inline int64_t bigswap(int64_t x)
-{
-	return x;
-}
-;
-inline int32_t bigswap(int32_t x)
-{
-	return x;
-}
-;
-inline int16_t bigswap(int16_t x)
-{
-	return x;
-}
-;
-#else
-inline uint64_t bigswap(uint64_t x)
-{
-	return (x >> 56) | ((x << 40) & 0x00FF000000000000) | ((x << 24) & 0x0000FF0000000000) |
-		   ((x << 8) & 0x000000FF00000000) | ((x >> 8) & 0x00000000FF000000) |
-		   ((x >> 24) & 0x0000000000FF0000) | ((x >> 40) & 0x000000000000FF00) | (x << 56);
-}
-;
-inline uint32_t bigswap(uint32_t x)
-{
-	return (x >> 24) | ((x << 8) & 0x00FF0000) | ((x >> 8) & 0x0000FF00) | (x << 24);
-}
-;
-inline uint16_t bigswap(uint16_t x)
-{
-	return (x >> 8) | (x << 8);
-}
-;
-inline int64_t bigswap(int64_t x)
-{
-	return (x >> 56) | ((x << 40) & 0x00FF000000000000) | ((x << 24) & 0x0000FF0000000000) |
-		   ((x << 8) & 0x000000FF00000000) | ((x >> 8) & 0x00000000FF000000) |
-		   ((x >> 24) & 0x0000000000FF0000) | ((x >> 40) & 0x000000000000FF00) | (x << 56);
-}
-;
-inline int32_t bigswap(int32_t x)
-{
-	return (x >> 24) | ((x << 8) & 0x00FF0000) | ((x >> 8) & 0x0000FF00) | (x << 24);
-}
-;
-inline int16_t bigswap(int16_t x)
-{
-	return (x >> 8) | (x << 8);
-}
-;
-#endif
-}
diff --git a/depends/classparser/src/javautils.cpp b/depends/classparser/src/javautils.cpp
deleted file mode 100644
index f9310e5f..00000000
--- a/depends/classparser/src/javautils.cpp
+++ /dev/null
@@ -1,83 +0,0 @@
-/* Copyright 2013-2015 MultiMC Contributors
- *
- * Authors: Orochimarufan <orochimarufan.x3@gmail.com>
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-#include "classfile.h"
-#include "javautils.h"
-
-#include <QFile>
-#include <quazipfile.h>
-
-namespace javautils
-{
-
-QString GetMinecraftJarVersion(QString jarName)
-{
-	QString version = MCVer_Unknown;
-
-	// check if minecraft.jar exists
-	QFile jar(jarName);
-	if (!jar.exists())
-		return version;
-
-	// open minecraft.jar
-	QuaZip zip(&jar);
-	if (!zip.open(QuaZip::mdUnzip))
-		return version;
-
-	// open Minecraft.class
-	zip.setCurrentFile("net/minecraft/client/Minecraft.class", QuaZip::csSensitive);
-	QuaZipFile Minecraft(&zip);
-	if (!Minecraft.open(QuaZipFile::ReadOnly))
-		return version;
-
-	// read Minecraft.class
-	qint64 size = Minecraft.size();
-	char *classfile = new char[size];
-	Minecraft.read(classfile, size);
-
-	// parse Minecraft.class
-	try
-	{
-		char *temp = classfile;
-		java::classfile MinecraftClass(temp, size);
-		java::constant_pool constants = MinecraftClass.constants;
-		for (java::constant_pool::container_type::const_iterator iter = constants.begin();
-			 iter != constants.end(); iter++)
-		{
-			const java::constant &constant = *iter;
-			if (constant.type != java::constant::j_string_data)
-				continue;
-			const std::string &str = constant.str_data;
-			if (str.compare(0, 20, "Minecraft Minecraft ") == 0)
-			{
-				version = str.substr(20).data();
-				break;
-			}
-		}
-	}
-	catch (java::classfile_exception &)
-	{
-	}
-
-	// clean up
-	delete[] classfile;
-	Minecraft.close();
-	zip.close();
-	jar.close();
-
-	return version;
-}
-}
diff --git a/depends/classparser/src/membuffer.h b/depends/classparser/src/membuffer.h
deleted file mode 100644
index ab83412a..00000000
--- a/depends/classparser/src/membuffer.h
+++ /dev/null
@@ -1,63 +0,0 @@
-#pragma once
-#include <stdint.h>
-#include <string>
-#include <vector>
-#include <exception>
-#include "javaendian.h"
-
-namespace util
-{
-class membuffer
-{
-public:
-	membuffer(char *buffer, std::size_t size)
-	{
-		current = start = buffer;
-		end = start + size;
-	}
-	~membuffer()
-	{
-		// maybe? possibly? left out to avoid confusion. for now.
-		// delete start;
-	}
-	/**
-		* Read some value. That's all ;)
-		*/
-	template <class T> void read(T &val)
-	{
-		val = *(T *)current;
-		current += sizeof(T);
-	}
-	/**
-		* Read a big-endian number
-		* valid for 2-byte, 4-byte and 8-byte variables
-		*/
-	template <class T> void read_be(T &val)
-	{
-		val = util::bigswap(*(T *)current);
-		current += sizeof(T);
-	}
-	/**
-		* Read a string in the format:
-		* 2B length (big endian, unsigned)
-		* length bytes data
-		*/
-	void read_jstr(std::string &str)
-	{
-		uint16_t length = 0;
-		read_be(length);
-		str.append(current, length);
-		current += length;
-	}
-	/**
-		* Skip N bytes
-		*/
-	void skip(std::size_t N)
-	{
-		current += N;
-	}
-
-private:
-	char *start, *end, *current;
-};
-}
diff --git a/depends/hoedown/CMakeLists.txt b/depends/hoedown/CMakeLists.txt
deleted file mode 100644
index 7902e734..00000000
--- a/depends/hoedown/CMakeLists.txt
+++ /dev/null
@@ -1,26 +0,0 @@
-# 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/depends/hoedown/LICENSE b/depends/hoedown/LICENSE
deleted file mode 100644
index 4e75de4d..00000000
--- a/depends/hoedown/LICENSE
+++ /dev/null
@@ -1,15 +0,0 @@
-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/depends/hoedown/README.md b/depends/hoedown/README.md
deleted file mode 100644
index abe2b6ca..00000000
--- a/depends/hoedown/README.md
+++ /dev/null
@@ -1,9 +0,0 @@
-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/depends/hoedown/include/hoedown/autolink.h b/depends/hoedown/include/hoedown/autolink.h
deleted file mode 100644
index 528885c9..00000000
--- a/depends/hoedown/include/hoedown/autolink.h
+++ /dev/null
@@ -1,46 +0,0 @@
-/* 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/depends/hoedown/include/hoedown/buffer.h b/depends/hoedown/include/hoedown/buffer.h
deleted file mode 100644
index d7703f8d..00000000
--- a/depends/hoedown/include/hoedown/buffer.h
+++ /dev/null
@@ -1,134 +0,0 @@
-/* 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/depends/hoedown/include/hoedown/document.h b/depends/hoedown/include/hoedown/document.h
deleted file mode 100644
index a8178fec..00000000
--- a/depends/hoedown/include/hoedown/document.h
+++ /dev/null
@@ -1,172 +0,0 @@
-/* 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/depends/hoedown/include/hoedown/escape.h b/depends/hoedown/include/hoedown/escape.h
deleted file mode 100644
index d7659c27..00000000
--- a/depends/hoedown/include/hoedown/escape.h
+++ /dev/null
@@ -1,28 +0,0 @@
-/* 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/depends/hoedown/include/hoedown/html.h b/depends/hoedown/include/hoedown/html.h
deleted file mode 100644
index e46e7fd6..00000000
--- a/depends/hoedown/include/hoedown/html.h
+++ /dev/null
@@ -1,84 +0,0 @@
-/* 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/depends/hoedown/include/hoedown/stack.h b/depends/hoedown/include/hoedown/stack.h
deleted file mode 100644
index bf9b439b..00000000
--- a/depends/hoedown/include/hoedown/stack.h
+++ /dev/null
@@ -1,52 +0,0 @@
-/* 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/depends/hoedown/include/hoedown/version.h b/depends/hoedown/include/hoedown/version.h
deleted file mode 100644
index 4938cae5..00000000
--- a/depends/hoedown/include/hoedown/version.h
+++ /dev/null
@@ -1,33 +0,0 @@
-/* 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/depends/hoedown/src/autolink.c b/depends/hoedown/src/autolink.c
deleted file mode 100644
index 9bc7fad5..00000000
--- a/depends/hoedown/src/autolink.c
+++ /dev/null
@@ -1,281 +0,0 @@
-#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/depends/hoedown/src/buffer.c b/depends/hoedown/src/buffer.c
deleted file mode 100644
index 1c7ba55a..00000000
--- a/depends/hoedown/src/buffer.c
+++ /dev/null
@@ -1,308 +0,0 @@
-#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/depends/hoedown/src/document.c b/depends/hoedown/src/document.c
deleted file mode 100644
index 8ba82e47..00000000
--- a/depends/hoedown/src/document.c
+++ /dev/null
@@ -1,2958 +0,0 @@
-#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/depends/hoedown/src/escape.c b/depends/hoedown/src/escape.c
deleted file mode 100644
index b4a275ba..00000000
--- a/depends/hoedown/src/escape.c
+++ /dev/null
@@ -1,188 +0,0 @@
-#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/depends/hoedown/src/html.c b/depends/hoedown/src/html.c
deleted file mode 100644
index 4b18d804..00000000
--- a/depends/hoedown/src/html.c
+++ /dev/null
@@ -1,754 +0,0 @@
-#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/depends/hoedown/src/html_blocks.c b/depends/hoedown/src/html_blocks.c
deleted file mode 100644
index f5e9dce9..00000000
--- a/depends/hoedown/src/html_blocks.c
+++ /dev/null
@@ -1,240 +0,0 @@
-/* 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/depends/hoedown/src/html_smartypants.c b/depends/hoedown/src/html_smartypants.c
deleted file mode 100644
index e24b6bf0..00000000
--- a/depends/hoedown/src/html_smartypants.c
+++ /dev/null
@@ -1,435 +0,0 @@
-#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/depends/hoedown/src/stack.c b/depends/hoedown/src/stack.c
deleted file mode 100644
index 46ead232..00000000
--- a/depends/hoedown/src/stack.c
+++ /dev/null
@@ -1,79 +0,0 @@
-#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/depends/hoedown/src/version.c b/depends/hoedown/src/version.c
deleted file mode 100644
index 625ed196..00000000
--- a/depends/hoedown/src/version.c
+++ /dev/null
@@ -1,9 +0,0 @@
-#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;
-}
diff --git a/depends/iconfix/CMakeLists.txt b/depends/iconfix/CMakeLists.txt
deleted file mode 100644
index 4dfc39a9..00000000
--- a/depends/iconfix/CMakeLists.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-cmake_minimum_required(VERSION 3.1)
-project(iconfix)
-
-find_package(Qt5Core REQUIRED QUIET)
-find_package(Qt5Widgets REQUIRED QUIET)
-
-set(ICONFIX_SOURCES
-xdgicon.h
-xdgicon.cpp
-internal/qhexstring_p.h
-internal/qiconloader.cpp
-internal/qiconloader_p.h
-)
-
-add_library(iconfix STATIC ${ICONFIX_SOURCES})
-target_include_directories(iconfix PUBLIC ${CMAKE_CURRENT_SOURCE_DIR})
-
-qt5_use_modules(iconfix Core Widgets)
diff --git a/depends/iconfix/internal/qhexstring_p.h b/depends/iconfix/internal/qhexstring_p.h
deleted file mode 100644
index f01b4cdd..00000000
--- a/depends/iconfix/internal/qhexstring_p.h
+++ /dev/null
@@ -1,100 +0,0 @@
-/****************************************************************************
-**
-** Copyright (C) 2013 Digia Plc and/or its subsidiary(-ies).
-** Contact: http://www.qt-project.org/legal
-**
-** This file is part of the QtGui module of the Qt Toolkit.
-**
-** $QT_BEGIN_LICENSE:LGPL$
-** Commercial License Usage
-** Licensees holding valid commercial Qt licenses may use this file in
-** accordance with the commercial license agreement provided with the
-** Software or, alternatively, in accordance with the terms contained in
-** a written agreement between you and Digia.  For licensing terms and
-** conditions see http://qt.digia.com/licensing.  For further information
-** use the contact form at http://qt.digia.com/contact-us.
-**
-** GNU Lesser General Public License Usage
-** Alternatively, this file may be used under the terms of the GNU Lesser
-** General Public License version 2.1 as published by the Free Software
-** Foundation and appearing in the file LICENSE.LGPL included in the
-** packaging of this file.  Please review the following information to
-** ensure the GNU Lesser General Public License version 2.1 requirements
-** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
-**
-** In addition, as a special exception, Digia gives you certain additional
-** rights.  These rights are described in the Digia Qt LGPL Exception
-** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
-**
-** GNU General Public License Usage
-** Alternatively, this file may be used under the terms of the GNU
-** General Public License version 3.0 as published by the Free Software
-** Foundation and appearing in the file LICENSE.GPL included in the
-** packaging of this file.  Please review the following information to
-** ensure the GNU General Public License version 3.0 requirements will be
-** met: http://www.gnu.org/copyleft/gpl.html.
-**
-**
-** $QT_END_LICENSE$
-**
-****************************************************************************/
-
-#include <QtCore/qglobal.h>
-#include <QtCore/qpoint.h>
-#include <QtCore/qstring.h>
-#include <QtGui/qpolygon.h>
-#include <QtCore/qstringbuilder.h>
-
-#pragma once
-
-//
-//  W A R N I N G
-//  -------------
-//
-// This file is not part of the Qt API.  It exists purely as an
-// implementation detail.  This header file may change from version to
-// version without notice, or even be removed.
-//
-// We mean it.
-//
-
-// internal helper. Converts an integer value to an unique string token
-template <typename T> struct HexString
-{
-	inline HexString(const T t) : val(t)
-	{
-	}
-
-	inline void write(QChar *&dest) const
-	{
-		const ushort hexChars[] = {'0', '1', '2', '3', '4', '5', '6', '7',
-								   '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'};
-		const char *c = reinterpret_cast<const char *>(&val);
-		for (uint i = 0; i < sizeof(T); ++i)
-		{
-			*dest++ = hexChars[*c & 0xf];
-			*dest++ = hexChars[(*c & 0xf0) >> 4];
-			++c;
-		}
-	}
-	const T val;
-};
-
-// specialization to enable fast concatenating of our string tokens to a string
-template <typename T> struct QConcatenable<HexString<T>>
-{
-	typedef HexString<T> type;
-	enum
-	{
-		ExactSize = true
-	};
-	static int size(const HexString<T> &)
-	{
-		return sizeof(T) * 2;
-	}
-	static inline void appendTo(const HexString<T> &str, QChar *&out)
-	{
-		str.write(out);
-	}
-	typedef QString ConvertTo;
-};
diff --git a/depends/iconfix/internal/qiconloader.cpp b/depends/iconfix/internal/qiconloader.cpp
deleted file mode 100644
index b1195893..00000000
--- a/depends/iconfix/internal/qiconloader.cpp
+++ /dev/null
@@ -1,688 +0,0 @@
-/****************************************************************************
-**
-** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
-** Contact: http://www.qt-project.org/legal
-**
-** This file is part of the QtGui module of the Qt Toolkit.
-**
-** $QT_BEGIN_LICENSE:LGPL21$
-** Commercial License Usage
-** Licensees holding valid commercial Qt licenses may use this file in
-** accordance with the commercial license agreement provided with the
-** Software or, alternatively, in accordance with the terms contained in
-** a written agreement between you and Digia. For licensing terms and
-** conditions see http://qt.digia.com/licensing. For further information
-** use the contact form at http://qt.digia.com/contact-us.
-**
-** GNU Lesser General Public License Usage
-** Alternatively, this file may be used under the terms of the GNU Lesser
-** General Public License version 2.1 or version 3 as published by the Free
-** Software Foundation and appearing in the file LICENSE.LGPLv21 and
-** LICENSE.LGPLv3 included in the packaging of this file. Please review the
-** following information to ensure the GNU Lesser General Public License
-** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
-** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
-**
-** In addition, as a special exception, Digia gives you certain additional
-** rights. These rights are described in the Digia Qt LGPL Exception
-** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
-**
-** $QT_END_LICENSE$
-**
-****************************************************************************/
-#include "qiconloader_p.h"
-
-#include <QtGui/QIconEnginePlugin>
-#include <QtGui/QPixmapCache>
-#include <QtGui/QIconEngine>
-#include <QtGui/QPalette>
-#include <QtCore/QList>
-#include <QtCore/QHash>
-#include <QtCore/QDir>
-#include <QtCore/QSettings>
-#include <QtGui/QPainter>
-#include <QApplication>
-#include <QLatin1Literal>
-
-#include "qhexstring_p.h"
-
-namespace QtXdg
-{
-
-Q_GLOBAL_STATIC(QIconLoader, iconLoaderInstance)
-
-/* Theme to use in last resort, if the theme does not have the icon, neither the parents  */
-
-static QString fallbackTheme()
-{
-	return QString("hicolor");
-}
-
-QIconLoader::QIconLoader() : m_themeKey(1), m_supportsSvg(false), m_initialized(false)
-{
-}
-
-// We lazily initialize the loader to make static icons
-// work. Though we do not officially support this.
-
-static inline QString systemThemeName()
-{
-	return QIcon::themeName();
-}
-
-static inline QStringList systemIconSearchPaths()
-{
-	auto paths = QIcon::themeSearchPaths();
-	paths.push_front(":/icons");
-	return paths;
-}
-
-void QIconLoader::ensureInitialized()
-{
-	if (!m_initialized)
-	{
-		m_initialized = true;
-
-		Q_ASSERT(qApp);
-
-		m_systemTheme = QIcon::themeName();
-
-		if (m_systemTheme.isEmpty())
-			m_systemTheme = fallbackTheme();
-		m_supportsSvg = true;
-	}
-}
-
-QIconLoader *QIconLoader::instance()
-{
-	iconLoaderInstance()->ensureInitialized();
-	return iconLoaderInstance();
-}
-
-// Queries the system theme and invalidates existing
-// icons if the theme has changed.
-void QIconLoader::updateSystemTheme()
-{
-	// Only change if this is not explicitly set by the user
-	if (m_userTheme.isEmpty())
-	{
-		QString theme = systemThemeName();
-		if (theme.isEmpty())
-			theme = fallbackTheme();
-		if (theme != m_systemTheme)
-		{
-			m_systemTheme = theme;
-			invalidateKey();
-		}
-	}
-}
-
-void QIconLoader::setThemeName(const QString &themeName)
-{
-	m_userTheme = themeName;
-	invalidateKey();
-}
-
-void QIconLoader::setThemeSearchPath(const QStringList &searchPaths)
-{
-	m_iconDirs = searchPaths;
-	themeList.clear();
-	invalidateKey();
-}
-
-QStringList QIconLoader::themeSearchPaths() const
-{
-	if (m_iconDirs.isEmpty())
-	{
-		m_iconDirs = systemIconSearchPaths();
-	}
-	return m_iconDirs;
-}
-
-QIconTheme::QIconTheme(const QString &themeName) : m_valid(false)
-{
-	QFile themeIndex;
-
-	QStringList iconDirs = systemIconSearchPaths();
-	for (int i = 0; i < iconDirs.size(); ++i)
-	{
-		QDir iconDir(iconDirs[i]);
-		QString themeDir = iconDir.path() + QLatin1Char('/') + themeName;
-		themeIndex.setFileName(themeDir + QLatin1String("/index.theme"));
-		if (themeIndex.exists())
-		{
-			m_contentDir = themeDir;
-			m_valid = true;
-
-			foreach (QString path, iconDirs)
-			{
-				if (QFileInfo(path).isDir())
-					m_contentDirs.append(path + QLatin1Char('/') + themeName);
-			}
-
-			break;
-		}
-	}
-
-	// if there is no index file, abscond.
-	if (!themeIndex.exists())
-		return;
-
-	// otherwise continue reading index file
-	const QSettings indexReader(themeIndex.fileName(), QSettings::IniFormat);
-	QStringListIterator keyIterator(indexReader.allKeys());
-	while (keyIterator.hasNext())
-	{
-		const QString key = keyIterator.next();
-		if (!key.endsWith(QLatin1String("/Size")))
-			continue;
-
-		// Note the QSettings ini-format does not accept
-		// slashes in key names, hence we have to cheat
-		int size = indexReader.value(key).toInt();
-		if (!size)
-			continue;
-
-		QString directoryKey = key.left(key.size() - 5);
-		QIconDirInfo dirInfo(directoryKey);
-		dirInfo.size = size;
-		QString type =
-			indexReader.value(directoryKey + QLatin1String("/Type")).toString();
-
-		if (type == QLatin1String("Fixed"))
-			dirInfo.type = QIconDirInfo::Fixed;
-		else if (type == QLatin1String("Scalable"))
-			dirInfo.type = QIconDirInfo::Scalable;
-		else
-			dirInfo.type = QIconDirInfo::Threshold;
-
-		dirInfo.threshold =
-			indexReader.value(directoryKey + QLatin1String("/Threshold"), 2)
-				.toInt();
-
-		dirInfo.minSize =
-			indexReader.value(directoryKey + QLatin1String("/MinSize"), size)
-				.toInt();
-
-		dirInfo.maxSize =
-			indexReader.value(directoryKey + QLatin1String("/MaxSize"), size)
-				.toInt();
-		m_keyList.append(dirInfo);
-	}
-
-	// Parent themes provide fallbacks for missing icons
-	m_parents = indexReader.value(QLatin1String("Icon Theme/Inherits")).toStringList();
-	m_parents.removeAll(QString());
-
-	// Ensure a default platform fallback for all themes
-	if (m_parents.isEmpty())
-	{
-		const QString fallback = fallbackTheme();
-		if (!fallback.isEmpty())
-			m_parents.append(fallback);
-	}
-
-	// Ensure that all themes fall back to hicolor
-	if (!m_parents.contains(QLatin1String("hicolor")))
-		m_parents.append(QLatin1String("hicolor"));
-}
-
-QThemeIconEntries QIconLoader::findIconHelper(const QString &themeName, const QString &iconName,
-											  QStringList &visited) const
-{
-	QThemeIconEntries entries;
-	Q_ASSERT(!themeName.isEmpty());
-
-	QPixmap pixmap;
-
-	// Used to protect against potential recursions
-	visited << themeName;
-
-	QIconTheme theme = themeList.value(themeName);
-	if (!theme.isValid())
-	{
-		theme = QIconTheme(themeName);
-		if (!theme.isValid())
-			theme = QIconTheme(fallbackTheme());
-
-		themeList.insert(themeName, theme);
-	}
-
-	QStringList contentDirs = theme.contentDirs();
-	const QVector<QIconDirInfo> subDirs = theme.keyList();
-
-	const QString svgext(QLatin1String(".svg"));
-	const QString pngext(QLatin1String(".png"));
-	const QString xpmext(QLatin1String(".xpm"));
-
-	// Add all relevant files
-	for (int i = 0; i < subDirs.size(); ++i)
-	{
-		const QIconDirInfo &dirInfo = subDirs.at(i);
-		QString subdir = dirInfo.path;
-
-		foreach (QString contentDir, contentDirs)
-		{
-			QDir currentDir(contentDir + '/' + subdir);
-
-			if (currentDir.exists(iconName + pngext))
-			{
-				PixmapEntry *iconEntry = new PixmapEntry;
-				iconEntry->dir = dirInfo;
-				iconEntry->filename = currentDir.filePath(iconName + pngext);
-				// Notice we ensure that pixmap entries always come before
-				// scalable to preserve search order afterwards
-				entries.prepend(iconEntry);
-			}
-			else if (m_supportsSvg && currentDir.exists(iconName + svgext))
-			{
-				ScalableEntry *iconEntry = new ScalableEntry;
-				iconEntry->dir = dirInfo;
-				iconEntry->filename = currentDir.filePath(iconName + svgext);
-				entries.append(iconEntry);
-				break;
-			}
-			else if (currentDir.exists(iconName + xpmext))
-			{
-				PixmapEntry *iconEntry = new PixmapEntry;
-				iconEntry->dir = dirInfo;
-				iconEntry->filename = currentDir.filePath(iconName + xpmext);
-				// Notice we ensure that pixmap entries always come before
-				// scalable to preserve search order afterwards
-				entries.append(iconEntry);
-				break;
-			}
-		}
-	}
-
-	if (entries.isEmpty())
-	{
-		const QStringList parents = theme.parents();
-		// Search recursively through inherited themes
-		for (int i = 0; i < parents.size(); ++i)
-		{
-
-			const QString parentTheme = parents.at(i).trimmed();
-
-			if (!visited.contains(parentTheme)) // guard against recursion
-				entries = findIconHelper(parentTheme, iconName, visited);
-
-			if (!entries.isEmpty()) // success
-				break;
-		}
-	}
-
-/*********************************************************************
-Author: Kaitlin Rupert <kaitlin.rupert@intel.com>
-Date: Aug 12, 2010
-Description: Make it so that the QIcon loader honors /usr/share/pixmaps
-			 directory.  This is a valid directory per the Freedesktop.org
-			 icon theme specification.
-Bug: https://bugreports.qt.nokia.com/browse/QTBUG-12874
- *********************************************************************/
-#ifdef Q_OS_LINUX
-	/* Freedesktop standard says to look in /usr/share/pixmaps last */
-	if (entries.isEmpty())
-	{
-		const QString pixmaps(QLatin1String("/usr/share/pixmaps"));
-
-		QDir currentDir(pixmaps);
-		QIconDirInfo dirInfo(pixmaps);
-		if (currentDir.exists(iconName + pngext))
-		{
-			PixmapEntry *iconEntry = new PixmapEntry;
-			iconEntry->dir = dirInfo;
-			iconEntry->filename = currentDir.filePath(iconName + pngext);
-			// Notice we ensure that pixmap entries always come before
-			// scalable to preserve search order afterwards
-			entries.prepend(iconEntry);
-		}
-		else if (m_supportsSvg && currentDir.exists(iconName + svgext))
-		{
-			ScalableEntry *iconEntry = new ScalableEntry;
-			iconEntry->dir = dirInfo;
-			iconEntry->filename = currentDir.filePath(iconName + svgext);
-			entries.append(iconEntry);
-		}
-		else if (currentDir.exists(iconName + xpmext))
-		{
-			PixmapEntry *iconEntry = new PixmapEntry;
-			iconEntry->dir = dirInfo;
-			iconEntry->filename = currentDir.filePath(iconName + xpmext);
-			// Notice we ensure that pixmap entries always come before
-			// scalable to preserve search order afterwards
-			entries.append(iconEntry);
-		}
-	}
-#endif
-
-	if (entries.isEmpty())
-	{
-		// Search for unthemed icons in main dir of search paths
-		QStringList themeSearchPaths = QIcon::themeSearchPaths();
-		foreach (QString contentDir, themeSearchPaths)
-		{
-			QDir currentDir(contentDir);
-
-			if (currentDir.exists(iconName + pngext))
-			{
-				PixmapEntry *iconEntry = new PixmapEntry;
-				iconEntry->filename = currentDir.filePath(iconName + pngext);
-				// Notice we ensure that pixmap entries always come before
-				// scalable to preserve search order afterwards
-				entries.prepend(iconEntry);
-			}
-			else if (m_supportsSvg && currentDir.exists(iconName + svgext))
-			{
-				ScalableEntry *iconEntry = new ScalableEntry;
-				iconEntry->filename = currentDir.filePath(iconName + svgext);
-				entries.append(iconEntry);
-				break;
-			}
-			else if (currentDir.exists(iconName + xpmext))
-			{
-				PixmapEntry *iconEntry = new PixmapEntry;
-				iconEntry->filename = currentDir.filePath(iconName + xpmext);
-				// Notice we ensure that pixmap entries always come before
-				// scalable to preserve search order afterwards
-				entries.append(iconEntry);
-				break;
-			}
-		}
-	}
-	return entries;
-}
-
-QThemeIconEntries QIconLoader::loadIcon(const QString &name) const
-{
-	if (!themeName().isEmpty())
-	{
-		QStringList visited;
-		return findIconHelper(themeName(), name, visited);
-	}
-
-	return QThemeIconEntries();
-}
-
-// -------- Icon Loader Engine -------- //
-
-QIconLoaderEngineFixed::QIconLoaderEngineFixed(const QString &iconName)
-	: m_iconName(iconName), m_key(0)
-{
-}
-
-QIconLoaderEngineFixed::~QIconLoaderEngineFixed()
-{
-	qDeleteAll(m_entries);
-}
-
-QIconLoaderEngineFixed::QIconLoaderEngineFixed(const QIconLoaderEngineFixed &other)
-	: QIconEngine(other), m_iconName(other.m_iconName), m_key(0)
-{
-}
-
-QIconEngine *QIconLoaderEngineFixed::clone() const
-{
-	return new QIconLoaderEngineFixed(*this);
-}
-
-bool QIconLoaderEngineFixed::read(QDataStream &in)
-{
-	in >> m_iconName;
-	return true;
-}
-
-bool QIconLoaderEngineFixed::write(QDataStream &out) const
-{
-	out << m_iconName;
-	return true;
-}
-
-bool QIconLoaderEngineFixed::hasIcon() const
-{
-	return !(m_entries.isEmpty());
-}
-
-// Lazily load the icon
-void QIconLoaderEngineFixed::ensureLoaded()
-{
-	if (!(QIconLoader::instance()->themeKey() == m_key))
-	{
-
-		qDeleteAll(m_entries);
-
-		m_entries = QIconLoader::instance()->loadIcon(m_iconName);
-		m_key = QIconLoader::instance()->themeKey();
-	}
-}
-
-void QIconLoaderEngineFixed::paint(QPainter *painter, const QRect &rect, QIcon::Mode mode,
-								   QIcon::State state)
-{
-	QSize pixmapSize = rect.size();
-#if defined(Q_WS_MAC)
-	pixmapSize *= qt_mac_get_scalefactor();
-#endif
-	painter->drawPixmap(rect, pixmap(pixmapSize, mode, state));
-}
-
-/*
- * This algorithm is defined by the freedesktop spec:
- * http://standards.freedesktop.org/icon-theme-spec/icon-theme-spec-latest.html
- */
-static bool directoryMatchesSize(const QIconDirInfo &dir, int iconsize)
-{
-	if (dir.type == QIconDirInfo::Fixed)
-	{
-		return dir.size == iconsize;
-	}
-	else if (dir.type == QIconDirInfo::Scalable)
-	{
-		return dir.size <= dir.maxSize && iconsize >= dir.minSize;
-	}
-	else if (dir.type == QIconDirInfo::Threshold)
-	{
-		return iconsize >= dir.size - dir.threshold && iconsize <= dir.size + dir.threshold;
-	}
-
-	Q_ASSERT(1); // Not a valid value
-	return false;
-}
-
-/*
- * This algorithm is defined by the freedesktop spec:
- * http://standards.freedesktop.org/icon-theme-spec/icon-theme-spec-latest.html
- */
-static int directorySizeDistance(const QIconDirInfo &dir, int iconsize)
-{
-	if (dir.type == QIconDirInfo::Fixed)
-	{
-		return qAbs(dir.size - iconsize);
-	}
-	else if (dir.type == QIconDirInfo::Scalable)
-	{
-		if (iconsize < dir.minSize)
-			return dir.minSize - iconsize;
-		else if (iconsize > dir.maxSize)
-			return iconsize - dir.maxSize;
-		else
-			return 0;
-	}
-	else if (dir.type == QIconDirInfo::Threshold)
-	{
-		if (iconsize < dir.size - dir.threshold)
-			return dir.minSize - iconsize;
-		else if (iconsize > dir.size + dir.threshold)
-			return iconsize - dir.maxSize;
-		else
-			return 0;
-	}
-
-	Q_ASSERT(1); // Not a valid value
-	return INT_MAX;
-}
-
-QIconLoaderEngineEntry *QIconLoaderEngineFixed::entryForSize(const QSize &size)
-{
-	int iconsize = qMin(size.width(), size.height());
-
-	// Note that m_entries are sorted so that png-files
-	// come first
-
-	const int numEntries = m_entries.size();
-
-	// Search for exact matches first
-	for (int i = 0; i < numEntries; ++i)
-	{
-		QIconLoaderEngineEntry *entry = m_entries.at(i);
-		if (directoryMatchesSize(entry->dir, iconsize))
-		{
-			return entry;
-		}
-	}
-
-	// Find the minimum distance icon
-	int minimalSize = INT_MAX;
-	QIconLoaderEngineEntry *closestMatch = 0;
-	for (int i = 0; i < numEntries; ++i)
-	{
-		QIconLoaderEngineEntry *entry = m_entries.at(i);
-		int distance = directorySizeDistance(entry->dir, iconsize);
-		if (distance < minimalSize)
-		{
-			minimalSize = distance;
-			closestMatch = entry;
-		}
-	}
-	return closestMatch;
-}
-
-/*
- * Returns the actual icon size. For scalable svg's this is equivalent
- * to the requested size. Otherwise the closest match is returned but
- * we can never return a bigger size than the requested size.
- *
- */
-QSize QIconLoaderEngineFixed::actualSize(const QSize &size, QIcon::Mode mode,
-										 QIcon::State state)
-{
-	ensureLoaded();
-
-	QIconLoaderEngineEntry *entry = entryForSize(size);
-	if (entry)
-	{
-		const QIconDirInfo &dir = entry->dir;
-		if (dir.type == QIconDirInfo::Scalable)
-			return size;
-		else
-		{
-			int result = qMin<int>(dir.size, qMin(size.width(), size.height()));
-			return QSize(result, result);
-		}
-	}
-	return QIconEngine::actualSize(size, mode, state);
-}
-
-QPixmap PixmapEntry::pixmap(const QSize &size, QIcon::Mode mode, QIcon::State state)
-{
-	Q_UNUSED(state);
-
-	// Ensure that basePixmap is lazily initialized before generating the
-	// key, otherwise the cache key is not unique
-	if (basePixmap.isNull())
-		basePixmap.load(filename);
-
-	QSize actualSize = basePixmap.size();
-	if (!actualSize.isNull() &&
-		(actualSize.width() > size.width() || actualSize.height() > size.height()))
-		actualSize.scale(size, Qt::KeepAspectRatio);
-
-	QString key = QLatin1String("$qt_theme_") % HexString<qint64>(basePixmap.cacheKey()) %
-				  HexString<int>(mode) %
-				  HexString<qint64>(QGuiApplication::palette().cacheKey()) %
-				  HexString<int>(actualSize.width()) % HexString<int>(actualSize.height());
-
-	QPixmap cachedPixmap;
-	if (QPixmapCache::find(key, &cachedPixmap))
-	{
-		return cachedPixmap;
-	}
-	else
-	{
-		if (basePixmap.size() != actualSize)
-		{
-			cachedPixmap = basePixmap.scaled(actualSize, Qt::IgnoreAspectRatio, Qt::SmoothTransformation);
-		}
-		else
-		{
-			cachedPixmap = basePixmap;
-		}
-		QPixmapCache::insert(key, cachedPixmap);
-	}
-	return cachedPixmap;
-}
-
-QPixmap ScalableEntry::pixmap(const QSize &size, QIcon::Mode mode, QIcon::State state)
-{
-	if (svgIcon.isNull())
-	{
-		svgIcon = QIcon(filename);
-	}
-
-	// Simply reuse svg icon engine
-	return svgIcon.pixmap(size, mode, state);
-}
-
-QPixmap QIconLoaderEngineFixed::pixmap(const QSize &size, QIcon::Mode mode, QIcon::State state)
-{
-	ensureLoaded();
-
-	QIconLoaderEngineEntry *entry = entryForSize(size);
-	if (entry)
-	{
-		return entry->pixmap(size, mode, state);
-	}
-
-	return QPixmap();
-}
-
-QString QIconLoaderEngineFixed::key() const
-{
-	return QLatin1String("QIconLoaderEngineFixed");
-}
-
-void QIconLoaderEngineFixed::virtual_hook(int id, void *data)
-{
-	ensureLoaded();
-
-	switch (id)
-	{
-	case QIconEngine::AvailableSizesHook:
-	{
-		QIconEngine::AvailableSizesArgument &arg =
-			*reinterpret_cast<QIconEngine::AvailableSizesArgument *>(data);
-		const int N = m_entries.size();
-		QList<QSize> sizes;
-		sizes.reserve(N);
-
-		// Gets all sizes from the DirectoryInfo entries
-		for (int i = 0; i < N; ++i)
-		{
-			int size = m_entries.at(i)->dir.size;
-			sizes.append(QSize(size, size));
-		}
-		arg.sizes.swap(sizes); // commit
-	}
-	break;
-	case QIconEngine::IconNameHook:
-	{
-		QString &name = *reinterpret_cast<QString *>(data);
-		name = m_iconName;
-	}
-	break;
-	default:
-		QIconEngine::virtual_hook(id, data);
-	}
-}
-
-} // QtXdg
diff --git a/depends/iconfix/internal/qiconloader_p.h b/depends/iconfix/internal/qiconloader_p.h
deleted file mode 100644
index b71bdd83..00000000
--- a/depends/iconfix/internal/qiconloader_p.h
+++ /dev/null
@@ -1,219 +0,0 @@
-/****************************************************************************
-**
-** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
-** Contact: http://www.qt-project.org/legal
-**
-** This file is part of the QtGui module of the Qt Toolkit.
-**
-** $QT_BEGIN_LICENSE:LGPL21$
-** Commercial License Usage
-** Licensees holding valid commercial Qt licenses may use this file in
-** accordance with the commercial license agreement provided with the
-** Software or, alternatively, in accordance with the terms contained in
-** a written agreement between you and Digia. For licensing terms and
-** conditions see http://qt.digia.com/licensing. For further information
-** use the contact form at http://qt.digia.com/contact-us.
-**
-** GNU Lesser General Public License Usage
-** Alternatively, this file may be used under the terms of the GNU Lesser
-** General Public License version 2.1 or version 3 as published by the Free
-** Software Foundation and appearing in the file LICENSE.LGPLv21 and
-** LICENSE.LGPLv3 included in the packaging of this file. Please review the
-** following information to ensure the GNU Lesser General Public License
-** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
-** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
-**
-** In addition, as a special exception, Digia gives you certain additional
-** rights. These rights are described in the Digia Qt LGPL Exception
-** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
-**
-** $QT_END_LICENSE$
-**
-****************************************************************************/
-
-#pragma once
-
-#include <QtCore/qglobal.h>
-
-//
-//  W A R N I N G
-//  -------------
-//
-// This file is not part of the Qt API.  It exists purely as an
-// implementation detail.  This header file may change from version to
-// version without notice, or even be removed.
-//
-// We mean it.
-//
-
-#include <QtGui/QIcon>
-#include <QtGui/QIconEngine>
-#include <QtGui/QPixmapCache>
-#include <QtCore/QHash>
-#include <QtCore/QVector>
-#include <QtCore/QTypeInfo>
-
-
-namespace QtXdg
-{
-
-class QIconLoader;
-
-struct QIconDirInfo
-{
-	enum Type
-	{
-		Fixed,
-		Scalable,
-		Threshold
-	};
-	QIconDirInfo(const QString &_path = QString())
-		: path(_path), size(0), maxSize(0), minSize(0), threshold(0), type(Threshold)
-	{
-	}
-	QString path;
-	short size;
-	short maxSize;
-	short minSize;
-	short threshold;
-	Type type : 4;
-};
-
-class QIconLoaderEngineEntry
-{
-public:
-	virtual ~QIconLoaderEngineEntry()
-	{
-	}
-	virtual QPixmap pixmap(const QSize &size, QIcon::Mode mode, QIcon::State state) = 0;
-	QString filename;
-	QIconDirInfo dir;
-	static int count;
-};
-
-struct ScalableEntry : public QIconLoaderEngineEntry
-{
-	QPixmap pixmap(const QSize &size, QIcon::Mode mode, QIcon::State state) Q_DECL_OVERRIDE;
-	QIcon svgIcon;
-};
-
-struct PixmapEntry : public QIconLoaderEngineEntry
-{
-	QPixmap pixmap(const QSize &size, QIcon::Mode mode, QIcon::State state) Q_DECL_OVERRIDE;
-	QPixmap basePixmap;
-};
-
-typedef QList<QIconLoaderEngineEntry *> QThemeIconEntries;
-
-// class QIconLoaderEngine : public QIconEngine
-class QIconLoaderEngineFixed : public QIconEngine
-{
-public:
-	QIconLoaderEngineFixed(const QString &iconName = QString());
-	~QIconLoaderEngineFixed();
-
-	void paint(QPainter *painter, const QRect &rect, QIcon::Mode mode, QIcon::State state);
-	QPixmap pixmap(const QSize &size, QIcon::Mode mode, QIcon::State state);
-	QSize actualSize(const QSize &size, QIcon::Mode mode, QIcon::State state);
-	QIconEngine *clone() const;
-	bool read(QDataStream &in);
-	bool write(QDataStream &out) const;
-
-private:
-	QString key() const;
-	bool hasIcon() const;
-	void ensureLoaded();
-	void virtual_hook(int id, void *data);
-	QIconLoaderEngineEntry *entryForSize(const QSize &size);
-	QIconLoaderEngineFixed(const QIconLoaderEngineFixed &other);
-	QThemeIconEntries m_entries;
-	QString m_iconName;
-	uint m_key;
-
-	friend class QIconLoader;
-};
-
-class QIconTheme
-{
-public:
-	QIconTheme(const QString &name);
-	QIconTheme() : m_valid(false)
-	{
-	}
-	QStringList parents()
-	{
-		return m_parents;
-	}
-	QVector<QIconDirInfo> keyList()
-	{
-		return m_keyList;
-	}
-	QString contentDir()
-	{
-		return m_contentDir;
-	}
-	QStringList contentDirs()
-	{
-		return m_contentDirs;
-	}
-	bool isValid()
-	{
-		return m_valid;
-	}
-
-private:
-	QString m_contentDir;
-	QStringList m_contentDirs;
-	QVector<QIconDirInfo> m_keyList;
-	QStringList m_parents;
-	bool m_valid;
-};
-
-class QIconLoader
-{
-public:
-	QIconLoader();
-	QThemeIconEntries loadIcon(const QString &iconName) const;
-	uint themeKey() const
-	{
-		return m_themeKey;
-	}
-
-	QString themeName() const
-	{
-		return m_userTheme.isEmpty() ? m_systemTheme : m_userTheme;
-	}
-	void setThemeName(const QString &themeName);
-	QIconTheme theme()
-	{
-		return themeList.value(themeName());
-	}
-	void setThemeSearchPath(const QStringList &searchPaths);
-	QStringList themeSearchPaths() const;
-	QIconDirInfo dirInfo(int dirindex);
-	static QIconLoader *instance();
-	void updateSystemTheme();
-	void invalidateKey()
-	{
-		m_themeKey++;
-	}
-	void ensureInitialized();
-
-private:
-	QThemeIconEntries findIconHelper(const QString &themeName, const QString &iconName,
-									 QStringList &visited) const;
-	uint m_themeKey;
-	bool m_supportsSvg;
-	bool m_initialized;
-
-	mutable QString m_userTheme;
-	mutable QString m_systemTheme;
-	mutable QStringList m_iconDirs;
-	mutable QHash<QString, QIconTheme> themeList;
-};
-
-} // QtXdg
-
-// Note: class template specialization of 'QTypeInfo' must occur at
-//       global scope
-Q_DECLARE_TYPEINFO(QtXdg::QIconDirInfo, Q_MOVABLE_TYPE);
diff --git a/depends/iconfix/xdgicon.cpp b/depends/iconfix/xdgicon.cpp
deleted file mode 100644
index a36d80a9..00000000
--- a/depends/iconfix/xdgicon.cpp
+++ /dev/null
@@ -1,152 +0,0 @@
-/* BEGIN_COMMON_COPYRIGHT_HEADER
- * (c)LGPL2+
- *
- * Razor - a lightweight, Qt based, desktop toolset
- * http://razor-qt.org
- *
- * Copyright: 2010-2011 Razor team
- * Authors:
- *   Alexander Sokoloff <sokoloff.a@gmail.com>
- *
- * This program or library is free software; you can redistribute it
- * and/or modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library 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
- * Lesser General Public License for more details.
-
- * You should have received a copy of the GNU Lesser General
- * Public License along with this library; if not, write to the
- * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
- * Boston, MA 02110-1301 USA
- *
- * END_COMMON_COPYRIGHT_HEADER */
-
-#include "xdgicon.h"
-
-#include <QString>
-#include <QDebug>
-#include <QDir>
-#include <QStringList>
-#include <QFileInfo>
-#include <QCache>
-#include "internal/qiconloader_p.h"
-#include <QCoreApplication>
-
-/************************************************
-
- ************************************************/
-static void qt_cleanup_icon_cache();
-typedef QCache<QString, QIcon> IconCache;
-
-namespace
-{
-struct QtIconCache : public IconCache
-{
-	QtIconCache()
-	{
-		qAddPostRoutine(qt_cleanup_icon_cache);
-	}
-};
-}
-Q_GLOBAL_STATIC(IconCache, qtIconCache);
-
-static void qt_cleanup_icon_cache()
-{
-	qtIconCache()->clear();
-}
-
-/************************************************
-
- ************************************************/
-XdgIcon::XdgIcon()
-{
-}
-
-/************************************************
-
- ************************************************/
-XdgIcon::~XdgIcon()
-{
-}
-
-/************************************************
- Returns the name of the current icon theme.
- ************************************************/
-QString XdgIcon::themeName()
-{
-	return QIcon::themeName();
-}
-
-/************************************************
- Sets the current icon theme to name.
- ************************************************/
-void XdgIcon::setThemeName(const QString &themeName)
-{
-	QIcon::setThemeName(themeName);
-	QtXdg::QIconLoader::instance()->updateSystemTheme();
-}
-
-/************************************************
- Returns the QIcon corresponding to name in the current icon theme. If no such icon
- is found in the current theme fallback is return instead.
- ************************************************/
-QIcon XdgIcon::fromTheme(const QString &iconName, const QIcon &fallback)
-{
-	if (iconName.isEmpty())
-		return fallback;
-
-	bool isAbsolute = (iconName[0] == '/');
-
-	QString name = QFileInfo(iconName).fileName();
-	if (name.endsWith(".png", Qt::CaseInsensitive) ||
-		name.endsWith(".svg", Qt::CaseInsensitive) ||
-		name.endsWith(".xpm", Qt::CaseInsensitive))
-	{
-		name.truncate(name.length() - 4);
-	}
-
-	QIcon icon;
-
-	if (qtIconCache()->contains(name))
-	{
-		icon = *qtIconCache()->object(name);
-	}
-	else
-	{
-		QIcon *cachedIcon;
-		if (!isAbsolute)
-			cachedIcon = new QIcon(new QtXdg::QIconLoaderEngineFixed(name));
-		else
-			cachedIcon = new QIcon(iconName);
-		qtIconCache()->insert(name, cachedIcon);
-		icon = *cachedIcon;
-	}
-
-	// Note the qapp check is to allow lazy loading of static icons
-	// Supporting fallbacks will not work for this case.
-	if (qApp && !isAbsolute && icon.availableSizes().isEmpty())
-	{
-		return fallback;
-	}
-	return icon;
-}
-
-/************************************************
- Returns the QIcon corresponding to names in the current icon theme. If no such icon
- is found in the current theme fallback is return instead.
- ************************************************/
-QIcon XdgIcon::fromTheme(const QStringList &iconNames, const QIcon &fallback)
-{
-	foreach (QString iconName, iconNames)
-	{
-		QIcon icon = fromTheme(iconName);
-		if (!icon.isNull())
-			return icon;
-	}
-
-	return fallback;
-}
diff --git a/depends/iconfix/xdgicon.h b/depends/iconfix/xdgicon.h
deleted file mode 100644
index 9c11683a..00000000
--- a/depends/iconfix/xdgicon.h
+++ /dev/null
@@ -1,46 +0,0 @@
-/* BEGIN_COMMON_COPYRIGHT_HEADER
- * (c)LGPL2+
- *
- * Razor - a lightweight, Qt based, desktop toolset
- * http://razor-qt.org
- *
- * Copyright: 2010-2011 Razor team
- * Authors:
- *   Alexander Sokoloff <sokoloff.a@gmail.com>
- *
- * This program or library is free software; you can redistribute it
- * and/or modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library 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
- * Lesser General Public License for more details.
-
- * You should have received a copy of the GNU Lesser General
- * Public License along with this library; if not, write to the
- * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
- * Boston, MA 02110-1301 USA
- *
- * END_COMMON_COPYRIGHT_HEADER */
-
-#pragma once
-
-#include <QtGui/QIcon>
-#include <QString>
-#include <QStringList>
-
-class XdgIcon
-{
-public:
-	static QIcon fromTheme(const QString &iconName, const QIcon &fallback = QIcon());
-	static QIcon fromTheme(const QStringList &iconNames, const QIcon &fallback = QIcon());
-
-	static QString themeName();
-	static void setThemeName(const QString &themeName);
-
-protected:
-	explicit XdgIcon();
-	virtual ~XdgIcon();
-};
diff --git a/depends/javacheck/.gitignore b/depends/javacheck/.gitignore
deleted file mode 100644
index cc1c52bf..00000000
--- a/depends/javacheck/.gitignore
+++ /dev/null
@@ -1,6 +0,0 @@
-.idea
-*.iml
-out
-.classpath
-.idea
-.project
diff --git a/depends/javacheck/CMakeLists.txt b/depends/javacheck/CMakeLists.txt
deleted file mode 100644
index 9768650e..00000000
--- a/depends/javacheck/CMakeLists.txt
+++ /dev/null
@@ -1,13 +0,0 @@
-cmake_minimum_required(VERSION 3.1)
-project(launcher Java)
-find_package(Java 1.6 REQUIRED COMPONENTS Development)
-
-include(UseJava)
-set(CMAKE_JAVA_JAR_ENTRY_POINT JavaCheck)
-set(CMAKE_JAVA_COMPILE_FLAGS -target 1.6 -source 1.6 -Xlint:deprecation -Xlint:unchecked)
-
-set(SRC
-	JavaCheck.java
-)
-
-add_jar(JavaCheck ${SRC})
diff --git a/depends/javacheck/JavaCheck.java b/depends/javacheck/JavaCheck.java
deleted file mode 100644
index 11420b86..00000000
--- a/depends/javacheck/JavaCheck.java
+++ /dev/null
@@ -1,24 +0,0 @@
-import java.lang.Integer;
-
-public class JavaCheck
-{
-	private static final String[] keys = {"os.arch", "java.version"};
-	public static void main (String [] args)
-	{
-		int ret = 0;
-		for(String key : keys)
-		{
-			String property = System.getProperty(key);
-			if(property != null)
-			{
-				System.out.println(key + "=" + property);
-			}
-			else
-			{
-				ret = 1;
-			}
-		}
-		
-		System.exit(ret);
-	}
-}
diff --git a/depends/launcher/.gitignore b/depends/launcher/.gitignore
deleted file mode 100644
index cc1c52bf..00000000
--- a/depends/launcher/.gitignore
+++ /dev/null
@@ -1,6 +0,0 @@
-.idea
-*.iml
-out
-.classpath
-.idea
-.project
diff --git a/depends/launcher/CMakeLists.txt b/depends/launcher/CMakeLists.txt
deleted file mode 100644
index b62805e0..00000000
--- a/depends/launcher/CMakeLists.txt
+++ /dev/null
@@ -1,34 +0,0 @@
-cmake_minimum_required(VERSION 3.1)
-project(launcher Java)
-find_package(Java 1.6 REQUIRED COMPONENTS Development)
-
-include(UseJava)
-set(CMAKE_JAVA_JAR_ENTRY_POINT org.multimc.EntryPoint)
-set(CMAKE_JAVA_COMPILE_FLAGS -target 1.6 -source 1.6 -Xlint:deprecation -Xlint:unchecked)
-
-set(SRC
-	# OSX things
-	org/simplericity/macify/eawt/Application.java
-	org/simplericity/macify/eawt/ApplicationAdapter.java
-	org/simplericity/macify/eawt/ApplicationEvent.java
-	org/simplericity/macify/eawt/ApplicationListener.java
-	org/simplericity/macify/eawt/DefaultApplication.java
-
-	# legacy applet wrapper thing.
-	# The launcher has to be there for silly FML/Forge relauncher.
-	net/minecraft/Launcher.java
-	org/multimc/legacy/LegacyLauncher.java
-	org/multimc/LegacyFrame.java
-
-	# onesix launcher
-	org/multimc/onesix/OneSixLauncher.java
-
-	# generic launcher
-	org/multimc/EntryPoint.java
-	org/multimc/Launcher.java
-	org/multimc/ParseException.java
-	org/multimc/Utils.java
-	org/multimc/IconLoader.java
-)
-add_jar(NewLaunch ${SRC})
-
diff --git a/depends/launcher/net/minecraft/Launcher.java b/depends/launcher/net/minecraft/Launcher.java
deleted file mode 100644
index a53501ec..00000000
--- a/depends/launcher/net/minecraft/Launcher.java
+++ /dev/null
@@ -1,165 +0,0 @@
-/*
- * Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package net.minecraft;
-
-import java.util.TreeMap;
-import java.util.Map;
-import java.net.URL;
-import java.awt.Dimension;
-import java.awt.BorderLayout;
-import java.awt.Graphics;
-import java.applet.Applet;
-import java.applet.AppletStub;
-import java.net.MalformedURLException;
-
-public class Launcher extends Applet implements AppletStub
-{
-	private Applet wrappedApplet;
-	private URL documentBase;
-	private boolean active = false;
-	private final Map<String, String> params;
-
-	public Launcher(Applet applet, URL documentBase)
-	{
-		params = new TreeMap<String, String>();
-
-		this.setLayout(new BorderLayout());
-	    this.add(applet, "Center");
-		this.wrappedApplet = applet;
-		this.documentBase = documentBase;
-	}
-
-	public void setParameter(String name, String value)
-	{
-		params.put(name, value);
-	}
-
-	public void replace(Applet applet)
-	{
-		this.wrappedApplet = applet;
-
-		applet.setStub(this);
-		applet.setSize(getWidth(), getHeight());
-
-		this.setLayout(new BorderLayout());
-		this.add(applet, "Center");
-
-	    applet.init();
-	    active = true;
-	    applet.start();
-	    validate();
-	}
-
-	@Override
-	public String getParameter(String name)
-	{
-		String param = params.get(name);
-		if (param != null)
-			return param;
-		try
-		{
-			return super.getParameter(name);
-		} catch (Exception ignore){}
-		return null;
-	}
-
-	@Override
-	public boolean isActive()
-	{
-		return active;
-	}
-
-	@Override
-	public void appletResize(int width, int height)
-	{
-		wrappedApplet.resize(width, height);
-	}
-
-	@Override
-	public void resize(int width, int height)
-	{
-		wrappedApplet.resize(width, height);
-	}
-
-	@Override
-	public void resize(Dimension d)
-	{
-		wrappedApplet.resize(d);
-	}
-
-	@Override
-	public void init()
-	{
-		if (wrappedApplet != null)
-		{
-			wrappedApplet.init();
-		}
-	}
-
-	@Override
-	public void start()
-	{
-		wrappedApplet.start();
-		active = true;
-	}
-
-	@Override
-	public void stop()
-	{
-		wrappedApplet.stop();
-		active = false;
-	}
-
-	public void destroy()
-	{
-		wrappedApplet.destroy();
-	}
-
-	@Override
-	public URL getCodeBase() {
-		try {
-			return new URL("http://www.minecraft.net/game/");
-		} catch (MalformedURLException e) {
-			e.printStackTrace();
-		}
-		return null;
-	}
-
-	@Override
-	public URL getDocumentBase()
-	{
-		try {
-			return new URL("http://www.minecraft.net/game/");
-		} catch (MalformedURLException e) {
-			e.printStackTrace();
-		}
-		return null;
-	}
-
-	@Override
-	public void setVisible(boolean b)
-	{
-		super.setVisible(b);
-		wrappedApplet.setVisible(b);
-	}
-	public void update(Graphics paramGraphics)
-	{
-	}
-	public void paint(Graphics paramGraphics)
-	{
-	}
-}
\ No newline at end of file
diff --git a/depends/launcher/org/multimc/EntryPoint.java b/depends/launcher/org/multimc/EntryPoint.java
deleted file mode 100644
index d1fc54a8..00000000
--- a/depends/launcher/org/multimc/EntryPoint.java
+++ /dev/null
@@ -1,178 +0,0 @@
-package org.multimc;/*
- * Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-import org.multimc.legacy.LegacyLauncher;
-import org.multimc.onesix.OneSixLauncher;
-import org.simplericity.macify.eawt.Application;
-import org.simplericity.macify.eawt.DefaultApplication;
-
-import javax.imageio.ImageIO;
-import java.awt.image.BufferedImage;
-import java.io.*;
-import java.nio.charset.Charset;
-
-public class EntryPoint
-{
-	private enum Action
-	{
-		Proceed,
-		Launch,
-		Abort
-	}
-
-	public static void main(String[] args)
-	{
-		// Set the OSX application icon first, if we are on OSX.
-		Application application = new DefaultApplication();
-		if(application.isMac())
-		{
-			try
-			{
-				BufferedImage image = ImageIO.read(new File("icon.png"));
-				application.setApplicationIconImage(image);
-			}
-			catch (IOException e)
-			{
-				e.printStackTrace();
-			}
-		}
-
-		EntryPoint listener = new EntryPoint();
-		int retCode = listener.listen();
-		if (retCode != 0)
-		{
-			System.out.println("Exiting with " + retCode);
-			System.exit(retCode);
-		}
-	}
-
-	private Action parseLine(String inData) throws ParseException
-	{
-		String[] pair = inData.split(" ", 2);
-
-		if(pair.length == 1)
-		{
-			String command = pair[0];
-			if (pair[0].equals("launch"))
-				return Action.Launch;
-
-			else if (pair[0].equals("abort"))
-				return Action.Abort;
-
-			else throw new ParseException();
-		}
-
-		if(pair.length != 2)
-			throw new ParseException();
-
-		String command = pair[0];
-		String param = pair[1];
-
-		if(command.equals("launcher"))
-		{
-			if(param.equals("legacy"))
-			{
-				m_launcher = new LegacyLauncher();
-				Utils.log("Using legacy launcher.");
-				Utils.log();
-				return Action.Proceed;
-			}
-			if(param.equals("onesix"))
-			{
-				m_launcher = new OneSixLauncher();
-				Utils.log("Using onesix launcher.");
-				Utils.log();
-				return Action.Proceed;
-			}
-			else
-				throw new ParseException();
-		}
-
-		m_params.add(command, param);
-		//System.out.println(command + " : " + param);
-		return Action.Proceed;
-	}
-
-	public int listen()
-	{
-		BufferedReader buffer;
-		try
-		{
-			buffer = new BufferedReader(new InputStreamReader(System.in, "UTF-8"));
-		} catch (UnsupportedEncodingException e)
-		{
-			System.err.println("For some reason, your java does not support UTF-8. Consider living in the current century.");
-			e.printStackTrace();
-			return 1;
-		}
-		boolean isListening = true;
-		boolean isAborted = false;
-		// Main loop
-		while (isListening)
-		{
-			String inData;
-			try
-			{
-				// Read from the pipe one line at a time
-				inData = buffer.readLine();
-				if (inData != null)
-				{
-					Action a = parseLine(inData);
-					if(a == Action.Abort)
-					{
-						isListening = false;
-						isAborted = true;
-					}
-					if(a == Action.Launch)
-					{
-						isListening = false;
-					}
-				}
-				else
-				{
-					isListening = false;
-					isAborted = true;
-				}
-			}
-			catch (IOException e)
-			{
-				System.err.println("Launcher ABORT due to IO exception:");
-				e.printStackTrace();
-				return 1;
-			}
-			catch (ParseException e)
-			{
-				System.err.println("Launcher ABORT due to PARSE exception:");
-				e.printStackTrace();
-				return 1;
-			}
-		}
-		if(isAborted)
-		{
-			System.err.println("Launch aborted by MultiMC.");
-			return 1;
-		}
-		if(m_launcher != null)
-		{
-			return m_launcher.launch(m_params);
-		}
-		System.err.println("No valid launcher implementation specified.");
-		return 1;
-	}
-
-	private ParamBucket m_params = new ParamBucket();
-	private org.multimc.Launcher m_launcher;
-}
diff --git a/depends/launcher/org/multimc/IconLoader.java b/depends/launcher/org/multimc/IconLoader.java
deleted file mode 100644
index f1638f3a..00000000
--- a/depends/launcher/org/multimc/IconLoader.java
+++ /dev/null
@@ -1,132 +0,0 @@
-package org.multimc;
-
-import javax.imageio.ImageIO;
-import java.awt.*;
-import java.awt.image.BufferedImage;
-import java.io.File;
-import java.io.IOException;
-import java.nio.ByteBuffer;
-
-/*****************************************************************************
- * A convenience class for loading icons from images.
- *
- * Icons loaded from this class are formatted to fit within the required
- * dimension (16x16, 32x32, or 128x128). If the source image is larger than the
- * target dimension, it is shrunk down to the minimum size that will fit. If it
- * is smaller, then it is only scaled up if the new scale can be a per-pixel
- * linear scale (i.e., x2, x3, x4, etc). In both cases, the image's width/height
- * ratio is kept the same as the source image.
- *
- * @author Chris Molini
- *****************************************************************************/
-public class IconLoader
-{
-	/*************************************************************************
-	 * Loads an icon in ByteBuffer form.
-	 *
-	 * @param filepath
-	 *            The location of the Image to use as an icon.
-	 *
-	 * @return An array of ByteBuffers containing the pixel data for the icon in
-	 *         various sizes (as recommended by the OS).
-	 *************************************************************************/
-	public static ByteBuffer[] load(String filepath)
-	{
-		BufferedImage image;
-		try {
-			image = ImageIO.read ( new File( filepath ) );
-		} catch ( IOException e ) {
-			e.printStackTrace();
-			return new ByteBuffer[0];
-		}
-		ByteBuffer[] buffers;
-		buffers = new ByteBuffer[1];
-		buffers[0] = loadInstance(image, 128);
-		return buffers;
-	}
-
-	/*************************************************************************
-	 * Copies the supplied image into a square icon at the indicated size.
-	 *
-	 * @param image
-	 *            The image to place onto the icon.
-	 * @param dimension
-	 *            The desired size of the icon.
-	 *
-	 * @return A ByteBuffer of pixel data at the indicated size.
-	 *************************************************************************/
-	private static ByteBuffer loadInstance(BufferedImage image, int dimension)
-	{
-		BufferedImage scaledIcon = new BufferedImage(dimension, dimension,
-				BufferedImage.TYPE_INT_ARGB_PRE);
-		Graphics2D g = scaledIcon.createGraphics();
-		double ratio = getIconRatio(image, scaledIcon);
-		double width = image.getWidth() * ratio;
-		double height = image.getHeight() * ratio;
-		g.drawImage(image, (int) ((scaledIcon.getWidth() - width) / 2),
-				(int) ((scaledIcon.getHeight() - height) / 2), (int) (width),
-				(int) (height), null);
-		g.dispose();
-
-		return convertToByteBuffer(scaledIcon);
-	}
-
-	/*************************************************************************
-	 * Gets the width/height ratio of the icon. This is meant to simplify
-	 * scaling the icon to a new dimension.
-	 *
-	 * @param src
-	 *            The base image that will be placed onto the icon.
-	 * @param icon
-	 *            The icon that will have the image placed on it.
-	 *
-	 * @return The amount to scale the source image to fit it onto the icon
-	 *         appropriately.
-	 *************************************************************************/
-	private static double getIconRatio(BufferedImage src, BufferedImage icon)
-	{
-		double ratio = 1;
-		if (src.getWidth() > icon.getWidth())
-			ratio = (double) (icon.getWidth()) / src.getWidth();
-		else
-			ratio = (int) (icon.getWidth() / src.getWidth());
-		if (src.getHeight() > icon.getHeight())
-		{
-			double r2 = (double) (icon.getHeight()) / src.getHeight();
-			if (r2 < ratio)
-				ratio = r2;
-		}
-		else
-		{
-			double r2 = (int) (icon.getHeight() / src.getHeight());
-			if (r2 < ratio)
-				ratio = r2;
-		}
-		return ratio;
-	}
-
-	/*************************************************************************
-	 * Converts a BufferedImage into a ByteBuffer of pixel data.
-	 *
-	 * @param image
-	 *            The image to convert.
-	 *
-	 * @return A ByteBuffer that contains the pixel data of the supplied image.
-	 *************************************************************************/
-	public static ByteBuffer convertToByteBuffer(BufferedImage image)
-	{
-		byte[] buffer = new byte[image.getWidth() * image.getHeight() * 4];
-		int counter = 0;
-		for (int i = 0; i < image.getHeight(); i++)
-			for (int j = 0; j < image.getWidth(); j++)
-			{
-				int colorSpace = image.getRGB(j, i);
-				buffer[counter + 0] = (byte) ((colorSpace << 8) >> 24);
-				buffer[counter + 1] = (byte) ((colorSpace << 16) >> 24);
-				buffer[counter + 2] = (byte) ((colorSpace << 24) >> 24);
-				buffer[counter + 3] = (byte) (colorSpace >> 24);
-				counter += 4;
-			}
-		return ByteBuffer.wrap(buffer);
-	}
-}
\ No newline at end of file
diff --git a/depends/launcher/org/multimc/Launcher.java b/depends/launcher/org/multimc/Launcher.java
deleted file mode 100644
index 1aa2b21f..00000000
--- a/depends/launcher/org/multimc/Launcher.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/*
- * Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.multimc;
-
-public interface Launcher
-{
-	abstract int launch(ParamBucket params);
-}
diff --git a/depends/launcher/org/multimc/LegacyFrame.java b/depends/launcher/org/multimc/LegacyFrame.java
deleted file mode 100644
index a081f3ae..00000000
--- a/depends/launcher/org/multimc/LegacyFrame.java
+++ /dev/null
@@ -1,112 +0,0 @@
-package org.multimc;/*
- * Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-import net.minecraft.Launcher;
-
-import javax.imageio.ImageIO;
-import java.applet.Applet;
-import java.awt.*;
-import java.awt.event.WindowEvent;
-import java.awt.event.WindowListener;
-import java.awt.image.BufferedImage;
-import java.io.File;
-import java.io.IOException;
-import java.net.MalformedURLException;
-import java.net.URL;
-
-public class LegacyFrame extends Frame implements WindowListener
-{
-    private Launcher appletWrap = null;
-    public LegacyFrame(String title)
-    {
-        super ( title );
-        BufferedImage image;
-        try {
-            image = ImageIO.read ( new File ( "icon.png" ) );
-            setIconImage ( image );
-        } catch ( IOException e ) {
-            e.printStackTrace();
-        }
-        this.addWindowListener ( this );
-    }
-
-    public void start ( Applet mcApplet, String user, String session, Dimension winSize, boolean maximize )
-    {
-        try {
-            appletWrap = new Launcher( mcApplet, new URL ( "http://www.minecraft.net/game" ) );
-        } catch ( MalformedURLException ignored ) {}
-        appletWrap.setParameter ( "username", user );
-        appletWrap.setParameter ( "sessionid", session );
-        appletWrap.setParameter ( "stand-alone", "true" ); // Show the quit button.
-		appletWrap.setParameter ( "demo", "false" );
-		appletWrap.setParameter("fullscreen", "false");
-        mcApplet.setStub(appletWrap);
-        this.add ( appletWrap );
-        appletWrap.setPreferredSize ( winSize );
-        this.pack();
-        this.setLocationRelativeTo ( null );
-        this.setResizable ( true );
-        if ( maximize ) {
-            this.setExtendedState ( MAXIMIZED_BOTH );
-        }
-        validate();
-        appletWrap.init();
-        appletWrap.start();
-        setVisible ( true );
-    }
-
-    @Override
-    public void windowActivated ( WindowEvent e ) {}
-
-    @Override
-    public void windowClosed ( WindowEvent e ) {}
-
-    @Override
-    public void windowClosing ( WindowEvent e )
-    {
-        new Thread() {
-            public void run() {
-                try {
-                    Thread.sleep ( 30000L );
-                } catch ( InterruptedException localInterruptedException ) {
-                    localInterruptedException.printStackTrace();
-                }
-                System.out.println ( "FORCING EXIT!" );
-                System.exit ( 0 );
-            }
-        }
-        .start();
-
-        if ( appletWrap != null ) {
-            appletWrap.stop();
-            appletWrap.destroy();
-        }
-        // old minecraft versions can hang without this >_<
-        System.exit ( 0 );
-    }
-
-    @Override
-    public void windowDeactivated ( WindowEvent e ) {}
-
-    @Override
-    public void windowDeiconified ( WindowEvent e ) {}
-
-    @Override
-    public void windowIconified ( WindowEvent e ) {}
-
-    @Override
-    public void windowOpened ( WindowEvent e ) {}
-}
diff --git a/depends/launcher/org/multimc/NotFoundException.java b/depends/launcher/org/multimc/NotFoundException.java
deleted file mode 100644
index fe154a2f..00000000
--- a/depends/launcher/org/multimc/NotFoundException.java
+++ /dev/null
@@ -1,21 +0,0 @@
-/*
- * Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.multimc;
-
-public class NotFoundException extends Exception
-{
-}
diff --git a/depends/launcher/org/multimc/ParamBucket.java b/depends/launcher/org/multimc/ParamBucket.java
deleted file mode 100644
index 2e197d9f..00000000
--- a/depends/launcher/org/multimc/ParamBucket.java
+++ /dev/null
@@ -1,86 +0,0 @@
-/*
- * Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.multimc;
-
-import java.util.ArrayList;
-import java.util.HashMap;
-import java.util.List;
-
-public class ParamBucket
-{
-	public void add(String key, String value)
-	{
-		List<String> coll = null;
-		if(!m_params.containsKey(key))
-		{
-			coll = new ArrayList<String>();
-			m_params.put(key, coll);
-		}
-		else
-		{
-			coll = m_params.get(key);
-		}
-		coll.add(value);
-	}
-
-	public List<String> all(String key) throws NotFoundException
-	{
-		if(!m_params.containsKey(key))
-			throw new NotFoundException();
-		return m_params.get(key);
-	}
-
-	public List<String> allSafe(String key, List<String> def)
-	{
-		if(!m_params.containsKey(key) || m_params.get(key).size() < 1)
-		{
-			return def;
-		}
-		return m_params.get(key);
-	}
-
-	public List<String> allSafe(String key)
-	{
-		return allSafe(key, new ArrayList<String>());
-	}
-
-	public String first(String key) throws NotFoundException
-	{
-		List<String> list = all(key);
-		if(list.size() < 1)
-		{
-			throw new NotFoundException();
-		}
-		return list.get(0);
-	}
-
-	public String firstSafe(String key, String def)
-	{
-		if(!m_params.containsKey(key) || m_params.get(key).size() < 1)
-		{
-			return def;
-		}
-		return m_params.get(key).get(0);
-	}
-
-	public String firstSafe(String key)
-	{
-		return firstSafe(key, "");
-	}
-
-	private HashMap<String, List<String>> m_params = new HashMap<String, List<String>>();
-}
diff --git a/depends/launcher/org/multimc/ParseException.java b/depends/launcher/org/multimc/ParseException.java
deleted file mode 100644
index d9e8e53e..00000000
--- a/depends/launcher/org/multimc/ParseException.java
+++ /dev/null
@@ -1,22 +0,0 @@
-/*
- * Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.multimc;
-
-public class ParseException extends java.lang.Exception
-{
-
-}
diff --git a/depends/launcher/org/multimc/Utils.java b/depends/launcher/org/multimc/Utils.java
deleted file mode 100644
index 32cf7919..00000000
--- a/depends/launcher/org/multimc/Utils.java
+++ /dev/null
@@ -1,280 +0,0 @@
-/*
- * Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.multimc;
-
-import java.io.*;
-import java.io.File;
-import java.lang.reflect.Field;
-import java.lang.reflect.Method;
-import java.lang.reflect.Modifier;
-import java.net.URL;
-import java.net.URLClassLoader;
-import java.nio.file.Files;
-import java.nio.file.Path;
-import java.util.*;
-import java.util.Arrays;
-import java.util.Enumeration;
-import java.util.List;
-import java.util.zip.ZipEntry;
-import java.util.zip.ZipFile;
-
-public class Utils
-{
-	/**
-	 * Combine two parts of a path.
-	 *
-	 * @param path1
-	 * @param path2
-	 * @return the paths, combined
-	 */
-	public static String combine(String path1, String path2)
-	{
-		File file1 = new File(path1);
-		File file2 = new File(file1, path2);
-		return file2.getPath();
-	}
-
-	/**
-	 * Join a list of strings into a string using a separator!
-	 *
-	 * @param strings   the string list to join
-	 * @param separator the glue
-	 * @return the result.
-	 */
-	public static String join(List<String> strings, String separator)
-	{
-		StringBuilder sb = new StringBuilder();
-		String sep = "";
-		for (String s : strings)
-		{
-			sb.append(sep).append(s);
-			sep = separator;
-		}
-		return sb.toString();
-	}
-
-	/**
-	 * Adds the specified library to the classpath
-	 *
-	 * @param s the path to add
-	 * @throws Exception
-	 */
-	public static void addToClassPath(String s) throws Exception
-	{
-		File f = new File(s);
-		URL u = f.toURI().toURL();
-		URLClassLoader urlClassLoader = (URLClassLoader) ClassLoader.getSystemClassLoader();
-		Class urlClass = URLClassLoader.class;
-		Method method = urlClass.getDeclaredMethod("addURL", new Class[]{URL.class});
-		method.setAccessible(true);
-		method.invoke(urlClassLoader, new Object[]{u});
-	}
-
-	/**
-	 * Adds many libraries to the classpath
-	 *
-	 * @param jars the paths to add
-	 */
-	public static boolean addToClassPath(List<String> jars)
-	{
-		boolean pure = true;
-		// initialize the class path
-		for (String jar : jars)
-		{
-			try
-			{
-				Utils.addToClassPath(jar);
-			} catch (Exception e)
-			{
-				System.err.println("Unable to load: " + jar);
-				e.printStackTrace(System.err);
-				pure = false;
-			}
-		}
-		return pure;
-	}
-
-	/**
-	 * Adds the specified path to the java library path
-	 *
-	 * @param pathToAdd the path to add
-	 * @throws Exception
-	 */
-	@Deprecated
-	public static void addLibraryPath(String pathToAdd) throws Exception
-	{
-		final Field usrPathsField = ClassLoader.class.getDeclaredField("usr_paths");
-		usrPathsField.setAccessible(true);
-
-		//get array of paths
-		final String[] paths = (String[]) usrPathsField.get(null);
-
-		//check if the path to add is already present
-		for (String path : paths)
-		{
-			if (path.equals(pathToAdd))
-			{
-				return;
-			}
-		}
-
-		//add the new path
-		final String[] newPaths = Arrays.copyOf(paths, paths.length + 1);
-		newPaths[newPaths.length - 1] = pathToAdd;
-		usrPathsField.set(null, newPaths);
-	}
-
-	/**
-	 * Finds a field that looks like a Minecraft base folder in a supplied class
-	 *
-	 * @param mc the class to scan
-	 */
-	public static Field getMCPathField(Class<?> mc)
-	{
-		Field[] fields = mc.getDeclaredFields();
-
-		for (Field f : fields)
-		{
-			if (f.getType() != File.class)
-			{
-				// Has to be File
-				continue;
-			}
-			if (f.getModifiers() != (Modifier.PRIVATE + Modifier.STATIC))
-			{
-				// And Private Static.
-				continue;
-			}
-			return f;
-		}
-		return null;
-	}
-
-	/**
-	 * Log to the MultiMC console
-	 *
-	 * @param message A String containing the message
-	 * @param level   A String containing the level name. See MinecraftLauncher::getLevel()
-	 */
-	public static void log(String message, String level)
-	{
-		// Kinda dirty
-		String tag = "!![" + level + "]!";
-		System.out.println(tag + message.replace("\n", "\n" + tag));
-	}
-
-	public static void log(String message)
-	{
-		log(message, "MultiMC");
-	}
-
-	public static void log()
-	{
-		System.out.println();
-	}
-
-	/**
-	 * Pushes bytes from in to out. Closes both streams no matter what.
-	 * @param in the input stream
-	 * @param out the output stream
-	 * @throws IOException
-	 */
-	private static void copyStream(InputStream in, OutputStream out) throws IOException
-	{
-		try
-		{
-		byte[] buffer = new byte[4096];
-		int len;
-
-		while((len = in.read(buffer)) >= 0)
-			out.write(buffer, 0, len);
-		} finally
-		{
-			in.close();
-			out.close();
-		}
-	}
-
-	/**
-	 * Replace a 'target' string 'suffix' with 'replacement'
-	 */
-	public static String replaceSuffix (String target, String suffix, String replacement)
-	{
-		if (!target.endsWith(suffix))
-		{
-			return target;
-		}
-		String prefix = target.substring(0, target.length() - suffix.length());
-		return prefix + replacement;
-	}
-
-	/**
-	 * Unzip zip file with natives 'source' into the folder 'targetFolder'
-	 *
-	 * Contains a hack for OSX. Yay.
-	 * @param source
-	 * @param targetFolder
-	 * @throws IOException
-	 */
-	public static void unzipNatives(File source, File targetFolder) throws IOException
-	{
-		ZipFile zip = new ZipFile(source);
-
-		boolean applyHacks = false;
-		String[] javaVersionElements = System.getProperty("java.version").split("[.\\-+]");
-		int major = Integer.parseInt(javaVersionElements[0]);
-		if(major == 1)
-		{
-			major = Integer.parseInt(javaVersionElements[1]);
-		}
-		if (major >= 8)
-		{
-			applyHacks = true;
-		}
-
-		try
-		{
-			Enumeration entries = zip.entries();
-
-			while (entries.hasMoreElements())
-			{
-				ZipEntry entry = (ZipEntry) entries.nextElement();
-
-				String entryName = entry.getName();
-				String fileName = entryName;
-				if(applyHacks)
-				{
-					fileName = replaceSuffix(entryName, ".jnilib", ".dylib");
-				}
-				File targetFile = new File(targetFolder, fileName);
-				if (targetFile.getParentFile() != null)
-				{
-					targetFile.getParentFile().mkdirs();
-				}
-
-				if (entry.isDirectory())
-					continue;
-
-				copyStream(zip.getInputStream(entry), new BufferedOutputStream(new FileOutputStream(targetFile)));
-			}
-		} finally
-		{
-			zip.close();
-		}
-	}
-}
-
diff --git a/depends/launcher/org/multimc/legacy/LegacyLauncher.java b/depends/launcher/org/multimc/legacy/LegacyLauncher.java
deleted file mode 100644
index 347bb1a2..00000000
--- a/depends/launcher/org/multimc/legacy/LegacyLauncher.java
+++ /dev/null
@@ -1,175 +0,0 @@
-package org.multimc.legacy;/*
- * Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-import org.multimc.*;
-
-import java.applet.Applet;
-import java.awt.*;
-import java.io.File;
-import java.lang.reflect.Field;
-import java.net.MalformedURLException;
-import java.net.URL;
-import java.net.URLClassLoader;
-
-public class LegacyLauncher implements Launcher
-{
-	@Override
-	public int launch(ParamBucket params)
-	{
-		String userName, sessionId, windowTitle, windowParams, lwjgl;
-		String mainClass = "net.minecraft.client.Minecraft";
-		try
-		{
-			userName = params.first("userName");
-			sessionId = params.first("sessionId");
-			windowTitle = params.first("windowTitle");
-			windowParams = params.first("windowParams");
-			lwjgl = params.first("lwjgl");
-		} catch (NotFoundException e)
-		{
-			System.err.println("Not enough arguments.");
-			return -1;
-		}
-
-		String cwd = System.getProperty("user.dir");
-		Dimension winSize = new Dimension(854, 480);
-		boolean maximize = false;
-
-		String[] dimStrings = windowParams.split("x");
-
-		if (windowParams.equalsIgnoreCase("max"))
-		{
-			maximize = true;
-		}
-		else if (dimStrings.length == 2)
-		{
-			try
-			{
-				winSize = new Dimension(Integer.parseInt(dimStrings[0]), Integer.parseInt(dimStrings[1]));
-			} catch (NumberFormatException ignored) {}
-		}
-
-		File binDir = new File(cwd, "bin");
-		File lwjglDir;
-		if (lwjgl.equalsIgnoreCase("Mojang"))
-		{
-			lwjglDir = binDir;
-		}
-		else
-		{
-			lwjglDir = new File(lwjgl);
-		}
-
-		URL[] classpath;
-		{
-			try
-			{
-				classpath = new URL[]
-				{
-					new File(binDir, "minecraft.jar").toURI().toURL(),
-					new File(lwjglDir, "lwjgl.jar").toURI().toURL(),
-					new File(lwjglDir, "lwjgl_util.jar").toURI().toURL(),
-					new File(lwjglDir, "jinput.jar").toURI().toURL(),
-				};
-			} catch (MalformedURLException e)
-			{
-				System.err.println("Class path entry is badly formed:");
-				e.printStackTrace(System.err);
-				return -1;
-			}
-		}
-
-		String nativesDir = new File(lwjglDir, "natives").toString();
-
-		System.setProperty("org.lwjgl.librarypath", nativesDir);
-		System.setProperty("net.java.games.input.librarypath", nativesDir);
-
-		// print the pretty things
-		{
-			Utils.log("Main Class:");
-			Utils.log("  " + mainClass);
-			Utils.log();
-
-			Utils.log("Class Path:");
-			for (URL s : classpath)
-			{
-				Utils.log("  " + s);
-			}
-			Utils.log();
-
-			Utils.log("Native Path:");
-			Utils.log("  " + nativesDir);
-			Utils.log();
-		}
-
-		URLClassLoader cl = new URLClassLoader(classpath, LegacyLauncher.class.getClassLoader());
-
-		// Get the Minecraft Class and set the base folder
-		Class<?> mc;
-		try
-		{
-			mc = cl.loadClass(mainClass);
-
-			Field f = Utils.getMCPathField(mc);
-
-			if (f == null)
-			{
-				System.err.println("Could not find Minecraft path field. Launch failed.");
-				return -1;
-			}
-
-			f.setAccessible(true);
-			f.set(null, new File(cwd));
-		} catch (Exception e)
-		{
-			System.err.println("Could not set base folder. Failed to find/access Minecraft main class:");
-			e.printStackTrace(System.err);
-			return -1;
-		}
-
-		System.setProperty("minecraft.applet.TargetDirectory", cwd);
-
-		String[] mcArgs = new String[2];
-		mcArgs[0] = userName;
-		mcArgs[1] = sessionId;
-
-		Utils.log("Launching with applet wrapper...");
-		try
-		{
-			Class<?> MCAppletClass = cl.loadClass("net.minecraft.client.MinecraftApplet");
-			Applet mcappl = (Applet) MCAppletClass.newInstance();
-			LegacyFrame mcWindow = new LegacyFrame(windowTitle);
-			mcWindow.start(mcappl, userName, sessionId, winSize, maximize);
-		} catch (Exception e)
-		{
-			Utils.log("Applet wrapper failed:", "Error");
-			e.printStackTrace(System.err);
-			Utils.log();
-			Utils.log("Falling back to compatibility mode.");
-			try
-			{
-				mc.getMethod("main", String[].class).invoke(null, (Object) mcArgs);
-			} catch (Exception e1)
-			{
-				Utils.log("Failed to invoke the Minecraft main class:", "Fatal");
-				e1.printStackTrace(System.err);
-				return -1;
-			}
-		}
-
-		return 0;
-	}
-}
diff --git a/depends/launcher/org/multimc/onesix/OneSixLauncher.java b/depends/launcher/org/multimc/onesix/OneSixLauncher.java
deleted file mode 100644
index 179df0ee..00000000
--- a/depends/launcher/org/multimc/onesix/OneSixLauncher.java
+++ /dev/null
@@ -1,367 +0,0 @@
-/* Copyright 2012-2014 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-package org.multimc.onesix;
-
-import org.multimc.*;
-
-import java.applet.Applet;
-import java.io.File;
-import java.awt.*;
-import java.io.IOException;
-import java.lang.reflect.Field;
-import java.lang.reflect.Method;
-import java.util.ArrayList;
-import java.util.List;
-
-public class OneSixLauncher implements Launcher
-{
-	// parameters, separated from ParamBucket
-	private List<String> libraries;
-	private List<String> extlibs;
-	private List<String> extlibs32;
-	private List<String> extlibs64;
-	private List<String> mcparams;
-	private List<String> mods;
-	private List<String> jarmods;
-	private List<String> coremods;
-	private List<String> traits;
-	private String appletClass;
-	private String mainClass;
-	private String nativePath;
-	private String userName, sessionId;
-	private String windowTitle;
-	private String windowParams;
-
-	// secondary parameters
-	private Dimension winSize;
-	private boolean maximize;
-	private String cwd;
-
-	// the much abused system classloader, for convenience (for further abuse)
-	private ClassLoader cl;
-
-	private void processParams(ParamBucket params) throws NotFoundException
-	{
-		libraries = params.all("cp");
-		extlibs = params.allSafe("ext", new ArrayList<String>());
-		extlibs32 = params.allSafe("ext32", new ArrayList<String>());
-		extlibs64 = params.allSafe("ext64", new ArrayList<String>());
-
-		// Unify the extracted native libs according to actual system architecture
-		String property = System.getProperty("os.arch");
-		boolean is_64 = property.equalsIgnoreCase("x86_64") || property.equalsIgnoreCase("amd64");
-		if(is_64)
-		{
-			extlibs.addAll(extlibs64);
-		}
-		else
-		{
-			extlibs.addAll(extlibs32);
-		}
-
-		mcparams = params.allSafe("param", new ArrayList<String>() );
-		mainClass = params.firstSafe("mainClass", "net.minecraft.client.Minecraft");
-		appletClass = params.firstSafe("appletClass", "net.minecraft.client.MinecraftApplet");
-		mods = params.allSafe("mod", new ArrayList<String>());
-		jarmods = params.allSafe("jarmod", new ArrayList<String>());
-		coremods = params.allSafe("coremod", new ArrayList<String>());
-		traits = params.allSafe("traits", new ArrayList<String>());
-		nativePath = params.first("natives");
-
-		userName = params.first("userName");
-		sessionId = params.first("sessionId");
-		windowTitle = params.firstSafe("windowTitle", "Minecraft");
-		windowParams = params.firstSafe("windowParams", "854x480");
-
-		cwd = System.getProperty("user.dir");
-		winSize = new Dimension(854, 480);
-		maximize = false;
-
-		String[] dimStrings = windowParams.split("x");
-
-		if (windowParams.equalsIgnoreCase("max"))
-		{
-			maximize = true;
-		}
-		else if (dimStrings.length == 2)
-		{
-			try
-			{
-				winSize = new Dimension(Integer.parseInt(dimStrings[0]), Integer.parseInt(dimStrings[1]));
-			} catch (NumberFormatException ignored) {}
-		}
-	}
-
-	private void printStats()
-	{
-		Utils.log("Main Class:");
-		Utils.log("  " + mainClass);
-		Utils.log();
-
-		Utils.log("Native path:");
-		Utils.log("  " + nativePath);
-		Utils.log();
-
-		Utils.log("Traits:");
-		Utils.log("  " + traits);
-		Utils.log();
-
-		Utils.log("Libraries:");
-		for (String s : libraries)
-		{
-			File f = new File(s);
-			if (f.exists())
-			{
-				Utils.log("  " + s);
-			}
-			else
-			{
-				Utils.log("  " + s + " (missing)", "Warning");
-			}
-		}
-		Utils.log();
-
-		if(mods.size() > 0)
-		{
-			Utils.log("Mods:");
-			for (String s : mods)
-			{
-				Utils.log("  " + s);
-			}
-			Utils.log();
-		}
-
-		if(coremods.size() > 0)
-		{
-			Utils.log("Core Mods:");
-			for (String s : coremods)
-			{
-				Utils.log("  " + s);
-			}
-			Utils.log();
-		}
-
-		if(jarmods.size() > 0)
-		{
-			Utils.log("Jar Mods:");
-			for (String s : jarmods)
-			{
-				Utils.log("  " + s);
-			}
-			Utils.log();
-		}
-
-		Utils.log("Params:");
-		Utils.log("  " + mcparams.toString());
-		Utils.log();
-		if(maximize)
-			Utils.log("Window size: max (if available)");
-		else
-			Utils.log("Window size: " + Integer.toString(winSize.width) + " x " + Integer.toString(winSize.height));
-		Utils.log();
-	}
-
-	int legacyLaunch()
-	{
-		// Get the Minecraft Class and set the base folder
-		Class<?> mc;
-		try
-		{
-			mc = cl.loadClass(mainClass);
-
-			Field f = Utils.getMCPathField(mc);
-
-			if (f == null)
-			{
-				System.err.println("Could not find Minecraft path field.");
-			}
-			else
-			{
-				f.setAccessible(true);
-				f.set(null, new File(cwd));
-			}
-		} catch (Exception e)
-		{
-			System.err.println("Could not set base folder. Failed to find/access Minecraft main class:");
-			e.printStackTrace(System.err);
-			return -1;
-		}
-
-		System.setProperty("minecraft.applet.TargetDirectory", cwd);
-
-		String[] mcArgs = new String[2];
-		mcArgs[0] = userName;
-		mcArgs[1] = sessionId;
-
-		Utils.log("Launching with applet wrapper...");
-		try
-		{
-			Class<?> MCAppletClass = cl.loadClass(appletClass);
-			Applet mcappl = (Applet) MCAppletClass.newInstance();
-			LegacyFrame mcWindow = new LegacyFrame(windowTitle);
-			mcWindow.start(mcappl, userName, sessionId, winSize, maximize);
-		} catch (Exception e)
-		{
-			Utils.log("Applet wrapper failed:", "Error");
-			e.printStackTrace(System.err);
-			Utils.log();
-			Utils.log("Falling back to compatibility mode.");
-			try
-			{
-				mc.getMethod("main", String[].class).invoke(null, (Object) mcArgs);
-			} catch (Exception e1)
-			{
-				Utils.log("Failed to invoke the Minecraft main class:", "Fatal");
-				e1.printStackTrace(System.err);
-				return -1;
-			}
-		}
-		return 0;
-	}
-
-	int launchWithMainClass()
-	{
-		// window size, title and state, onesix
-		if (maximize)
-		{
-			// FIXME: there is no good way to maximize the minecraft window in onesix.
-			// the following often breaks linux screen setups
-			// mcparams.add("--fullscreen");
-		}
-		else
-		{
-			mcparams.add("--width");
-			mcparams.add(Integer.toString(winSize.width));
-			mcparams.add("--height");
-			mcparams.add(Integer.toString(winSize.height));
-		}
-
-		System.setProperty("minecraft.applet.TargetDirectory", cwd);
-
-		// Get the Minecraft Class.
-		Class<?> mc;
-		try
-		{
-			mc = cl.loadClass(mainClass);
-		} catch (ClassNotFoundException e)
-		{
-			System.err.println("Failed to find Minecraft main class:");
-			e.printStackTrace(System.err);
-			return -1;
-		}
-
-		// get the main method.
-		Method meth;
-		try
-		{
-			meth = mc.getMethod("main", String[].class);
-		} catch (NoSuchMethodException e)
-		{
-			System.err.println("Failed to acquire the main method:");
-			e.printStackTrace(System.err);
-			return -1;
-		}
-		// init params for the main method to chomp on.
-		String[] paramsArray = mcparams.toArray(new String[mcparams.size()]);
-		try
-		{
-			// static method doesn't have an instance
-			meth.invoke(null, (Object) paramsArray);
-		} catch (Exception e)
-		{
-			System.err.println("Failed to start Minecraft:");
-			e.printStackTrace(System.err);
-			return -1;
-		}
-		return 0;
-	}
-
-	@Override
-	public int launch(ParamBucket params)
-	{
-		// get and process the launch script params
-		try
-		{
-			processParams(params);
-		} catch (NotFoundException e)
-		{
-			System.err.println("Not enough arguments.");
-			e.printStackTrace(System.err);
-			return -1;
-		}
-
-		// add libraries to classpath
-		if(!Utils.addToClassPath(libraries))
-		{
-			System.err.println("Halting launch due to previous errors.");
-			return -1;
-		}
-
-		// print the pretty things
-		printStats();
-
-		// extract native libs (depending on platform here... java!)
-		Utils.log("Preparing native libraries...");
-		for(String extlib: extlibs)
-		{
-			try
-			{
-				File extlibf = new File(extlib);
-				Utils.log("Extracting " + extlibf.getName());
-				Utils.unzipNatives(extlibf, new File(nativePath));
-			} catch (IOException e)
-			{
-				System.err.println("Failed to extract native library:");
-				e.printStackTrace(System.err);
-				return -1;
-			}
-		}
-		Utils.log();
-
-		// set the native libs path... the brute force way
-		try
-		{
-			System.setProperty("java.library.path", nativePath);
-			System.setProperty("org.lwjgl.librarypath", nativePath);
-			System.setProperty("net.java.games.input.librarypath", nativePath);
-			// by the power of reflection, initialize native libs again. DIRTY!
-			// this is SO BAD. imagine doing that to ld
-			Field fieldSysPath = ClassLoader.class.getDeclaredField("sys_paths");
-			fieldSysPath.setAccessible( true );
-			fieldSysPath.set( null, null );
-		}
-		catch (Exception e)
-		{
-			System.err.println("Failed to set the native library path:");
-			e.printStackTrace(System.err);
-			System.err.println("Minecraft might fail to launch...");
-		}
-
-		// grab the system classloader and ...
-		cl = ClassLoader.getSystemClassLoader();
-
-		if (traits.contains("legacyLaunch") || traits.contains("alphaLaunch") )
-		{
-			// legacy launch uses the applet wrapper
-			return legacyLaunch();
-		}
-		else
-		{
-			// normal launch just calls main()
-			return launchWithMainClass();
-		}
-	}
-}
diff --git a/depends/launcher/org/simplericity/macify/eawt/Application.java b/depends/launcher/org/simplericity/macify/eawt/Application.java
deleted file mode 100644
index 153bb9ee..00000000
--- a/depends/launcher/org/simplericity/macify/eawt/Application.java
+++ /dev/null
@@ -1,176 +0,0 @@
-package org.simplericity.macify.eawt;
-
-/*
- * Copyright 2007 Eirik Bjorsnos.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-import java.awt.*;
-import java.awt.image.BufferedImage;
-
-/**
- * The Macify Library API interface provides integration with the OS X platform for Java Applications.
- * The API includes a facade to the
- * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/index.html">
- * Apple Java Extensions API
- * </a>.
- * Additionally, it provides access to several useful methods in the Cocoa NSApplication API.
- *
- * The default implementation of this interface is {@link org.simplericity.macify.eawt.DefaultApplication}.
- */
-public interface Application {
-
-    static int REQUEST_USER_ATTENTION_TYPE_CRITICAL = 1 ;
-    static int REQUEST_USER_ATTENTION_TYPE_INFORMATIONAL = 2 ;
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#addAboutMenuItem()">
-     * Apple's API
-     * </a>.
-     */
-    void addAboutMenuItem();
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#addApplicationListener(com.apple.eawt.ApplicationListener)">
-     * Apple's API
-     * </a>.
-     */
-    void addApplicationListener(ApplicationListener applicationListener);
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#addPreferencesMenuItem()">
-     * Apple's API
-     * </a>.
-     */
-    void addPreferencesMenuItem();
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#getEnabledAboutMenu()">
-     * Apple's API
-     * </a>.
-     */
-    boolean getEnabledAboutMenu();
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#getEnabledPreferencesMenu()">
-     * Apple's API
-     * </a>.
-     */
-    boolean getEnabledPreferencesMenu();
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#isAboutMenuItemPresent()">
-     * Apple's API
-     * </a>.
-     */
-    boolean isAboutMenuItemPresent();
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#isPreferencesMenuItemPresent()">
-     * Apple's API
-     * </a>.
-     */
-    boolean isPreferencesMenuItemPresent();
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#removeAboutMenuItem()">
-     * Apple's API
-     * </a>.
-     */
-    void removeAboutMenuItem();
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#removeApplicationListener(com.apple.eawt.ApplicationListener)">
-     * Apple's API
-     * </a>.
-     */
-    void removeApplicationListener(ApplicationListener applicationListener);
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#removePreferencesMenuItem()">
-     * Apple's API
-     * </a>.
-     */
-    void removePreferencesMenuItem();
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#getEnabledAboutMenu()">
-     * Apple's API
-     * </a>.
-     */
-    void setEnabledAboutMenu(boolean enabled);
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#getEnabledPreferencesMenu()">
-     * Apple's API
-     * </a>.
-     */
-    void setEnabledPreferencesMenu(boolean enabled);
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Java/Reference/1.5.0/appledoc/api/com/apple/eawt/Application.html#getMouseLocationOnScreen()">
-     * Apple's API
-     * </a>.
-     */
-    Point getMouseLocationOnScreen();
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Cocoa/Reference/ApplicationKit/Classes/NSApplication_Class/index.html#//apple_ref/doc/uid/TP40004004">
-     * Apple's NSApplication Class Reference
-     * </a>.
-     * @param type on of {@link #REQUEST_USER_ATTENTION_TYPE_CRITICAL} or {@link #REQUEST_USER_ATTENTION_TYPE_INFORMATIONAL}.
-     */
-    int requestUserAttention(int type);
-
-    /**
-     * See
-     * <a href="http://developer.apple.com/documentation/Cocoa/Reference/ApplicationKit/Classes/NSApplication_Class/index.html#//apple_ref/doc/uid/TP40004004">
-     * Apple's NSApplication Class Reference
-     * </a>
-     */
-    void cancelUserAttentionRequest(int request);
-
-    /**
-     * Update the application's icon image
-     * @param image
-     */
-    void setApplicationIconImage(BufferedImage image);
-
-    /**
-     * Get the application's icon image.
-     */
-    BufferedImage getApplicationIconImage();
-
-    /**
-     * Determines whether the application is running on a Mac AND the Apple Extensions API classes are available.
-     * @return
-     */
-    boolean isMac();
-
-
-}
diff --git a/depends/launcher/org/simplericity/macify/eawt/ApplicationAdapter.java b/depends/launcher/org/simplericity/macify/eawt/ApplicationAdapter.java
deleted file mode 100644
index e9c3db7d..00000000
--- a/depends/launcher/org/simplericity/macify/eawt/ApplicationAdapter.java
+++ /dev/null
@@ -1,48 +0,0 @@
-package org.simplericity.macify.eawt;
-
-/*
- * Copyright 2007 Eirik Bjorsnos.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-public class ApplicationAdapter implements ApplicationListener {
-
-    public void handleQuit(ApplicationEvent event) {
-        
-    }
-
-    public void handleAbout(ApplicationEvent event) {
-
-    }
-
-    public void handleOpenApplication(ApplicationEvent event) {
-
-    }
-
-    public void handleOpenFile(ApplicationEvent event) {
-
-    }
-
-    public void handlePreferences(ApplicationEvent event) {
-
-    }
-
-    public void handlePrintFile(ApplicationEvent event) {
-
-    }
-
-    public void handleReOpenApplication(ApplicationEvent event) {
-        
-    }
-}
diff --git a/depends/launcher/org/simplericity/macify/eawt/ApplicationEvent.java b/depends/launcher/org/simplericity/macify/eawt/ApplicationEvent.java
deleted file mode 100644
index 78420355..00000000
--- a/depends/launcher/org/simplericity/macify/eawt/ApplicationEvent.java
+++ /dev/null
@@ -1,25 +0,0 @@
-package org.simplericity.macify.eawt;
-
-/*
- * Copyright 2007 Eirik Bjorsnos.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-public interface ApplicationEvent {
-    String getFilename();
-    boolean isHandled();
-    void setHandled(boolean handled);
-    Object getSource();
-    String toString();
-}
diff --git a/depends/launcher/org/simplericity/macify/eawt/ApplicationListener.java b/depends/launcher/org/simplericity/macify/eawt/ApplicationListener.java
deleted file mode 100644
index a291bee4..00000000
--- a/depends/launcher/org/simplericity/macify/eawt/ApplicationListener.java
+++ /dev/null
@@ -1,27 +0,0 @@
-package org.simplericity.macify.eawt;
-
-/*
- * Copyright 2007 Eirik Bjorsnos.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-public interface ApplicationListener {
-    void handleAbout(ApplicationEvent event);
-    void handleOpenApplication(ApplicationEvent event);
-    void handleOpenFile(ApplicationEvent event);
-    void handlePreferences(ApplicationEvent event);
-    void handlePrintFile(ApplicationEvent event);
-    void handleQuit(ApplicationEvent event);
-    void handleReOpenApplication(ApplicationEvent event);
-}
diff --git a/depends/launcher/org/simplericity/macify/eawt/DefaultApplication.java b/depends/launcher/org/simplericity/macify/eawt/DefaultApplication.java
deleted file mode 100644
index 5752a350..00000000
--- a/depends/launcher/org/simplericity/macify/eawt/DefaultApplication.java
+++ /dev/null
@@ -1,418 +0,0 @@
-package org.simplericity.macify.eawt;
-
-/*
- * Copyright 2007 Eirik Bjorsnos.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-
-import javax.imageio.ImageIO;
-import java.awt.*;
-import java.awt.image.BufferedImage;
-import java.io.*;
-import java.lang.reflect.*;
-import java.net.URL;
-import java.net.URLClassLoader;
-import java.net.MalformedURLException;
-import java.util.Collections;
-import java.util.HashMap;
-import java.util.Map;
-
-
-/**
- * Implements Application by calling the Mac OS X API through reflection.
- * If this class is used on a non-OS X platform the operations will have no effect or they will simulate
- * what the Apple API would do for those who manipulate state. ({@link #setEnabledAboutMenu(boolean)} etc.)
- */
-@SuppressWarnings("unchecked")
-public class DefaultApplication implements Application {
-
-    private Object application;
-    private Class applicationListenerClass;
-
-    Map listenerMap = Collections.synchronizedMap(new HashMap<Object, Object>());
-    private boolean enabledAboutMenu = true;
-    private boolean enabledPreferencesMenu;
-    private boolean aboutMenuItemPresent = true;
-    private boolean preferencesMenuItemPresent;
-    private ClassLoader classLoader;
-
-    public DefaultApplication() {
-        try {
-            final File file = new File("/System/Library/Java");
-            if (file.exists()) {
-                ClassLoader scl = ClassLoader.getSystemClassLoader();
-                Class clc = scl.getClass();
-                if (URLClassLoader.class.isAssignableFrom(clc)) {
-                    Method addUrl = URLClassLoader.class.getDeclaredMethod("addURL", new Class[]{URL.class});
-                    addUrl.setAccessible(true);
-                    addUrl.invoke(scl, new Object[]{file.toURI().toURL()});
-                }
-            }
-
-            Class appClass = Class.forName("com.apple.eawt.Application");
-            application = appClass.getMethod("getApplication", new Class[0]).invoke(null, new Object[0]);
-            applicationListenerClass = Class.forName("com.apple.eawt.ApplicationListener");
-        } catch (ClassNotFoundException e) {
-            application = null;
-        } catch (IllegalAccessException e) {
-            throw new RuntimeException(e);
-        } catch (NoSuchMethodException e) {
-            throw new RuntimeException(e);
-        } catch (InvocationTargetException e) {
-            throw new RuntimeException(e);
-        } catch (MalformedURLException e) {
-            throw new RuntimeException(e);
-        }
-
-    }
-
-    public boolean isMac() {
-        return application != null;
-    }
-
-    public void addAboutMenuItem() {
-        if (isMac()) {
-            callMethod(application, "addAboutMenuItem");
-        } else {
-            this.aboutMenuItemPresent = true;
-        }
-    }
-
-    public void addApplicationListener(ApplicationListener applicationListener) {
-
-        if (!Modifier.isPublic(applicationListener.getClass().getModifiers())) {
-            throw new IllegalArgumentException("ApplicationListener must be a public class");
-        }
-        if (isMac()) {
-            Object listener = Proxy.newProxyInstance(getClass().getClassLoader(),
-                    new Class[]{applicationListenerClass},
-                    new ApplicationListenerInvocationHandler(applicationListener));
-
-            callMethod(application, "addApplicationListener", new Class[]{applicationListenerClass}, new Object[]{listener});
-            listenerMap.put(applicationListener, listener);
-        } else {
-            listenerMap.put(applicationListener, applicationListener);
-        }
-    }
-
-    public void addPreferencesMenuItem() {
-        if (isMac()) {
-            callMethod("addPreferencesMenuItem");
-        } else {
-            this.preferencesMenuItemPresent = true;
-        }
-    }
-
-    public boolean getEnabledAboutMenu() {
-        if (isMac()) {
-            return callMethod("getEnabledAboutMenu").equals(Boolean.TRUE);
-        } else {
-            return enabledAboutMenu;
-        }
-    }
-
-    public boolean getEnabledPreferencesMenu() {
-        if (isMac()) {
-            Object result = callMethod("getEnabledPreferencesMenu");
-            return result.equals(Boolean.TRUE);
-        } else {
-            return enabledPreferencesMenu;
-        }
-    }
-
-    public Point getMouseLocationOnScreen() {
-        if (isMac()) {
-            try {
-                Method method = application.getClass().getMethod("getMouseLocationOnScreen", new Class[0]);
-                return (Point) method.invoke(null, new Object[0]);
-            } catch (NoSuchMethodException e) {
-                throw new RuntimeException(e);
-            } catch (IllegalAccessException e) {
-                throw new RuntimeException(e);
-            } catch (InvocationTargetException e) {
-                throw new RuntimeException(e);
-            }
-        } else {
-            return new Point(0, 0);
-        }
-    }
-
-    public boolean isAboutMenuItemPresent() {
-        if (isMac()) {
-            return callMethod("isAboutMenuItemPresent").equals(Boolean.TRUE);
-        } else {
-            return aboutMenuItemPresent;
-        }
-    }
-
-    public boolean isPreferencesMenuItemPresent() {
-        if (isMac()) {
-            return callMethod("isPreferencesMenuItemPresent").equals(Boolean.TRUE);
-        } else {
-            return this.preferencesMenuItemPresent;
-        }
-    }
-
-    public void removeAboutMenuItem() {
-        if (isMac()) {
-            callMethod("removeAboutMenuItem");
-        } else {
-            this.aboutMenuItemPresent = false;
-        }
-    }
-
-    public synchronized void removeApplicationListener(ApplicationListener applicationListener) {
-        if (isMac()) {
-            Object listener = listenerMap.get(applicationListener);
-            callMethod(application, "removeApplicationListener", new Class[]{applicationListenerClass}, new Object[]{listener});
-
-        }
-        listenerMap.remove(applicationListener);
-    }
-
-    public void removePreferencesMenuItem() {
-        if (isMac()) {
-            callMethod("removeAboutMenuItem");
-        } else {
-            this.preferencesMenuItemPresent = false;
-        }
-    }
-
-    public void setEnabledAboutMenu(boolean enabled) {
-        if (isMac()) {
-            callMethod(application, "setEnabledAboutMenu", new Class[]{Boolean.TYPE}, new Object[]{Boolean.valueOf(enabled)});
-        } else {
-            this.enabledAboutMenu = enabled;
-        }
-    }
-
-    public void setEnabledPreferencesMenu(boolean enabled) {
-        if (isMac()) {
-            callMethod(application, "setEnabledPreferencesMenu", new Class[]{Boolean.TYPE}, new Object[]{Boolean.valueOf(enabled)});
-        } else {
-            this.enabledPreferencesMenu = enabled;
-        }
-
-    }
-
-    public int requestUserAttention(int type) {
-        if (type != REQUEST_USER_ATTENTION_TYPE_CRITICAL && type != REQUEST_USER_ATTENTION_TYPE_INFORMATIONAL) {
-            throw new IllegalArgumentException("Requested user attention type is not allowed: " + type);
-        }
-        try {
-            Object application = getNSApplication();
-            Field critical = application.getClass().getField("UserAttentionRequestCritical");
-            Field informational = application.getClass().getField("UserAttentionRequestInformational");
-            Field actual = type == REQUEST_USER_ATTENTION_TYPE_CRITICAL ? critical : informational;
-
-            return ((Integer) application.getClass().getMethod("requestUserAttention", new Class[]{Integer.TYPE}).invoke(application, new Object[]{actual.get(null)})).intValue();
-
-        } catch (ClassNotFoundException e) {
-            return -1;
-        } catch (NoSuchMethodException e) {
-            throw new RuntimeException(e);
-        } catch (IllegalAccessException e) {
-            throw new RuntimeException(e);
-        } catch (InvocationTargetException e) {
-            throw new RuntimeException(e);
-        } catch (NoSuchFieldException e) {
-            throw new RuntimeException(e);
-        }
-    }
-
-    public void cancelUserAttentionRequest(int request) {
-        try {
-            Object application = getNSApplication();
-            application.getClass().getMethod("cancelUserAttentionRequest", new Class[]{Integer.TYPE}).invoke(application, new Object[]{new Integer(request)});
-        } catch (ClassNotFoundException e) {
-            // Nada
-        } catch (NoSuchMethodException e) {
-            throw new RuntimeException(e);
-        } catch (IllegalAccessException e) {
-            throw new RuntimeException(e);
-        } catch (InvocationTargetException e) {
-            throw new RuntimeException(e);
-        }
-    }
-
-    private Object getNSApplication() throws ClassNotFoundException {
-        try {
-            Class applicationClass = Class.forName("com.apple.cocoa.application.NSApplication");
-            return applicationClass.getMethod("sharedApplication", new Class[0]).invoke(null, new Object[0]);
-        } catch (IllegalAccessException e) {
-            throw new RuntimeException(e);
-        } catch (InvocationTargetException e) {
-            throw new RuntimeException(e);
-        } catch (NoSuchMethodException e) {
-            throw new RuntimeException(e);
-        }
-    }
-
-    public void setApplicationIconImage(BufferedImage image) {
-        if (isMac()) {
-            try {
-                Method setDockIconImage = application.getClass().getMethod("setDockIconImage", Image.class);
-
-                try {
-                    setDockIconImage.invoke(application, image);
-                } catch (IllegalAccessException e) {
-
-                } catch (InvocationTargetException e) {
-
-                }
-            } catch (NoSuchMethodException mnfe) {
-
-
-                ByteArrayOutputStream stream = new ByteArrayOutputStream();
-                try {
-                    ImageIO.write(image, "png", stream);
-                } catch (IOException e) {
-                    throw new RuntimeException(e);
-                }
-
-                try {
-                    Class nsDataClass = Class.forName("com.apple.cocoa.foundation.NSData");
-                    Constructor constructor = nsDataClass.getConstructor(new Class[]{new byte[0].getClass()});
-
-                    Object nsData = constructor.newInstance(new Object[]{stream.toByteArray()});
-
-                    Class nsImageClass = Class.forName("com.apple.cocoa.application.NSImage");
-                    Object nsImage = nsImageClass.getConstructor(new Class[]{nsDataClass}).newInstance(new Object[]{nsData});
-
-                    Object application = getNSApplication();
-
-                    application.getClass().getMethod("setApplicationIconImage", new Class[]{nsImageClass}).invoke(application, new Object[]{nsImage});
-
-                } catch (ClassNotFoundException e) {
-
-                } catch (NoSuchMethodException e) {
-                    throw new RuntimeException(e);
-                } catch (IllegalAccessException e) {
-                    throw new RuntimeException(e);
-                } catch (InvocationTargetException e) {
-                    throw new RuntimeException(e);
-                } catch (InstantiationException e) {
-                    throw new RuntimeException(e);
-                }
-
-            }
-
-        }
-    }
-
-    public BufferedImage getApplicationIconImage() {
-        if (isMac()) {
-
-            try {
-                Method getDockIconImage = application.getClass().getMethod("getDockIconImage");
-                try {
-                    return (BufferedImage) getDockIconImage.invoke(application);
-                } catch (IllegalAccessException e) {
-
-                } catch (InvocationTargetException e) {
-
-                }
-            } catch (NoSuchMethodException nsme) {
-
-                try {
-                    Class nsDataClass = Class.forName("com.apple.cocoa.foundation.NSData");
-                    Class nsImageClass = Class.forName("com.apple.cocoa.application.NSImage");
-                    Object application = getNSApplication();
-                    Object nsImage = application.getClass().getMethod("applicationIconImage", new Class[0]).invoke(application, new Object[0]);
-
-                    Object nsData = nsImageClass.getMethod("TIFFRepresentation", new Class[0]).invoke(nsImage, new Object[0]);
-
-                    Integer length = (Integer) nsDataClass.getMethod("length", new Class[0]).invoke(nsData, new Object[0]);
-                    byte[] bytes = (byte[]) nsDataClass.getMethod("bytes", new Class[]{Integer.TYPE, Integer.TYPE}).invoke(nsData, new Object[]{Integer.valueOf(0), length});
-
-                    BufferedImage image = ImageIO.read(new ByteArrayInputStream(bytes));
-                    return image;
-
-                } catch (ClassNotFoundException e) {
-                    e.printStackTrace();
-                } catch (NoSuchMethodException e) {
-                    throw new RuntimeException(e);
-                } catch (IllegalAccessException e) {
-                    throw new RuntimeException(e);
-                } catch (InvocationTargetException e) {
-                    throw new RuntimeException(e);
-                } catch (IOException e) {
-                    throw new RuntimeException(e);
-                }
-            }
-
-        }
-
-        return null;
-    }
-
-    private Object callMethod(String methodname) {
-        return callMethod(application, methodname, new Class[0], new Object[0]);
-    }
-
-    private Object callMethod(Object object, String methodname) {
-        return callMethod(object, methodname, new Class[0], new Object[0]);
-    }
-
-    private Object callMethod(Object object, String methodname, Class[] classes, Object[] arguments) {
-        try {
-            if (classes == null) {
-                classes = new Class[arguments.length];
-                for (int i = 0; i < classes.length; i++) {
-                    classes[i] = arguments[i].getClass();
-
-                }
-            }
-            Method addListnerMethod = object.getClass().getMethod(methodname, classes);
-            return addListnerMethod.invoke(object, arguments);
-        } catch (NoSuchMethodException e) {
-            throw new RuntimeException(e);
-        } catch (IllegalAccessException e) {
-            throw new RuntimeException(e);
-        } catch (InvocationTargetException e) {
-            throw new RuntimeException(e);
-        }
-    }
-
-    class ApplicationListenerInvocationHandler implements InvocationHandler {
-        private ApplicationListener applicationListener;
-
-        ApplicationListenerInvocationHandler(ApplicationListener applicationListener) {
-            this.applicationListener = applicationListener;
-        }
-
-        public Object invoke(Object object, Method appleMethod, Object[] objects) throws Throwable {
-
-            ApplicationEvent event = createApplicationEvent(objects[0]);
-            try {
-                Method method = applicationListener.getClass().getMethod(appleMethod.getName(), new Class[]{ApplicationEvent.class});
-                return method.invoke(applicationListener, new Object[]{event});
-            } catch (NoSuchMethodException e) {
-                if (appleMethod.getName().equals("equals") && objects.length == 1) {
-                    return Boolean.valueOf(object == objects[0]);
-                }
-                return null;
-            }
-        }
-    }
-
-    private ApplicationEvent createApplicationEvent(final Object appleApplicationEvent) {
-        return (ApplicationEvent) Proxy.newProxyInstance(getClass().getClassLoader(), new Class[]{ApplicationEvent.class}, new InvocationHandler() {
-            public Object invoke(Object o, Method method, Object[] objects) throws Throwable {
-                return appleApplicationEvent.getClass().getMethod(method.getName(), method.getParameterTypes()).invoke(appleApplicationEvent, objects);
-            }
-        });
-    }
-}
diff --git a/depends/libnbtplusplus b/depends/libnbtplusplus
deleted file mode 160000
-Subproject 5d0ffb50a526173ce58ae57136bf5d79a7e1920
diff --git a/depends/pack200/CMakeLists.txt b/depends/pack200/CMakeLists.txt
deleted file mode 100644
index b060905b..00000000
--- a/depends/pack200/CMakeLists.txt
+++ /dev/null
@@ -1,39 +0,0 @@
-cmake_minimum_required(VERSION 3.1)
-
-project(unpack200)
-
-option(PACK200_BUILD_BINARY "Build a tiny utility that decompresses pack200 streams" OFF)
-
-# Find ZLIB for quazip
-find_package(ZLIB REQUIRED)
-
-set(PACK200_SRC
-	include/unpack200.h
-	src/bands.cpp
-	src/bands.h
-	src/bytes.cpp
-	src/bytes.h
-	src/coding.cpp
-	src/coding.h
-	src/constants.h
-	src/defines.h
-	src/unpack200.cpp
-	src/unpack.cpp
-	src/unpack.h
-	src/utils.cpp
-	src/utils.h
-	src/zip.cpp
-	src/zip.h
-)
-
-set(CMAKE_POSITION_INDEPENDENT_CODE ON)
-
-add_library(unpack200 STATIC ${PACK200_SRC})
-target_include_directories(unpack200 PUBLIC "${CMAKE_CURRENT_SOURCE_DIR}/include" PRIVATE ${ZLIB_INCLUDE_DIRS} "${CMAKE_CURRENT_SOURCE_DIR}/src")
-
-target_link_libraries(unpack200 ${ZLIB_LIBRARIES})
-
-if(PACK200_BUILD_BINARY)
-	add_executable(anti200 anti200.cpp)
-	target_link_libraries(anti200 unpack200)
-endif()
diff --git a/depends/pack200/LICENSE b/depends/pack200/LICENSE
deleted file mode 100644
index b40a0f45..00000000
--- a/depends/pack200/LICENSE
+++ /dev/null
@@ -1,347 +0,0 @@
-The GNU General Public License (GPL)
-
-Version 2, June 1991
-
-Copyright (C) 1989, 1991 Free Software Foundation, Inc.
-59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-
-Everyone is permitted to copy and distribute verbatim copies of this license
-document, but changing it is not allowed.
-
-Preamble
-
-The licenses for most software are designed to take away your freedom to share
-and change it.  By contrast, the GNU General Public License is intended to
-guarantee your freedom to share and change free software--to make sure the
-software is free for all its users.  This General Public License applies to
-most of the Free Software Foundation's software and to any other program whose
-authors commit to using it.  (Some other Free Software Foundation software is
-covered by the GNU Library General Public License instead.) You can apply it to
-your programs, too.
-
-When we speak of free software, we are referring to freedom, not price.  Our
-General Public Licenses are designed to make sure that you have the freedom to
-distribute copies of free software (and charge for this service if you wish),
-that you receive source code or can get it if you want it, that you can change
-the software or use pieces of it in new free programs; and that you know you
-can do these things.
-
-To protect your rights, we need to make restrictions that forbid anyone to deny
-you these rights or to ask you to surrender the rights.  These restrictions
-translate to certain responsibilities for you if you distribute copies of the
-software, or if you modify it.
-
-For example, if you distribute copies of such a program, whether gratis or for
-a fee, you must give the recipients all the rights that you have.  You must
-make sure that they, too, receive or can get the source code.  And you must
-show them these terms so they know their rights.
-
-We protect your rights with two steps: (1) copyright the software, and (2)
-offer you this license which gives you legal permission to copy, distribute
-and/or modify the software.
-
-Also, for each author's protection and ours, we want to make certain that
-everyone understands that there is no warranty for this free software.  If the
-software is modified by someone else and passed on, we want its recipients to
-know that what they have is not the original, so that any problems introduced
-by others will not reflect on the original authors' reputations.
-
-Finally, any free program is threatened constantly by software patents.  We
-wish to avoid the danger that redistributors of a free program will
-individually obtain patent licenses, in effect making the program proprietary.
-To prevent this, we have made it clear that any patent must be licensed for
-everyone's free use or not licensed at all.
-
-The precise terms and conditions for copying, distribution and modification
-follow.
-
-TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-0. This License applies to any program or other work which contains a notice
-placed by the copyright holder saying it may be distributed under the terms of
-this General Public License.  The "Program", below, refers to any such program
-or work, and a "work based on the Program" means either the Program or any
-derivative work under copyright law: that is to say, a work containing the
-Program or a portion of it, either verbatim or with modifications and/or
-translated into another language.  (Hereinafter, translation is included
-without limitation in the term "modification".) Each licensee is addressed as
-"you".
-
-Activities other than copying, distribution and modification are not covered by
-this License; they are outside its scope.  The act of running the Program is
-not restricted, and the output from the Program is covered only if its contents
-constitute a work based on the Program (independent of having been made by
-running the Program).  Whether that is true depends on what the Program does.
-
-1. You may copy and distribute verbatim copies of the Program's source code as
-you receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice and
-disclaimer of warranty; keep intact all the notices that refer to this License
-and to the absence of any warranty; and give any other recipients of the
-Program a copy of this License along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and you may
-at your option offer warranty protection in exchange for a fee.
-
-2. You may modify your copy or copies of the Program or any portion of it, thus
-forming a work based on the Program, and copy and distribute such modifications
-or work under the terms of Section 1 above, provided that you also meet all of
-these conditions:
-
-    a) You must cause the modified files to carry prominent notices stating
-    that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in whole or
-    in part contains or is derived from the Program or any part thereof, to be
-    licensed as a whole at no charge to all third parties under the terms of
-    this License.
-
-    c) If the modified program normally reads commands interactively when run,
-    you must cause it, when started running for such interactive use in the
-    most ordinary way, to print or display an announcement including an
-    appropriate copyright notice and a notice that there is no warranty (or
-    else, saying that you provide a warranty) and that users may redistribute
-    the program under these conditions, and telling the user how to view a copy
-    of this License.  (Exception: if the Program itself is interactive but does
-    not normally print such an announcement, your work based on the Program is
-    not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If identifiable
-sections of that work are not derived from the Program, and can be reasonably
-considered independent and separate works in themselves, then this License, and
-its terms, do not apply to those sections when you distribute them as separate
-works.  But when you distribute the same sections as part of a whole which is a
-work based on the Program, the distribution of the whole must be on the terms
-of this License, whose permissions for other licensees extend to the entire
-whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest your
-rights to work written entirely by you; rather, the intent is to exercise the
-right to control the distribution of derivative or collective works based on
-the Program.
-
-In addition, mere aggregation of another work not based on the Program with the
-Program (or with a work based on the Program) on a volume of a storage or
-distribution medium does not bring the other work under the scope of this
-License.
-
-3. You may copy and distribute the Program (or a work based on it, under
-Section 2) in object code or executable form under the terms of Sections 1 and
-2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable source
-    code, which must be distributed under the terms of Sections 1 and 2 above
-    on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three years, to
-    give any third party, for a charge no more than your cost of physically
-    performing source distribution, a complete machine-readable copy of the
-    corresponding source code, to be distributed under the terms of Sections 1
-    and 2 above on a medium customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer to
-    distribute corresponding source code.  (This alternative is allowed only
-    for noncommercial distribution and only if you received the program in
-    object code or executable form with such an offer, in accord with
-    Subsection b above.)
-
-The source code for a work means the preferred form of the work for making
-modifications to it.  For an executable work, complete source code means all
-the source code for all modules it contains, plus any associated interface
-definition files, plus the scripts used to control compilation and installation
-of the executable.  However, as a special exception, the source code
-distributed need not include anything that is normally distributed (in either
-source or binary form) with the major components (compiler, kernel, and so on)
-of the operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering access to copy
-from a designated place, then offering equivalent access to copy the source
-code from the same place counts as distribution of the source code, even though
-third parties are not compelled to copy the source along with the object code.
-
-4. You may not copy, modify, sublicense, or distribute the Program except as
-expressly provided under this License.  Any attempt otherwise to copy, modify,
-sublicense or distribute the Program is void, and will automatically terminate
-your rights under this License.  However, parties who have received copies, or
-rights, from you under this License will not have their licenses terminated so
-long as such parties remain in full compliance.
-
-5. You are not required to accept this License, since you have not signed it.
-However, nothing else grants you permission to modify or distribute the Program
-or its derivative works.  These actions are prohibited by law if you do not
-accept this License.  Therefore, by modifying or distributing the Program (or
-any work based on the Program), you indicate your acceptance of this License to
-do so, and all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-6. Each time you redistribute the Program (or any work based on the Program),
-the recipient automatically receives a license from the original licensor to
-copy, distribute or modify the Program subject to these terms and conditions.
-You may not impose any further restrictions on the recipients' exercise of the
-rights granted herein.  You are not responsible for enforcing compliance by
-third parties to this License.
-
-7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues), conditions
-are imposed on you (whether by court order, agreement or otherwise) that
-contradict the conditions of this License, they do not excuse you from the
-conditions of this License.  If you cannot distribute so as to satisfy
-simultaneously your obligations under this License and any other pertinent
-obligations, then as a consequence you may not distribute the Program at all.
-For example, if a patent license would not permit royalty-free redistribution
-of the Program by all those who receive copies directly or indirectly through
-you, then the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under any
-particular circumstance, the balance of the section is intended to apply and
-the section as a whole is intended to apply in other circumstances.
-
-It is not the purpose of this section to induce you to infringe any patents or
-other property right claims or to contest validity of any such claims; this
-section has the sole purpose of protecting the integrity of the free software
-distribution system, which is implemented by public license practices.  Many
-people have made generous contributions to the wide range of software
-distributed through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing to
-distribute software through any other system and a licensee cannot impose that
-choice.
-
-This section is intended to make thoroughly clear what is believed to be a
-consequence of the rest of this License.
-
-8. If the distribution and/or use of the Program is restricted in certain
-countries either by patents or by copyrighted interfaces, the original
-copyright holder who places the Program under this License may add an explicit
-geographical distribution limitation excluding those countries, so that
-distribution is permitted only in or among countries not thus excluded.  In
-such case, this License incorporates the limitation as if written in the body
-of this License.
-
-9. The Free Software Foundation may publish revised and/or new versions of the
-General Public License from time to time.  Such new versions will be similar in
-spirit to the present version, but may differ in detail to address new problems
-or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any later
-version", you have the option of following the terms and conditions either of
-that version or of any later version published by the Free Software Foundation.
-If the Program does not specify a version number of this License, you may
-choose any version ever published by the Free Software Foundation.
-
-10. If you wish to incorporate parts of the Program into other free programs
-whose distribution conditions are different, write to the author to ask for
-permission.  For software which is copyrighted by the Free Software Foundation,
-write to the Free Software Foundation; we sometimes make exceptions for this.
-Our decision will be guided by the two goals of preserving the free status of
-all derivatives of our free software and of promoting the sharing and reuse of
-software generally.
-
-NO WARRANTY
-
-11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR
-THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN OTHERWISE
-STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE
-PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED,
-INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
-FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND
-PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE,
-YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
-12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL
-ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE
-PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR
-INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA
-BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
-FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER
-OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
-
-END OF TERMS AND CONDITIONS
-
-How to Apply These Terms to Your New Programs
-
-If you develop a new program, and you want it to be of the greatest possible
-use to the public, the best way to achieve this is to make it free software
-which everyone can redistribute and change under these terms.
-
-To do so, attach the following notices to the program.  It is safest to attach
-them to the start of each source file to most effectively convey the exclusion
-of warranty; and each file should have at least the "copyright" line and a
-pointer to where the full notice is found.
-
-    One line to give the program's name and a brief idea of what it does.
-
-    Copyright (C) <year> <name of author>
-
-    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 2 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, write to the Free Software Foundation, Inc., 59
-    Temple Place, Suite 330, Boston, MA 02111-1307 USA
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this when it
-starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year name of author Gnomovision comes
-    with ABSOLUTELY NO WARRANTY; for details type 'show w'.  This is free
-    software, and you are welcome to redistribute it under certain conditions;
-    type 'show c' for details.
-
-The hypothetical commands 'show w' and 'show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may be
-called something other than 'show w' and 'show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.  Here
-is a sample; alter the names:
-
-    Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-    'Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-    signature of Ty Coon, 1 April 1989
-
-    Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General Public
-License instead of this License.
-
-
-"CLASSPATH" EXCEPTION TO THE GPL
-
-Certain source files distributed by Oracle America and/or its affiliates are
-subject to the following clarification and special exception to the GPL, but
-only where Oracle has expressly included in the particular source file's header
-the words "Oracle designates this particular file as subject to the "Classpath"
-exception as provided by Oracle in the LICENSE file that accompanied this code."
-
-    Linking this library statically or dynamically with other modules is making
-    a combined work based on this library.  Thus, the terms and conditions of
-    the GNU General Public License cover the whole combination.
-
-    As a special exception, the copyright holders of this library give you
-    permission to link this library with independent modules to produce an
-    executable, regardless of the license terms of these independent modules,
-    and to copy and distribute the resulting executable under terms of your
-    choice, provided that you also meet, for each linked independent module,
-    the terms and conditions of the license of that module.  An independent
-    module is a module which is not derived from or based on this library.  If
-    you modify this library, you may extend this exception to your version of
-    the library, but you are not obligated to do so.  If you do not wish to do
-    so, delete this exception statement from your version.
diff --git a/depends/pack200/anti200.cpp b/depends/pack200/anti200.cpp
deleted file mode 100644
index 1e1ec0c8..00000000
--- a/depends/pack200/anti200.cpp
+++ /dev/null
@@ -1,43 +0,0 @@
-/*
- * This is trivial. Do what thou wilt with it. Public domain.
- */
-
-#include <stdexcept>
-#include <iostream>
-#include "unpack200.h"
-
-int main(int argc, char **argv)
-{
-	if (argc != 3)
-	{
-		std::cerr << "Simple pack200 unpacker!" << std::endl << "Run like this:" << std::endl
-				  << "  " << argv[0] << " input.jar.lzma output.jar" << std::endl;
-		return EXIT_FAILURE;
-	}
-
-	FILE *input = fopen(argv[1], "rb");
-	FILE *output = fopen(argv[2], "wb");
-	if (!input)
-	{
-		std::cerr << "Can't open input file";
-		return EXIT_FAILURE;
-	}
-	if (!output)
-	{
-		fclose(output);
-		std::cerr << "Can't open output file";
-		return EXIT_FAILURE;
-	}
-	try
-	{
-		unpack_200(input, output);
-	}
-	catch (std::runtime_error &e)
-	{
-		std::cerr << "Bad things happened: " << e.what() << std::endl;
-		fclose(input);
-		fclose(output);
-		return EXIT_FAILURE;
-	}
-	return EXIT_SUCCESS;
-}
diff --git a/depends/pack200/include/unpack200.h b/depends/pack200/include/unpack200.h
deleted file mode 100644
index 9c3eda2d..00000000
--- a/depends/pack200/include/unpack200.h
+++ /dev/null
@@ -1,36 +0,0 @@
-/*
- * Copyright (c) 2001, 2008, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-#pragma once
-#include <string>
-
-/**
- * @brief Unpack a PACK200 file
- *
- * @param input_path Path to the input file in PACK200 format. System native string encoding.
- * @param output_path Path to the output file in PACK200 format. System native string encoding.
- * @throw std::runtime_error for any error encountered
- */
-void unpack_200(FILE * input_path, FILE * output_path);
diff --git a/depends/pack200/src/bands.cpp b/depends/pack200/src/bands.cpp
deleted file mode 100644
index 1608d838..00000000
--- a/depends/pack200/src/bands.cpp
+++ /dev/null
@@ -1,423 +0,0 @@
-/*
- * Copyright (c) 2002, 2009, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-// -*- C++ -*-
-// Small program for unpacking specially compressed Java packages.
-// John R. Rose
-
-#include <sys/types.h>
-
-#include <stdio.h>
-#include <string.h>
-#include <stdlib.h>
-#include <stdarg.h>
-#include <assert.h>
-#include <stdint.h>
-
-#include "defines.h"
-#include "bytes.h"
-#include "utils.h"
-#include "coding.h"
-#include "bands.h"
-
-#include "constants.h"
-#include "unpack.h"
-
-void band::readData(int expectedLength)
-{
-	assert(expectedLength >= 0);
-	assert(vs[0].cmk == cmk_ERROR);
-	if (expectedLength != 0)
-	{
-		assert(length == 0);
-		length = expectedLength;
-	}
-	if (length == 0)
-	{
-		assert((rplimit = cm.vs0.rp = u->rp) != nullptr);
-		return;
-	}
-	assert(length > 0);
-
-	bool is_BYTE1 = (defc->spec == BYTE1_spec);
-
-	if (is_BYTE1)
-	{
-		// No possibility of coding change.  Sizing is exact.
-		u->ensure_input(length);
-	}
-	else
-	{
-		// Make a conservatively generous estimate of band size in bytes.
-		// Assume B == 5 everywhere.
-		// Assume awkward pop with all {U} values (2*5 per value)
-		int64_t generous = (int64_t)length * (B_MAX * 3 + 1) + C_SLOP;
-		u->ensure_input(generous);
-	}
-
-	// Read one value to see what it might be.
-	int XB = _meta_default;
-	if (!is_BYTE1)
-	{
-		// must be a variable-length coding
-		assert(defc->B() > 1 && defc->L() > 0);
-
-		value_stream xvs;
-		coding *valc = defc;
-		if (valc->D() != 0)
-		{
-			valc = coding::findBySpec(defc->B(), defc->H(), defc->S());
-			assert(!valc->isMalloc);
-		}
-		xvs.init(u->rp, u->rplimit, valc);
-		int X = xvs.getInt();
-		if (valc->S() != 0)
-		{
-			assert(valc->min <= -256);
-			XB = -1 - X;
-		}
-		else
-		{
-			int L = valc->L();
-			assert(valc->max >= L + 255);
-			XB = X - L;
-		}
-		if (0 <= XB && XB < 256)
-		{
-			// Skip over the escape value.
-			u->rp = xvs.rp;
-		}
-		else
-		{
-			// No, it's still default.
-			XB = _meta_default;
-		}
-	}
-
-	if (XB <= _meta_canon_max)
-	{
-		byte XB_byte = (byte)XB;
-		byte *XB_ptr = &XB_byte;
-		cm.init(u->rp, u->rplimit, XB_ptr, 0, defc, length, nullptr);
-	}
-	else
-	{
-		assert(u->meta_rp != nullptr);
-		// Scribble the initial byte onto the band.
-		byte *save_meta_rp = --u->meta_rp;
-		byte save_meta_xb = (*save_meta_rp);
-		(*save_meta_rp) = (byte)XB;
-		cm.init(u->rp, u->rplimit, u->meta_rp, 0, defc, length, nullptr);
-		(*save_meta_rp) = save_meta_xb; // put it back, just to be tidy
-	}
-	rplimit = u->rp;
-
-	rewind();
-}
-
-void band::setIndex(cpindex *ix_)
-{
-	assert(ix_ == nullptr || ixTag == ix_->ixTag);
-	ix = ix_;
-}
-void band::setIndexByTag(byte tag)
-{
-	setIndex(u->cp.getIndex(tag));
-}
-
-entry *band::getRefCommon(cpindex *ix_, bool nullOKwithCaller)
-{
-	assert(ix_->ixTag == ixTag ||
-		   (ixTag == CONSTANT_Literal && ix_->ixTag >= CONSTANT_Integer &&
-			ix_->ixTag <= CONSTANT_String));
-	int n = vs[0].getInt() - nullOK;
-	// Note: band-local nullOK means nullptr encodes as 0.
-	// But nullOKwithCaller means caller is willing to tolerate a nullptr.
-	entry *ref = ix_->get(n);
-	if (ref == nullptr && !(nullOKwithCaller && n == -1))
-		unpack_abort(n == -1 ? "nullptr ref" : "bad ref");
-	return ref;
-}
-
-int64_t band::getLong(band &lo_band, bool have_hi)
-{
-	band &hi_band = (*this);
-	assert(lo_band.bn == hi_band.bn + 1);
-	uint32_t lo = lo_band.getInt();
-	if (!have_hi)
-	{
-		assert(hi_band.length == 0);
-		return makeLong(0, lo);
-	}
-	uint32_t hi = hi_band.getInt();
-	return makeLong(hi, lo);
-}
-
-int band::getIntTotal()
-{
-	if (length == 0)
-		return 0;
-	if (total_memo > 0)
-		return total_memo - 1;
-	int total = getInt();
-	// overflow checks require that none of the addends are <0,
-	// and that the partial sums never overflow (wrap negative)
-	if (total < 0)
-	{
-		unpack_abort("overflow detected");
-	}
-	for (int k = length - 1; k > 0; k--)
-	{
-		int prev_total = total;
-		total += vs[0].getInt();
-		if (total < prev_total)
-		{
-			unpack_abort("overflow detected");
-		}
-	}
-	rewind();
-	total_memo = total + 1;
-	return total;
-}
-
-int band::getIntCount(int tag)
-{
-	if (length == 0)
-		return 0;
-	if (tag >= HIST0_MIN && tag <= HIST0_MAX)
-	{
-		if (hist0 == nullptr)
-		{
-			// Lazily calculate an approximate histogram.
-			hist0 = U_NEW(int, (HIST0_MAX - HIST0_MIN) + 1);
-			for (int k = length; k > 0; k--)
-			{
-				int x = vs[0].getInt();
-				if (x >= HIST0_MIN && x <= HIST0_MAX)
-					hist0[x - HIST0_MIN] += 1;
-			}
-			rewind();
-		}
-		return hist0[tag - HIST0_MIN];
-	}
-	int total = 0;
-	for (int k = length; k > 0; k--)
-	{
-		total += (vs[0].getInt() == tag) ? 1 : 0;
-	}
-	rewind();
-	return total;
-}
-
-#define INDEX_INIT(tag, nullOK, subindex) ((tag) + (subindex) * SUBINDEX_BIT + (nullOK) * 256)
-
-#define INDEX(tag) INDEX_INIT(tag, 0, 0)
-#define NULL_OR_INDEX(tag) INDEX_INIT(tag, 1, 0)
-#define SUB_INDEX(tag) INDEX_INIT(tag, 0, 1)
-#define NO_INDEX 0
-
-struct band_init
-{
-	int defc;
-	int index;
-};
-
-#define BAND_INIT(name, cspec, ix)                                                             \
-	{                                                                                          \
-		cspec, ix                                                                              \
-	}
-
-const band_init all_band_inits[] =
-	{
-		// BAND_INIT(archive_magic, BYTE1_spec, 0),
-		// BAND_INIT(archive_header, UNSIGNED5_spec, 0),
-		// BAND_INIT(band_headers, BYTE1_spec, 0),
-		BAND_INIT(cp_Utf8_prefix, DELTA5_spec, 0), BAND_INIT(cp_Utf8_suffix, UNSIGNED5_spec, 0),
-		BAND_INIT(cp_Utf8_chars, CHAR3_spec, 0), BAND_INIT(cp_Utf8_big_suffix, DELTA5_spec, 0),
-		BAND_INIT(cp_Utf8_big_chars, DELTA5_spec, 0), BAND_INIT(cp_Int, UDELTA5_spec, 0),
-		BAND_INIT(cp_Float, UDELTA5_spec, 0), BAND_INIT(cp_Long_hi, UDELTA5_spec, 0),
-		BAND_INIT(cp_Long_lo, DELTA5_spec, 0), BAND_INIT(cp_Double_hi, UDELTA5_spec, 0),
-		BAND_INIT(cp_Double_lo, DELTA5_spec, 0),
-		BAND_INIT(cp_String, UDELTA5_spec, INDEX(CONSTANT_Utf8)),
-		BAND_INIT(cp_Class, UDELTA5_spec, INDEX(CONSTANT_Utf8)),
-		BAND_INIT(cp_Signature_form, DELTA5_spec, INDEX(CONSTANT_Utf8)),
-		BAND_INIT(cp_Signature_classes, UDELTA5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(cp_Descr_name, DELTA5_spec, INDEX(CONSTANT_Utf8)),
-		BAND_INIT(cp_Descr_type, UDELTA5_spec, INDEX(CONSTANT_Signature)),
-		BAND_INIT(cp_Field_class, DELTA5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(cp_Field_desc, UDELTA5_spec, INDEX(CONSTANT_NameandType)),
-		BAND_INIT(cp_Method_class, DELTA5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(cp_Method_desc, UDELTA5_spec, INDEX(CONSTANT_NameandType)),
-		BAND_INIT(cp_Imethod_class, DELTA5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(cp_Imethod_desc, UDELTA5_spec, INDEX(CONSTANT_NameandType)),
-		BAND_INIT(attr_definition_headers, BYTE1_spec, 0),
-		BAND_INIT(attr_definition_name, UNSIGNED5_spec, INDEX(CONSTANT_Utf8)),
-		BAND_INIT(attr_definition_layout, UNSIGNED5_spec, INDEX(CONSTANT_Utf8)),
-		BAND_INIT(ic_this_class, UDELTA5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(ic_flags, UNSIGNED5_spec, 0),
-		BAND_INIT(ic_outer_class, DELTA5_spec, NULL_OR_INDEX(CONSTANT_Class)),
-		BAND_INIT(ic_name, DELTA5_spec, NULL_OR_INDEX(CONSTANT_Utf8)),
-		BAND_INIT(class_this, DELTA5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(class_super, DELTA5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(class_interface_count, DELTA5_spec, 0),
-		BAND_INIT(class_interface, DELTA5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(class_field_count, DELTA5_spec, 0),
-		BAND_INIT(class_method_count, DELTA5_spec, 0),
-		BAND_INIT(field_descr, DELTA5_spec, INDEX(CONSTANT_NameandType)),
-		BAND_INIT(field_flags_hi, UNSIGNED5_spec, 0),
-		BAND_INIT(field_flags_lo, UNSIGNED5_spec, 0),
-		BAND_INIT(field_attr_count, UNSIGNED5_spec, 0),
-		BAND_INIT(field_attr_indexes, UNSIGNED5_spec, 0),
-		BAND_INIT(field_attr_calls, UNSIGNED5_spec, 0),
-		BAND_INIT(field_ConstantValue_KQ, UNSIGNED5_spec, INDEX(CONSTANT_Literal)),
-		BAND_INIT(field_Signature_RS, UNSIGNED5_spec, INDEX(CONSTANT_Signature)),
-		BAND_INIT(field_metadata_bands, -1, -1), BAND_INIT(field_attr_bands, -1, -1),
-		BAND_INIT(method_descr, MDELTA5_spec, INDEX(CONSTANT_NameandType)),
-		BAND_INIT(method_flags_hi, UNSIGNED5_spec, 0),
-		BAND_INIT(method_flags_lo, UNSIGNED5_spec, 0),
-		BAND_INIT(method_attr_count, UNSIGNED5_spec, 0),
-		BAND_INIT(method_attr_indexes, UNSIGNED5_spec, 0),
-		BAND_INIT(method_attr_calls, UNSIGNED5_spec, 0),
-		BAND_INIT(method_Exceptions_N, UNSIGNED5_spec, 0),
-		BAND_INIT(method_Exceptions_RC, UNSIGNED5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(method_Signature_RS, UNSIGNED5_spec, INDEX(CONSTANT_Signature)),
-		BAND_INIT(method_metadata_bands, -1, -1), BAND_INIT(method_attr_bands, -1, -1),
-		BAND_INIT(class_flags_hi, UNSIGNED5_spec, 0),
-		BAND_INIT(class_flags_lo, UNSIGNED5_spec, 0),
-		BAND_INIT(class_attr_count, UNSIGNED5_spec, 0),
-		BAND_INIT(class_attr_indexes, UNSIGNED5_spec, 0),
-		BAND_INIT(class_attr_calls, UNSIGNED5_spec, 0),
-		BAND_INIT(class_SourceFile_RUN, UNSIGNED5_spec, NULL_OR_INDEX(CONSTANT_Utf8)),
-		BAND_INIT(class_EnclosingMethod_RC, UNSIGNED5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(class_EnclosingMethod_RDN, UNSIGNED5_spec,
-				  NULL_OR_INDEX(CONSTANT_NameandType)),
-		BAND_INIT(class_Signature_RS, UNSIGNED5_spec, INDEX(CONSTANT_Signature)),
-		BAND_INIT(class_metadata_bands, -1, -1),
-		BAND_INIT(class_InnerClasses_N, UNSIGNED5_spec, 0),
-		BAND_INIT(class_InnerClasses_RC, UNSIGNED5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(class_InnerClasses_F, UNSIGNED5_spec, 0),
-		BAND_INIT(class_InnerClasses_outer_RCN, UNSIGNED5_spec, NULL_OR_INDEX(CONSTANT_Class)),
-		BAND_INIT(class_InnerClasses_name_RUN, UNSIGNED5_spec, NULL_OR_INDEX(CONSTANT_Utf8)),
-		BAND_INIT(class_ClassFile_version_minor_H, UNSIGNED5_spec, 0),
-		BAND_INIT(class_ClassFile_version_major_H, UNSIGNED5_spec, 0),
-		BAND_INIT(class_attr_bands, -1, -1), BAND_INIT(code_headers, BYTE1_spec, 0),
-		BAND_INIT(code_max_stack, UNSIGNED5_spec, 0),
-		BAND_INIT(code_max_na_locals, UNSIGNED5_spec, 0),
-		BAND_INIT(code_handler_count, UNSIGNED5_spec, 0),
-		BAND_INIT(code_handler_start_P, BCI5_spec, 0),
-		BAND_INIT(code_handler_end_PO, BRANCH5_spec, 0),
-		BAND_INIT(code_handler_catch_PO, BRANCH5_spec, 0),
-		BAND_INIT(code_handler_class_RCN, UNSIGNED5_spec, NULL_OR_INDEX(CONSTANT_Class)),
-		BAND_INIT(code_flags_hi, UNSIGNED5_spec, 0),
-		BAND_INIT(code_flags_lo, UNSIGNED5_spec, 0),
-		BAND_INIT(code_attr_count, UNSIGNED5_spec, 0),
-		BAND_INIT(code_attr_indexes, UNSIGNED5_spec, 0),
-		BAND_INIT(code_attr_calls, UNSIGNED5_spec, 0),
-		BAND_INIT(code_StackMapTable_N, UNSIGNED5_spec, 0),
-		BAND_INIT(code_StackMapTable_frame_T, BYTE1_spec, 0),
-		BAND_INIT(code_StackMapTable_local_N, UNSIGNED5_spec, 0),
-		BAND_INIT(code_StackMapTable_stack_N, UNSIGNED5_spec, 0),
-		BAND_INIT(code_StackMapTable_offset, UNSIGNED5_spec, 0),
-		BAND_INIT(code_StackMapTable_T, BYTE1_spec, 0),
-		BAND_INIT(code_StackMapTable_RC, UNSIGNED5_spec, INDEX(CONSTANT_Class)),
-		BAND_INIT(code_StackMapTable_P, BCI5_spec, 0),
-		BAND_INIT(code_LineNumberTable_N, UNSIGNED5_spec, 0),
-		BAND_INIT(code_LineNumberTable_bci_P, BCI5_spec, 0),
-		BAND_INIT(code_LineNumberTable_line, UNSIGNED5_spec, 0),
-		BAND_INIT(code_LocalVariableTable_N, UNSIGNED5_spec, 0),
-		BAND_INIT(code_LocalVariableTable_bci_P, BCI5_spec, 0),
-		BAND_INIT(code_LocalVariableTable_span_O, BRANCH5_spec, 0),
-		BAND_INIT(code_LocalVariableTable_name_RU, UNSIGNED5_spec, INDEX(CONSTANT_Utf8)),
-		BAND_INIT(code_LocalVariableTable_type_RS, UNSIGNED5_spec, INDEX(CONSTANT_Signature)),
-		BAND_INIT(code_LocalVariableTable_slot, UNSIGNED5_spec, 0),
-		BAND_INIT(code_LocalVariableTypeTable_N, UNSIGNED5_spec, 0),
-		BAND_INIT(code_LocalVariableTypeTable_bci_P, BCI5_spec, 0),
-		BAND_INIT(code_LocalVariableTypeTable_span_O, BRANCH5_spec, 0),
-		BAND_INIT(code_LocalVariableTypeTable_name_RU, UNSIGNED5_spec, INDEX(CONSTANT_Utf8)),
-		BAND_INIT(code_LocalVariableTypeTable_type_RS, UNSIGNED5_spec,
-				  INDEX(CONSTANT_Signature)),
-		BAND_INIT(code_LocalVariableTypeTable_slot, UNSIGNED5_spec, 0),
-		BAND_INIT(code_attr_bands, -1, -1), BAND_INIT(bc_codes, BYTE1_spec, 0),
-		BAND_INIT(bc_case_count, UNSIGNED5_spec, 0), BAND_INIT(bc_case_value, DELTA5_spec, 0),
-		BAND_INIT(bc_byte, BYTE1_spec, 0), BAND_INIT(bc_short, DELTA5_spec, 0),
-		BAND_INIT(bc_local, UNSIGNED5_spec, 0), BAND_INIT(bc_label, BRANCH5_spec, 0),
-		BAND_INIT(bc_intref, DELTA5_spec, INDEX(CONSTANT_Integer)),
-		BAND_INIT(bc_floatref, DELTA5_spec, INDEX(CONSTANT_Float)),
-		BAND_INIT(bc_longref, DELTA5_spec, INDEX(CONSTANT_Long)),
-		BAND_INIT(bc_doubleref, DELTA5_spec, INDEX(CONSTANT_Double)),
-		BAND_INIT(bc_stringref, DELTA5_spec, INDEX(CONSTANT_String)),
-		BAND_INIT(bc_classref, UNSIGNED5_spec, NULL_OR_INDEX(CONSTANT_Class)),
-		BAND_INIT(bc_fieldref, DELTA5_spec, INDEX(CONSTANT_Fieldref)),
-		BAND_INIT(bc_methodref, UNSIGNED5_spec, INDEX(CONSTANT_Methodref)),
-		BAND_INIT(bc_imethodref, DELTA5_spec, INDEX(CONSTANT_InterfaceMethodref)),
-		BAND_INIT(bc_thisfield, UNSIGNED5_spec, SUB_INDEX(CONSTANT_Fieldref)),
-		BAND_INIT(bc_superfield, UNSIGNED5_spec, SUB_INDEX(CONSTANT_Fieldref)),
-		BAND_INIT(bc_thismethod, UNSIGNED5_spec, SUB_INDEX(CONSTANT_Methodref)),
-		BAND_INIT(bc_supermethod, UNSIGNED5_spec, SUB_INDEX(CONSTANT_Methodref)),
-		BAND_INIT(bc_initref, UNSIGNED5_spec, SUB_INDEX(CONSTANT_Methodref)),
-		BAND_INIT(bc_escref, UNSIGNED5_spec, INDEX(CONSTANT_All)),
-		BAND_INIT(bc_escrefsize, UNSIGNED5_spec, 0), BAND_INIT(bc_escsize, UNSIGNED5_spec, 0),
-		BAND_INIT(bc_escbyte, BYTE1_spec, 0),
-		BAND_INIT(file_name, UNSIGNED5_spec, INDEX(CONSTANT_Utf8)),
-		BAND_INIT(file_size_hi, UNSIGNED5_spec, 0), BAND_INIT(file_size_lo, UNSIGNED5_spec, 0),
-		BAND_INIT(file_modtime, DELTA5_spec, 0), BAND_INIT(file_options, UNSIGNED5_spec, 0),
-		// BAND_INIT(file_bits, BYTE1_spec, 0),
-		{0, 0}};
-
-band *band::makeBands(unpacker *u)
-{
-	band *tmp_all_bands = U_NEW(band, BAND_LIMIT);
-	for (int i = 0; i < BAND_LIMIT; i++)
-	{
-		assert((byte *)&all_band_inits[i + 1] <
-			   (byte *)all_band_inits + sizeof(all_band_inits));
-		const band_init &bi = all_band_inits[i];
-		band &b = tmp_all_bands[i];
-		coding *defc = coding::findBySpec(bi.defc);
-		assert((defc == nullptr) == (bi.defc == -1)); // no garbage, please
-		assert(defc == nullptr || !defc->isMalloc);
-		b.init(u, i, defc);
-		if (bi.index > 0)
-		{
-			b.nullOK = ((bi.index >> 8) & 1);
-			b.ixTag = (bi.index & 0xFF);
-		}
-	}
-	return tmp_all_bands;
-}
-
-void band::initIndexes(unpacker *u)
-{
-	band *tmp_all_bands = u->all_bands;
-	for (int i = 0; i < BAND_LIMIT; i++)
-	{
-		band *scan = &tmp_all_bands[i];
-		uint32_t tag = scan->ixTag; // Cf. #define INDEX(tag) above
-		if (tag != 0 && tag != CONSTANT_Literal && (tag & SUBINDEX_BIT) == 0)
-		{
-			scan->setIndex(u->cp.getIndex(tag));
-		}
-	}
-}
diff --git a/depends/pack200/src/bands.h b/depends/pack200/src/bands.h
deleted file mode 100644
index a56cd7d5..00000000
--- a/depends/pack200/src/bands.h
+++ /dev/null
@@ -1,489 +0,0 @@
-/*
- * Copyright (c) 2002, 2005, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-// -*- C++ -*-
-struct entry;
-struct cpindex;
-struct unpacker;
-
-struct band
-{
-	int bn;	   // band_number of this band
-	coding *defc; // default coding method
-	cpindex *ix;  // CP entry mapping, if CPRefBand
-	byte ixTag;   // 0 or 1; nullptr is coded as (nullOK?0:-1)
-	byte nullOK;  // 0 or 1; nullptr is coded as (nullOK?0:-1)
-	int length;   // expected # values
-	unpacker *u;  // back pointer
-
-	value_stream vs[2]; // source of values
-	coding_method cm;   // method used for initial state of vs[0]
-	byte *rplimit;	  // end of band (encoded, transmitted)
-
-	int total_memo; // cached value of getIntTotal, or -1
-	int *hist0;	 // approximate. histogram
-	enum
-	{
-		HIST0_MIN = 0,
-		HIST0_MAX = 255
-	}; // catches the usual cases
-
-	// properties for attribute layout elements:
-	byte le_kind;   // EK_XXX
-	byte le_bci;	// 0,EK_BCI,EK_BCD,EK_BCO
-	byte le_back;   // ==EF_BACK
-	byte le_len;	// 0,1,2,4 (size in classfile), or call addr
-	band **le_body; // body of repl, union, call (nullptr-terminated)
-// Note:  EK_CASE elements use hist0 to record union tags.
-#define le_casetags hist0
-
-	band &nextBand()
-	{
-		return this[1];
-	}
-	band &prevBand()
-	{
-		return this[-1];
-	}
-
-	void init(unpacker *u_, int bn_, coding *defc_)
-	{
-		u = u_;
-		cm.u = u_;
-		bn = bn_;
-		defc = defc_;
-	}
-	void init(unpacker *u_, int bn_, int defcSpec)
-	{
-		init(u_, bn_, coding::findBySpec(defcSpec));
-	}
-	void initRef(int ixTag_ = 0, bool nullOK_ = false)
-	{
-		ixTag = ixTag_;
-		nullOK = nullOK_;
-		setIndexByTag(ixTag);
-	}
-
-	void expectMoreLength(int l)
-	{
-		assert(length >= 0);		// able to accept a length
-		assert((int)l >= 0);		// no overflow
-		assert(rplimit == nullptr); // readData not yet called
-		length += l;
-		assert(length >= l); // no overflow
-	}
-
-	void setIndex(cpindex *ix_);
-	void setIndexByTag(byte tag);
-
-	// Parse the band and its meta-coding header.
-	void readData(int expectedLength = 0);
-
-	// Reset the band for another pass (Cf. Java Band.resetForSecondPass.)
-	void rewind()
-	{
-		cm.reset(&vs[0]);
-	}
-
-	byte *&curRP()
-	{
-		return vs[0].rp;
-	}
-	byte *minRP()
-	{
-		return cm.vs0.rp;
-	}
-	byte *maxRP()
-	{
-		return rplimit;
-	}
-	size_t size()
-	{
-		return maxRP() - minRP();
-	}
-
-	int getByte()
-	{
-		assert(ix == nullptr);
-		return vs[0].getByte();
-	}
-	int getInt()
-	{
-		assert(ix == nullptr);
-		return vs[0].getInt();
-	}
-	entry *getRefN()
-	{
-		assert(ix != nullptr);
-		return getRefCommon(ix, true);
-	}
-	entry *getRef()
-	{
-		assert(ix != nullptr);
-		return getRefCommon(ix, false);
-	}
-	entry *getRefUsing(cpindex *ix2)
-	{
-		assert(ix == nullptr);
-		return getRefCommon(ix2, true);
-	}
-	entry *getRefCommon(cpindex *ix, bool nullOK);
-	int64_t getLong(band &lo_band, bool have_hi);
-
-	static int64_t makeLong(uint32_t hi, uint32_t lo)
-	{
-		return ((uint64_t)hi << 32) + (((uint64_t)lo << 32) >> 32);
-	}
-
-	int getIntTotal();
-	int getIntCount(int tag);
-
-	static band *makeBands(unpacker *u);
-	static void initIndexes(unpacker *u);
-};
-
-extern band all_bands[];
-
-#define BAND_LOCAL /*                                                                          \
-  band* band_temp = all_bands;                                                                 \
-  band* all_bands = band_temp */
-
-// Band schema:
-enum band_number
-{
-	// e_archive_magic,
-	// e_archive_header,
-	// e_band_headers,
-
-	// constant pool contents
-	e_cp_Utf8_prefix,
-	e_cp_Utf8_suffix,
-	e_cp_Utf8_chars,
-	e_cp_Utf8_big_suffix,
-	e_cp_Utf8_big_chars,
-	e_cp_Int,
-	e_cp_Float,
-	e_cp_Long_hi,
-	e_cp_Long_lo,
-	e_cp_Double_hi,
-	e_cp_Double_lo,
-	e_cp_String,
-	e_cp_Class,
-	e_cp_Signature_form,
-	e_cp_Signature_classes,
-	e_cp_Descr_name,
-	e_cp_Descr_type,
-	e_cp_Field_class,
-	e_cp_Field_desc,
-	e_cp_Method_class,
-	e_cp_Method_desc,
-	e_cp_Imethod_class,
-	e_cp_Imethod_desc,
-
-	// bands which define transmission of attributes
-	e_attr_definition_headers,
-	e_attr_definition_name,
-	e_attr_definition_layout,
-
-	// band for hardwired InnerClasses attribute (shared across the package)
-	e_ic_this_class,
-	e_ic_flags,
-	// These bands contain data only where flags sets ACC_IC_LONG_FORM:
-	e_ic_outer_class,
-	e_ic_name,
-
-	// bands for carrying class schema information:
-	e_class_this,
-	e_class_super,
-	e_class_interface_count,
-	e_class_interface,
-
-	// bands for class members
-	e_class_field_count,
-	e_class_method_count,
-	e_field_descr,
-	e_field_flags_hi,
-	e_field_flags_lo,
-	e_field_attr_count,
-	e_field_attr_indexes,
-	e_field_attr_calls,
-	e_field_ConstantValue_KQ,
-	e_field_Signature_RS,
-	e_field_metadata_bands,
-	e_field_attr_bands,
-	e_method_descr,
-	e_method_flags_hi,
-	e_method_flags_lo,
-	e_method_attr_count,
-	e_method_attr_indexes,
-	e_method_attr_calls,
-	e_method_Exceptions_N,
-	e_method_Exceptions_RC,
-	e_method_Signature_RS,
-	e_method_metadata_bands,
-	e_method_attr_bands,
-	e_class_flags_hi,
-	e_class_flags_lo,
-	e_class_attr_count,
-	e_class_attr_indexes,
-	e_class_attr_calls,
-	e_class_SourceFile_RUN,
-	e_class_EnclosingMethod_RC,
-	e_class_EnclosingMethod_RDN,
-	e_class_Signature_RS,
-	e_class_metadata_bands,
-	e_class_InnerClasses_N,
-	e_class_InnerClasses_RC,
-	e_class_InnerClasses_F,
-	e_class_InnerClasses_outer_RCN,
-	e_class_InnerClasses_name_RUN,
-	e_class_ClassFile_version_minor_H,
-	e_class_ClassFile_version_major_H,
-	e_class_attr_bands,
-	e_code_headers,
-	e_code_max_stack,
-	e_code_max_na_locals,
-	e_code_handler_count,
-	e_code_handler_start_P,
-	e_code_handler_end_PO,
-	e_code_handler_catch_PO,
-	e_code_handler_class_RCN,
-
-	// code attributes
-	e_code_flags_hi,
-	e_code_flags_lo,
-	e_code_attr_count,
-	e_code_attr_indexes,
-	e_code_attr_calls,
-	e_code_StackMapTable_N,
-	e_code_StackMapTable_frame_T,
-	e_code_StackMapTable_local_N,
-	e_code_StackMapTable_stack_N,
-	e_code_StackMapTable_offset,
-	e_code_StackMapTable_T,
-	e_code_StackMapTable_RC,
-	e_code_StackMapTable_P,
-	e_code_LineNumberTable_N,
-	e_code_LineNumberTable_bci_P,
-	e_code_LineNumberTable_line,
-	e_code_LocalVariableTable_N,
-	e_code_LocalVariableTable_bci_P,
-	e_code_LocalVariableTable_span_O,
-	e_code_LocalVariableTable_name_RU,
-	e_code_LocalVariableTable_type_RS,
-	e_code_LocalVariableTable_slot,
-	e_code_LocalVariableTypeTable_N,
-	e_code_LocalVariableTypeTable_bci_P,
-	e_code_LocalVariableTypeTable_span_O,
-	e_code_LocalVariableTypeTable_name_RU,
-	e_code_LocalVariableTypeTable_type_RS,
-	e_code_LocalVariableTypeTable_slot,
-	e_code_attr_bands,
-
-	// bands for bytecodes
-	e_bc_codes,
-	// remaining bands provide typed opcode fields required by the bc_codes
-	e_bc_case_count,
-	e_bc_case_value,
-	e_bc_byte,
-	e_bc_short,
-	e_bc_local,
-	e_bc_label,
-
-	// ldc* operands:
-	e_bc_intref,
-	e_bc_floatref,
-	e_bc_longref,
-	e_bc_doubleref,
-	e_bc_stringref,
-	e_bc_classref,
-	e_bc_fieldref,
-	e_bc_methodref,
-	e_bc_imethodref,
-
-	// _self_linker_op family
-	e_bc_thisfield,
-	e_bc_superfield,
-	e_bc_thismethod,
-	e_bc_supermethod,
-
-	// bc_invokeinit family:
-	e_bc_initref,
-
-	// bytecode escape sequences
-	e_bc_escref,
-	e_bc_escrefsize,
-	e_bc_escsize,
-	e_bc_escbyte,
-
-	// file attributes and contents
-	e_file_name,
-	e_file_size_hi,
-	e_file_size_lo,
-	e_file_modtime,
-	e_file_options,
-	// e_file_bits,  // handled specially as an appendix
-	BAND_LIMIT
-};
-
-// Symbolic names for bands, as if in a giant global struct:
-//#define archive_magic all_bands[e_archive_magic]
-//#define archive_header all_bands[e_archive_header]
-//#define band_headers all_bands[e_band_headers]
-#define cp_Utf8_prefix all_bands[e_cp_Utf8_prefix]
-#define cp_Utf8_suffix all_bands[e_cp_Utf8_suffix]
-#define cp_Utf8_chars all_bands[e_cp_Utf8_chars]
-#define cp_Utf8_big_suffix all_bands[e_cp_Utf8_big_suffix]
-#define cp_Utf8_big_chars all_bands[e_cp_Utf8_big_chars]
-#define cp_Int all_bands[e_cp_Int]
-#define cp_Float all_bands[e_cp_Float]
-#define cp_Long_hi all_bands[e_cp_Long_hi]
-#define cp_Long_lo all_bands[e_cp_Long_lo]
-#define cp_Double_hi all_bands[e_cp_Double_hi]
-#define cp_Double_lo all_bands[e_cp_Double_lo]
-#define cp_String all_bands[e_cp_String]
-#define cp_Class all_bands[e_cp_Class]
-#define cp_Signature_form all_bands[e_cp_Signature_form]
-#define cp_Signature_classes all_bands[e_cp_Signature_classes]
-#define cp_Descr_name all_bands[e_cp_Descr_name]
-#define cp_Descr_type all_bands[e_cp_Descr_type]
-#define cp_Field_class all_bands[e_cp_Field_class]
-#define cp_Field_desc all_bands[e_cp_Field_desc]
-#define cp_Method_class all_bands[e_cp_Method_class]
-#define cp_Method_desc all_bands[e_cp_Method_desc]
-#define cp_Imethod_class all_bands[e_cp_Imethod_class]
-#define cp_Imethod_desc all_bands[e_cp_Imethod_desc]
-#define attr_definition_headers all_bands[e_attr_definition_headers]
-#define attr_definition_name all_bands[e_attr_definition_name]
-#define attr_definition_layout all_bands[e_attr_definition_layout]
-#define ic_this_class all_bands[e_ic_this_class]
-#define ic_flags all_bands[e_ic_flags]
-#define ic_outer_class all_bands[e_ic_outer_class]
-#define ic_name all_bands[e_ic_name]
-#define class_this all_bands[e_class_this]
-#define class_super all_bands[e_class_super]
-#define class_interface_count all_bands[e_class_interface_count]
-#define class_interface all_bands[e_class_interface]
-#define class_field_count all_bands[e_class_field_count]
-#define class_method_count all_bands[e_class_method_count]
-#define field_descr all_bands[e_field_descr]
-#define field_flags_hi all_bands[e_field_flags_hi]
-#define field_flags_lo all_bands[e_field_flags_lo]
-#define field_attr_count all_bands[e_field_attr_count]
-#define field_attr_indexes all_bands[e_field_attr_indexes]
-#define field_ConstantValue_KQ all_bands[e_field_ConstantValue_KQ]
-#define field_Signature_RS all_bands[e_field_Signature_RS]
-#define field_attr_bands all_bands[e_field_attr_bands]
-#define method_descr all_bands[e_method_descr]
-#define method_flags_hi all_bands[e_method_flags_hi]
-#define method_flags_lo all_bands[e_method_flags_lo]
-#define method_attr_count all_bands[e_method_attr_count]
-#define method_attr_indexes all_bands[e_method_attr_indexes]
-#define method_Exceptions_N all_bands[e_method_Exceptions_N]
-#define method_Exceptions_RC all_bands[e_method_Exceptions_RC]
-#define method_Signature_RS all_bands[e_method_Signature_RS]
-#define method_attr_bands all_bands[e_method_attr_bands]
-#define class_flags_hi all_bands[e_class_flags_hi]
-#define class_flags_lo all_bands[e_class_flags_lo]
-#define class_attr_count all_bands[e_class_attr_count]
-#define class_attr_indexes all_bands[e_class_attr_indexes]
-#define class_SourceFile_RUN all_bands[e_class_SourceFile_RUN]
-#define class_EnclosingMethod_RC all_bands[e_class_EnclosingMethod_RC]
-#define class_EnclosingMethod_RDN all_bands[e_class_EnclosingMethod_RDN]
-#define class_Signature_RS all_bands[e_class_Signature_RS]
-#define class_InnerClasses_N all_bands[e_class_InnerClasses_N]
-#define class_InnerClasses_RC all_bands[e_class_InnerClasses_RC]
-#define class_InnerClasses_F all_bands[e_class_InnerClasses_F]
-#define class_InnerClasses_outer_RCN all_bands[e_class_InnerClasses_outer_RCN]
-#define class_InnerClasses_name_RUN all_bands[e_class_InnerClasses_name_RUN]
-#define class_ClassFile_version_minor_H all_bands[e_class_ClassFile_version_minor_H]
-#define class_ClassFile_version_major_H all_bands[e_class_ClassFile_version_major_H]
-#define class_attr_bands all_bands[e_class_attr_bands]
-#define code_headers all_bands[e_code_headers]
-#define code_max_stack all_bands[e_code_max_stack]
-#define code_max_na_locals all_bands[e_code_max_na_locals]
-#define code_handler_count all_bands[e_code_handler_count]
-#define code_handler_start_P all_bands[e_code_handler_start_P]
-#define code_handler_end_PO all_bands[e_code_handler_end_PO]
-#define code_handler_catch_PO all_bands[e_code_handler_catch_PO]
-#define code_handler_class_RCN all_bands[e_code_handler_class_RCN]
-#define code_flags_hi all_bands[e_code_flags_hi]
-#define code_flags_lo all_bands[e_code_flags_lo]
-#define code_attr_count all_bands[e_code_attr_count]
-#define code_attr_indexes all_bands[e_code_attr_indexes]
-#define code_StackMapTable_N all_bands[e_code_StackMapTable_N]
-#define code_StackMapTable_frame_T all_bands[e_code_StackMapTable_frame_T]
-#define code_StackMapTable_local_N all_bands[e_code_StackMapTable_local_N]
-#define code_StackMapTable_stack_N all_bands[e_code_StackMapTable_stack_N]
-#define code_StackMapTable_offset all_bands[e_code_StackMapTable_offset]
-#define code_StackMapTable_T all_bands[e_code_StackMapTable_T]
-#define code_StackMapTable_RC all_bands[e_code_StackMapTable_RC]
-#define code_StackMapTable_P all_bands[e_code_StackMapTable_P]
-#define code_LineNumberTable_N all_bands[e_code_LineNumberTable_N]
-#define code_LineNumberTable_bci_P all_bands[e_code_LineNumberTable_bci_P]
-#define code_LineNumberTable_line all_bands[e_code_LineNumberTable_line]
-#define code_LocalVariableTable_N all_bands[e_code_LocalVariableTable_N]
-#define code_LocalVariableTable_bci_P all_bands[e_code_LocalVariableTable_bci_P]
-#define code_LocalVariableTable_span_O all_bands[e_code_LocalVariableTable_span_O]
-#define code_LocalVariableTable_name_RU all_bands[e_code_LocalVariableTable_name_RU]
-#define code_LocalVariableTable_type_RS all_bands[e_code_LocalVariableTable_type_RS]
-#define code_LocalVariableTable_slot all_bands[e_code_LocalVariableTable_slot]
-#define code_LocalVariableTypeTable_N all_bands[e_code_LocalVariableTypeTable_N]
-#define code_LocalVariableTypeTable_bci_P all_bands[e_code_LocalVariableTypeTable_bci_P]
-#define code_LocalVariableTypeTable_span_O all_bands[e_code_LocalVariableTypeTable_span_O]
-#define code_LocalVariableTypeTable_name_RU all_bands[e_code_LocalVariableTypeTable_name_RU]
-#define code_LocalVariableTypeTable_type_RS all_bands[e_code_LocalVariableTypeTable_type_RS]
-#define code_LocalVariableTypeTable_slot all_bands[e_code_LocalVariableTypeTable_slot]
-#define code_attr_bands all_bands[e_code_attr_bands]
-#define bc_codes all_bands[e_bc_codes]
-#define bc_case_count all_bands[e_bc_case_count]
-#define bc_case_value all_bands[e_bc_case_value]
-#define bc_byte all_bands[e_bc_byte]
-#define bc_short all_bands[e_bc_short]
-#define bc_local all_bands[e_bc_local]
-#define bc_label all_bands[e_bc_label]
-#define bc_intref all_bands[e_bc_intref]
-#define bc_floatref all_bands[e_bc_floatref]
-#define bc_longref all_bands[e_bc_longref]
-#define bc_doubleref all_bands[e_bc_doubleref]
-#define bc_stringref all_bands[e_bc_stringref]
-#define bc_classref all_bands[e_bc_classref]
-#define bc_fieldref all_bands[e_bc_fieldref]
-#define bc_methodref all_bands[e_bc_methodref]
-#define bc_imethodref all_bands[e_bc_imethodref]
-#define bc_thisfield all_bands[e_bc_thisfield]
-#define bc_superfield all_bands[e_bc_superfield]
-#define bc_thismethod all_bands[e_bc_thismethod]
-#define bc_supermethod all_bands[e_bc_supermethod]
-#define bc_initref all_bands[e_bc_initref]
-#define bc_escref all_bands[e_bc_escref]
-#define bc_escrefsize all_bands[e_bc_escrefsize]
-#define bc_escsize all_bands[e_bc_escsize]
-#define bc_escbyte all_bands[e_bc_escbyte]
-#define file_name all_bands[e_file_name]
-#define file_size_hi all_bands[e_file_size_hi]
-#define file_size_lo all_bands[e_file_size_lo]
-#define file_modtime all_bands[e_file_modtime]
-#define file_options all_bands[e_file_options]
diff --git a/depends/pack200/src/bytes.cpp b/depends/pack200/src/bytes.cpp
deleted file mode 100644
index d3808afa..00000000
--- a/depends/pack200/src/bytes.cpp
+++ /dev/null
@@ -1,217 +0,0 @@
-/*
- * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <assert.h>
-#include <stdint.h>
-#include "defines.h"
-#include "bytes.h"
-#include "utils.h"
-
-static byte dummy[1 << 10];
-
-bool bytes::inBounds(const void *p)
-{
-	return p >= ptr && p < limit();
-}
-
-void bytes::malloc(size_t len_)
-{
-	len = len_;
-	ptr = NEW(byte, add_size(len_, 1)); // add trailing zero byte always
-	if (ptr == nullptr)
-	{
-		// set ptr to some victim memory, to ease escape
-		set(dummy, sizeof(dummy) - 1);
-		unpack_abort(ERROR_ENOMEM);
-	}
-}
-
-void bytes::realloc(size_t len_)
-{
-	if (len == len_)
-		return; // nothing to do
-	if (ptr == dummy)
-		return; // escaping from an error
-	if (ptr == nullptr)
-	{
-		malloc(len_);
-		return;
-	}
-	byte *oldptr = ptr;
-	ptr = (len_ >= PSIZE_MAX) ? nullptr : (byte *)::realloc(ptr, add_size(len_, 1));
-	if (ptr != nullptr)
-	{
-		if (len < len_)
-			memset(ptr + len, 0, len_ - len);
-		ptr[len_] = 0;
-		len = len_;
-	}
-	else
-	{
-		ptr = oldptr; // ease our escape
-		unpack_abort(ERROR_ENOMEM);
-	}
-}
-
-void bytes::free()
-{
-	if (ptr == dummy)
-		return; // escaping from an error
-	if (ptr != nullptr)
-	{
-		::free(ptr);
-	}
-	len = 0;
-	ptr = 0;
-}
-
-int bytes::indexOf(byte c)
-{
-	byte *p = (byte *)memchr(ptr, c, len);
-	return (p == 0) ? -1 : (int)(p - ptr);
-}
-
-byte *bytes::writeTo(byte *bp)
-{
-	memcpy(bp, ptr, len);
-	return bp + len;
-}
-
-int bytes::compareTo(bytes &other)
-{
-	size_t l1 = len;
-	size_t l2 = other.len;
-	int cmp = memcmp(ptr, other.ptr, (l1 < l2) ? l1 : l2);
-	if (cmp != 0)
-		return cmp;
-	return (l1 < l2) ? -1 : (l1 > l2) ? 1 : 0;
-}
-
-void bytes::saveFrom(const void *ptr_, size_t len_)
-{
-	malloc(len_);
-	// Save as much as possible.
-	if (len_ > len)
-	{
-		assert(ptr == dummy); // error recovery
-		len_ = len;
-	}
-	copyFrom(ptr_, len_);
-}
-
-//#TODO: Need to fix for exception handling
-void bytes::copyFrom(const void *ptr_, size_t len_, size_t offset)
-{
-	assert(len_ == 0 || inBounds(ptr + offset));
-	assert(len_ == 0 || inBounds(ptr + offset + len_ - 1));
-	memcpy(ptr + offset, ptr_, len_);
-}
-
-// Make sure there are 'o' bytes beyond the fill pointer,
-// advance the fill pointer, and return the old fill pointer.
-byte *fillbytes::grow(size_t s)
-{
-	size_t nlen = add_size(b.len, s);
-	if (nlen <= allocated)
-	{
-		b.len = nlen;
-		return limit() - s;
-	}
-	size_t maxlen = nlen;
-	if (maxlen < 128)
-		maxlen = 128;
-	if (maxlen < allocated * 2)
-		maxlen = allocated * 2;
-	if (allocated == 0)
-	{
-		// Initial buffer was not malloced.  Do not reallocate it.
-		bytes old = b;
-		b.malloc(maxlen);
-		if (b.len == maxlen)
-			old.writeTo(b.ptr);
-	}
-	else
-	{
-		b.realloc(maxlen);
-	}
-	allocated = b.len;
-	if (allocated != maxlen)
-	{
-		b.len = nlen - s; // back up
-		return dummy;	 // scribble during error recov.
-	}
-	// after realloc, recompute pointers
-	b.len = nlen;
-	assert(b.len <= allocated);
-	return limit() - s;
-}
-
-void fillbytes::ensureSize(size_t s)
-{
-	if (allocated >= s)
-		return;
-	size_t len0 = b.len;
-	grow(s - size());
-	b.len = len0; // put it back
-}
-
-int ptrlist::indexOf(const void *x)
-{
-	int len = length();
-	for (int i = 0; i < len; i++)
-	{
-		if (get(i) == x)
-			return i;
-	}
-	return -1;
-}
-
-void ptrlist::freeAll()
-{
-	int len = length();
-	for (int i = 0; i < len; i++)
-	{
-		void *p = (void *)get(i);
-		if (p != nullptr)
-		{
-			::free(p);
-		}
-	}
-	free();
-}
-
-int intlist::indexOf(int x)
-{
-	int len = length();
-	for (int i = 0; i < len; i++)
-	{
-		if (get(i) == x)
-			return i;
-	}
-	return -1;
-}
diff --git a/depends/pack200/src/bytes.h b/depends/pack200/src/bytes.h
deleted file mode 100644
index b116efda..00000000
--- a/depends/pack200/src/bytes.h
+++ /dev/null
@@ -1,286 +0,0 @@
-/*
- * Copyright (c) 2001, 2008, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-#pragma once
-
-struct bytes
-{
-	int8_t *ptr;
-	size_t len;
-	int8_t *limit()
-	{
-		return ptr + len;
-	}
-
-	void set(int8_t *ptr_, size_t len_)
-	{
-		ptr = ptr_;
-		len = len_;
-	}
-	void set(const char *str)
-	{
-		ptr = (int8_t *)str;
-		len = strlen(str);
-	}
-	bool inBounds(const void *p); // p in [ptr, limit)
-	void malloc(size_t len_);
-	void realloc(size_t len_);
-	void free();
-	void copyFrom(const void *ptr_, size_t len_, size_t offset = 0);
-	void saveFrom(const void *ptr_, size_t len_);
-	void saveFrom(const char *str)
-	{
-		saveFrom(str, strlen(str));
-	}
-	void copyFrom(bytes &other, size_t offset = 0)
-	{
-		copyFrom(other.ptr, other.len, offset);
-	}
-	void saveFrom(bytes &other)
-	{
-		saveFrom(other.ptr, other.len);
-	}
-	void clear(int fill_byte = 0)
-	{
-		memset(ptr, fill_byte, len);
-	}
-	int8_t *writeTo(int8_t *bp);
-	bool equals(bytes &other)
-	{
-		return 0 == compareTo(other);
-	}
-	int compareTo(bytes &other);
-	bool contains(int8_t c)
-	{
-		return indexOf(c) >= 0;
-	}
-	int indexOf(int8_t c);
-	// substrings:
-	static bytes of(int8_t *ptr, size_t len)
-	{
-		bytes res;
-		res.set(ptr, len);
-		return res;
-	}
-	bytes slice(size_t beg, size_t end)
-	{
-		bytes res;
-		res.ptr = ptr + beg;
-		res.len = end - beg;
-		assert(res.len == 0 ||(inBounds(res.ptr) && inBounds(res.limit() - 1)));
-		return res;
-	}
-	// building C strings inside byte buffers:
-	bytes &strcat(const char *str)
-	{
-		::strcat((char *)ptr, str);
-		return *this;
-	}
-	bytes &strcat(bytes &other)
-	{
-		::strncat((char *)ptr, (char *)other.ptr, other.len);
-		return *this;
-	}
-	char *strval()
-	{
-		assert(strlen((char *)ptr) == len);
-		return (char *)ptr;
-	}
-};
-#define BYTES_OF(var) (bytes::of((int8_t *)&(var), sizeof(var)))
-
-struct fillbytes
-{
-	bytes b;
-	size_t allocated;
-
-	int8_t *base()
-	{
-		return b.ptr;
-	}
-	size_t size()
-	{
-		return b.len;
-	}
-	int8_t *limit()
-	{
-		return b.limit();
-	} // logical limit
-	void setLimit(int8_t *lp)
-	{
-		assert(isAllocated(lp));
-		b.len = lp - b.ptr;
-	}
-	int8_t *end()
-	{
-		return b.ptr + allocated;
-	} // physical limit
-	int8_t *loc(size_t o)
-	{
-		assert(o < b.len);
-		return b.ptr + o;
-	}
-	void init()
-	{
-		allocated = 0;
-		b.set(nullptr, 0);
-	}
-	void init(size_t s)
-	{
-		init();
-		ensureSize(s);
-	}
-	void free()
-	{
-		if (allocated != 0)
-			b.free();
-		allocated = 0;
-	}
-	void empty()
-	{
-		b.len = 0;
-	}
-	int8_t *grow(size_t s); // grow so that limit() += s
-	int getByte(uint32_t i)
-	{
-		return *loc(i) & 0xFF;
-	}
-	void addByte(int8_t x)
-	{
-		*grow(1) = x;
-	}
-	void ensureSize(size_t s); // make sure allocated >= s
-	void trimToSize()
-	{
-		if (allocated > size())
-			b.realloc(allocated = size());
-	}
-	bool canAppend(size_t s)
-	{
-		return allocated > b.len + s;
-	}
-	bool isAllocated(int8_t *p)
-	{
-		return p >= base() && p <= end();
-	} // asserts
-	void set(bytes &src)
-	{
-		set(src.ptr, src.len);
-	}
-
-	void set(int8_t *ptr, size_t len)
-	{
-		b.set(ptr, len);
-		allocated = 0; // mark as not reallocatable
-	}
-
-	// block operations on resizing byte buffer:
-	fillbytes &append(const void *ptr_, size_t len_)
-	{
-		memcpy(grow(len_), ptr_, len_);
-		return (*this);
-	}
-	fillbytes &append(bytes &other)
-	{
-		return append(other.ptr, other.len);
-	}
-	fillbytes &append(const char *str)
-	{
-		return append(str, strlen(str));
-	}
-};
-
-struct ptrlist : fillbytes
-{
-	typedef const void *cvptr;
-	int length()
-	{
-		return (int)(size() / sizeof(cvptr));
-	}
-	cvptr *base()
-	{
-		return (cvptr *)fillbytes::base();
-	}
-	cvptr &get(int i)
-	{
-		return *(cvptr *)loc(i * sizeof(cvptr));
-	}
-	cvptr *limit()
-	{
-		return (cvptr *)fillbytes::limit();
-	}
-	void add(cvptr x)
-	{
-		*(cvptr *)grow(sizeof(x)) = x;
-	}
-	void popTo(int l)
-	{
-		assert(l <= length());
-		b.len = l * sizeof(cvptr);
-	}
-	int indexOf(cvptr x);
-	bool contains(cvptr x)
-	{
-		return indexOf(x) >= 0;
-	}
-	void freeAll(); // frees every ptr on the list, plus the list itself
-};
-// Use a macro rather than mess with subtle mismatches
-// between member and non-member function pointers.
-#define PTRLIST_QSORT(ptrls, fn) ::qsort((ptrls).base(), (ptrls).length(), sizeof(void *), fn)
-
-struct intlist : fillbytes
-{
-	int length()
-	{
-		return (int)(size() / sizeof(int));
-	}
-	int *base()
-	{
-		return (int *)fillbytes::base();
-	}
-	int &get(int i)
-	{
-		return *(int *)loc(i * sizeof(int));
-	}
-	int *limit()
-	{
-		return (int *)fillbytes::limit();
-	}
-	void add(int x)
-	{
-		*(int *)grow(sizeof(x)) = x;
-	}
-	void popTo(int l)
-	{
-		assert(l <= length());
-		b.len = l * sizeof(int);
-	}
-	int indexOf(int x);
-	bool contains(int x)
-	{
-		return indexOf(x) >= 0;
-	}
-};
diff --git a/depends/pack200/src/coding.cpp b/depends/pack200/src/coding.cpp
deleted file mode 100644
index 6bd17a3c..00000000
--- a/depends/pack200/src/coding.cpp
+++ /dev/null
@@ -1,1044 +0,0 @@
-/*
- * Copyright (c) 2002, 2009, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-// -*- C++ -*-
-// Small program for unpacking specially compressed Java packages.
-// John R. Rose
-
-#include <stdio.h>
-#include <string.h>
-#include <stdlib.h>
-#include <stdarg.h>
-#include <assert.h>
-#include <stdint.h>
-
-#include "defines.h"
-#include "bytes.h"
-#include "utils.h"
-#include "coding.h"
-
-#include "constants.h"
-#include "unpack.h"
-
-extern coding basic_codings[];
-
-// CODING_PRIVATE causes a lot of them
-#pragma GCC diagnostic ignored "-Wunused-variable"
-
-#define CODING_PRIVATE(spec)                                                                   \
-	int spec_ = spec;                                                                          \
-	int B = CODING_B(spec_);                                                                   \
-	int H = CODING_H(spec_);                                                                   \
-	int L = 256 - H;                                                                           \
-	int S = CODING_S(spec_);                                                                   \
-	int D = CODING_D(spec_)
-
-#define IS_NEG_CODE(S, codeVal) ((((int)(codeVal) + 1) & ((1 << S) - 1)) == 0)
-
-#define DECODE_SIGN_S1(ux) (((uint32_t)(ux) >> 1) ^ -((int)(ux) & 1))
-
-static int decode_sign(int S, uint32_t ux)
-{ // == Coding.decodeSign32
-	assert(S > 0);
-	uint32_t sigbits = (ux >> S);
-	if (IS_NEG_CODE(S, ux))
-		return (int)(~sigbits);
-	else
-		return (int)(ux - sigbits);
-	// Note that (int)(ux-sigbits) can be negative, if ux is large enough.
-}
-
-coding *coding::init()
-{
-	if (umax > 0)
-		return this;   // already done
-	assert(spec != 0); // sanity
-
-	// fill in derived fields
-	CODING_PRIVATE(spec);
-
-	// Return nullptr if 'arb(BHSD)' parameter constraints are not met:
-	if (B < 1 || B > B_MAX)
-		return nullptr;
-	if (H < 1 || H > 256)
-		return nullptr;
-	if (S < 0 || S > 2)
-		return nullptr;
-	if (D < 0 || D > 1)
-		return nullptr;
-	if (B == 1 && H != 256)
-		return nullptr; // 1-byte coding must be fixed-size
-	if (B >= 5 && H == 256)
-		return nullptr; // no 5-byte fixed-size coding
-
-	// first compute the range of the coding, in 64 bits
-	int64_t range = 0;
-	{
-		int64_t H_i = 1;
-		for (int i = 0; i < B; i++)
-		{
-			range += H_i;
-			H_i *= H;
-		}
-		range *= L;
-		range += H_i;
-	}
-	assert(range > 0); // no useless codings, please
-
-	int this_umax;
-
-	// now, compute min and max
-	if (range >= ((int64_t)1 << 32))
-	{
-		this_umax = INT_MAX_VALUE;
-		this->umin = INT_MIN_VALUE;
-		this->max = INT_MAX_VALUE;
-		this->min = INT_MIN_VALUE;
-	}
-	else
-	{
-		this_umax = (range > INT_MAX_VALUE) ? INT_MAX_VALUE : (int)range - 1;
-		this->max = this_umax;
-		this->min = this->umin = 0;
-		if (S != 0 && range != 0)
-		{
-			int64_t maxPosCode = range - 1;
-			int64_t maxNegCode = range - 1;
-			while (IS_NEG_CODE(S, maxPosCode))
-				--maxPosCode;
-			while (!IS_NEG_CODE(S, maxNegCode))
-				--maxNegCode;
-			int maxPos = decode_sign(S, (uint32_t)maxPosCode);
-			if (maxPos < 0)
-				this->max = INT_MAX_VALUE; // 32-bit wraparound
-			else
-				this->max = maxPos;
-			if (maxNegCode < 0)
-				this->min = 0; // No negative codings at all.
-			else
-				this->min = decode_sign(S, (uint32_t)maxNegCode);
-		}
-	}
-
-	assert(!(isFullRange | isSigned | isSubrange)); // init
-	if (min < 0)
-		this->isSigned = true;
-	if (max < INT_MAX_VALUE && range <= INT_MAX_VALUE)
-		this->isSubrange = true;
-	if (max == INT_MAX_VALUE && min == INT_MIN_VALUE)
-		this->isFullRange = true;
-
-	// do this last, to reduce MT exposure (should have a membar too)
-	this->umax = this_umax;
-
-	return this;
-}
-
-coding *coding::findBySpec(int spec)
-{
-	for (coding *scan = &basic_codings[0];; scan++)
-	{
-		if (scan->spec == spec)
-			return scan->init();
-		if (scan->spec == 0)
-			break;
-	}
-	coding *ptr = NEW(coding, 1);
-	if (!ptr)
-		return nullptr;
-	coding *c = ptr->initFrom(spec);
-	if (c == nullptr)
-	{
-		::free(ptr);
-	}
-	else
-		// else caller should free it...
-		c->isMalloc = true;
-	return c;
-}
-
-coding *coding::findBySpec(int B, int H, int S, int D)
-{
-	if (B < 1 || B > B_MAX)
-		return nullptr;
-	if (H < 1 || H > 256)
-		return nullptr;
-	if (S < 0 || S > 2)
-		return nullptr;
-	if (D < 0 || D > 1)
-		return nullptr;
-	return findBySpec(CODING_SPEC(B, H, S, D));
-}
-
-void coding::free()
-{
-	if (isMalloc)
-	{
-		::free(this);
-	}
-}
-
-void coding_method::reset(value_stream *state)
-{
-	assert(state->rp == state->rplimit); // not in mid-stream, please
-	// assert(this == vs0.cm);
-	state[0] = vs0;
-	if (uValues != nullptr)
-	{
-		uValues->reset(state->helper());
-	}
-}
-
-uint32_t coding::parse(byte *&rp, int B, int H)
-{
-	int L = 256 - H;
-	byte *ptr = rp;
-	// hand peel the i==0 part of the loop:
-	uint32_t b_i = *ptr++ & 0xFF;
-	if (B == 1 || b_i < (uint32_t)L)
-	{
-		rp = ptr;
-		return b_i;
-	}
-	uint32_t sum = b_i;
-	uint32_t H_i = H;
-	assert(B <= B_MAX);
-	for (int i = 2; i <= B_MAX; i++)
-	{ // easy for compilers to unroll if desired
-		b_i = *ptr++ & 0xFF;
-		sum += b_i * H_i;
-		if (i == B || b_i < (uint32_t)L)
-		{
-			rp = ptr;
-			return sum;
-		}
-		H_i *= H;
-	}
-	assert(false);
-	return 0;
-}
-
-uint32_t coding::parse_lgH(byte *&rp, int B, int H, int lgH)
-{
-	assert(H == (1 << lgH));
-	int L = 256 - (1 << lgH);
-	byte *ptr = rp;
-	// hand peel the i==0 part of the loop:
-	uint32_t b_i = *ptr++ & 0xFF;
-	if (B == 1 || b_i < (uint32_t)L)
-	{
-		rp = ptr;
-		return b_i;
-	}
-	uint32_t sum = b_i;
-	uint32_t lg_H_i = lgH;
-	assert(B <= B_MAX);
-	for (int i = 2; i <= B_MAX; i++)
-	{ // easy for compilers to unroll if desired
-		b_i = *ptr++ & 0xFF;
-		sum += b_i << lg_H_i;
-		if (i == B || b_i < (uint32_t)L)
-		{
-			rp = ptr;
-			return sum;
-		}
-		lg_H_i += lgH;
-	}
-	assert(false);
-	return 0;
-}
-
-static const char ERB[] = "EOF reading band";
-
-void coding::parseMultiple(byte *&rp, int N, byte *limit, int B, int H)
-{
-	if (N < 0)
-	{
-		unpack_abort("bad value count");
-		return;
-	}
-	byte *ptr = rp;
-	if (B == 1 || H == 256)
-	{
-		size_t len = (size_t)N * B;
-		if (len / B != (size_t)N || ptr + len > limit)
-		{
-			unpack_abort(ERB);
-			return;
-		}
-		rp = ptr + len;
-		return;
-	}
-	// Note:  We assume rp has enough zero-padding.
-	int L = 256 - H;
-	int n = B;
-	while (N > 0)
-	{
-		ptr += 1;
-		if (--n == 0)
-		{
-			// end of encoding at B bytes, regardless of byte value
-		}
-		else
-		{
-			int b = (ptr[-1] & 0xFF);
-			if (b >= L)
-			{
-				// keep going, unless we find a byte < L
-				continue;
-			}
-		}
-		// found the last byte
-		N -= 1;
-		n = B; // reset length counter
-		// do an error check here
-		if (ptr > limit)
-		{
-			unpack_abort(ERB);
-			return;
-		}
-	}
-	rp = ptr;
-	return;
-}
-
-bool value_stream::hasHelper()
-{
-	// If my coding method is a pop-style method,
-	// then I need a second value stream to transmit
-	// unfavored values.
-	// This can be determined by examining fValues.
-	return cm->fValues != nullptr;
-}
-
-void value_stream::init(byte *rp_, byte *rplimit_, coding *defc)
-{
-	rp = rp_;
-	rplimit = rplimit_;
-	sum = 0;
-	cm = nullptr; // no need in the simple case
-	setCoding(defc);
-}
-
-void value_stream::setCoding(coding *defc)
-{
-	if (defc == nullptr)
-	{
-		unpack_abort("bad coding");
-		defc = coding::findByIndex(_meta_canon_min); // random pick for recovery
-	}
-
-	c = (*defc);
-
-	// choose cmk
-	cmk = cmk_ERROR;
-	switch (c.spec)
-	{
-	case BYTE1_spec:
-		cmk = cmk_BYTE1;
-		break;
-	case CHAR3_spec:
-		cmk = cmk_CHAR3;
-		break;
-	case UNSIGNED5_spec:
-		cmk = cmk_UNSIGNED5;
-		break;
-	case DELTA5_spec:
-		cmk = cmk_DELTA5;
-		break;
-	case BCI5_spec:
-		cmk = cmk_BCI5;
-		break;
-	case BRANCH5_spec:
-		cmk = cmk_BRANCH5;
-		break;
-	default:
-		if (c.D() == 0)
-		{
-			switch (c.S())
-			{
-			case 0:
-				cmk = cmk_BHS0;
-				break;
-			case 1:
-				cmk = cmk_BHS1;
-				break;
-			default:
-				cmk = cmk_BHS;
-				break;
-			}
-		}
-		else
-		{
-			if (c.S() == 1)
-			{
-				if (c.isFullRange)
-					cmk = cmk_BHS1D1full;
-				if (c.isSubrange)
-					cmk = cmk_BHS1D1sub;
-			}
-			if (cmk == cmk_ERROR)
-				cmk = cmk_BHSD1;
-		}
-	}
-}
-
-static int getPopValue(value_stream *self, uint32_t uval)
-{
-	if (uval > 0)
-	{
-		// note that the initial parse performed a range check
-		assert(uval <= (uint32_t)self->cm->fVlength);
-		return self->cm->fValues[uval - 1];
-	}
-	else
-	{
-		// take an unfavored value
-		return self->helper()->getInt();
-	}
-}
-
-int coding::sumInUnsignedRange(int x, int y)
-{
-	assert(isSubrange);
-	int range = (int)(umax + 1);
-	assert(range > 0);
-	x += y;
-	if (x != (int)((int64_t)(x - y) + (int64_t)y))
-	{
-		// 32-bit overflow interferes with range reduction.
-		// Back off from the overflow by adding a multiple of range:
-		if (x < 0)
-		{
-			x -= range;
-			assert(x >= 0);
-		}
-		else
-		{
-			x += range;
-			assert(x < 0);
-		}
-	}
-	if (x < 0)
-	{
-		x += range;
-		if (x >= 0)
-			return x;
-	}
-	else if (x >= range)
-	{
-		x -= range;
-		if (x < range)
-			return x;
-	}
-	else
-	{
-		// in range
-		return x;
-	}
-	// do it the hard way
-	x %= range;
-	if (x < 0)
-		x += range;
-	return x;
-}
-
-static int getDeltaValue(value_stream *self, uint32_t uval, bool isSubrange)
-{
-	assert((uint32_t)(self->c.isSubrange) == (uint32_t)isSubrange);
-	assert(self->c.isSubrange | self->c.isFullRange);
-	if (isSubrange)
-		return self->sum = self->c.sumInUnsignedRange(self->sum, (int)uval);
-	else
-		return self->sum += (int)uval;
-}
-
-bool value_stream::hasValue()
-{
-	if (rp < rplimit)
-		return true;
-	if (cm == nullptr)
-		return false;
-	if (cm->next == nullptr)
-		return false;
-	cm->next->reset(this);
-	return hasValue();
-}
-
-int value_stream::getInt()
-{
-	if (rp >= rplimit)
-	{
-		// Advance to next coding segment.
-		if (rp > rplimit || cm == nullptr || cm->next == nullptr)
-		{
-			// Must perform this check and throw an exception on bad input.
-			unpack_abort(ERB);
-			return 0;
-		}
-		cm->next->reset(this);
-		return getInt();
-	}
-
-	CODING_PRIVATE(c.spec);
-	uint32_t uval;
-	enum
-	{
-		B5 = 5,
-		B3 = 3,
-		H128 = 128,
-		H64 = 64,
-		H4 = 4
-	};
-	switch (cmk)
-	{
-	case cmk_BHS:
-		assert(D == 0);
-		uval = coding::parse(rp, B, H);
-		if (S == 0)
-			return (int)uval;
-		return decode_sign(S, uval);
-
-	case cmk_BHS0:
-		assert(S == 0 && D == 0);
-		uval = coding::parse(rp, B, H);
-		return (int)uval;
-
-	case cmk_BHS1:
-		assert(S == 1 && D == 0);
-		uval = coding::parse(rp, B, H);
-		return DECODE_SIGN_S1(uval);
-
-	case cmk_BYTE1:
-		assert(c.spec == BYTE1_spec);
-		assert(B == 1 && H == 256 && S == 0 && D == 0);
-		return *rp++ & 0xFF;
-
-	case cmk_CHAR3:
-		assert(c.spec == CHAR3_spec);
-		assert(B == B3 && H == H128 && S == 0 && D == 0);
-		return coding::parse_lgH(rp, B3, H128, 7);
-
-	case cmk_UNSIGNED5:
-		assert(c.spec == UNSIGNED5_spec);
-		assert(B == B5 && H == H64 && S == 0 && D == 0);
-		return coding::parse_lgH(rp, B5, H64, 6);
-
-	case cmk_BHSD1:
-		assert(D == 1);
-		uval = coding::parse(rp, B, H);
-		if (S != 0)
-			uval = (uint32_t)decode_sign(S, uval);
-		return getDeltaValue(this, uval, (bool)c.isSubrange);
-
-	case cmk_BHS1D1full:
-		assert(S == 1 && D == 1 && c.isFullRange);
-		uval = coding::parse(rp, B, H);
-		uval = (uint32_t)DECODE_SIGN_S1(uval);
-		return getDeltaValue(this, uval, false);
-
-	case cmk_BHS1D1sub:
-		assert(S == 1 && D == 1 && c.isSubrange);
-		uval = coding::parse(rp, B, H);
-		uval = (uint32_t)DECODE_SIGN_S1(uval);
-		return getDeltaValue(this, uval, true);
-
-	case cmk_DELTA5:
-		assert(c.spec == DELTA5_spec);
-		assert(B == B5 && H == H64 && S == 1 && D == 1 && c.isFullRange);
-		uval = coding::parse_lgH(rp, B5, H64, 6);
-		sum += DECODE_SIGN_S1(uval);
-		return sum;
-
-	case cmk_BCI5:
-		assert(c.spec == BCI5_spec);
-		assert(B == B5 && H == H4 && S == 0 && D == 0);
-		return coding::parse_lgH(rp, B5, H4, 2);
-
-	case cmk_BRANCH5:
-		assert(c.spec == BRANCH5_spec);
-		assert(B == B5 && H == H4 && S == 2 && D == 0);
-		uval = coding::parse_lgH(rp, B5, H4, 2);
-		return decode_sign(S, uval);
-
-	case cmk_pop:
-		uval = coding::parse(rp, B, H);
-		if (S != 0)
-		{
-			uval = (uint32_t)decode_sign(S, uval);
-		}
-		if (D != 0)
-		{
-			assert(c.isSubrange | c.isFullRange);
-			if (c.isSubrange)
-				sum = c.sumInUnsignedRange(sum, (int)uval);
-			else
-				sum += (int)uval;
-			uval = (uint32_t)sum;
-		}
-		return getPopValue(this, uval);
-
-	case cmk_pop_BHS0:
-		assert(S == 0 && D == 0);
-		uval = coding::parse(rp, B, H);
-		return getPopValue(this, uval);
-
-	case cmk_pop_BYTE1:
-		assert(c.spec == BYTE1_spec);
-		assert(B == 1 && H == 256 && S == 0 && D == 0);
-		return getPopValue(this, *rp++ & 0xFF);
-
-	default:
-		break;
-	}
-	assert(false);
-	return 0;
-}
-
-static int moreCentral(int x, int y)
-{ // used to find end of Pop.{F}
-	// Suggested implementation from the Pack200 specification:
-	uint32_t kx = (x >> 31) ^ (x << 1);
-	uint32_t ky = (y >> 31) ^ (y << 1);
-	return (kx < ky ? x : y);
-}
-// static maybe_inline
-// int moreCentral2(int x, int y, int min) {
-//  // Strict implementation of buggy 150.7 specification.
-//  // The bug is that the spec. says absolute-value ties are broken
-//  // in favor of positive numbers, but the suggested implementation
-//  // (also mentioned in the spec.) breaks ties in favor of negative numbers.
-//  if ((x + y) != 0)
-//    return min;
-//  else
-//    // return the other value, which breaks a tie in the positive direction
-//    return (x > y)? x: y;
-//}
-
-static const byte *no_meta[] = {nullptr};
-#define NO_META (*(byte **)no_meta)
-enum
-{
-	POP_FAVORED_N = -2
-};
-
-// mode bits
-#define DISABLE_RUN 1 // used immediately inside ACodee
-#define DISABLE_POP 2 // used recursively in all pop sub-bands
-
-// This function knows all about meta-coding.
-void coding_method::init(byte *&band_rp, byte *band_limit, byte *&meta_rp, int mode,
-						 coding *defc, int N, intlist *valueSink)
-{
-	assert(N != 0);
-
-	assert(u != nullptr); // must be pre-initialized
-	// if (u == nullptr)  u = unpacker::current();  // expensive
-
-	int op = (meta_rp == nullptr) ? _meta_default : (*meta_rp++ & 0xFF);
-	coding *foundc = nullptr;
-	coding *to_free = nullptr;
-
-	if (op == _meta_default)
-	{
-		foundc = defc;
-		// and fall through
-	}
-	else if (op >= _meta_canon_min && op <= _meta_canon_max)
-	{
-		foundc = coding::findByIndex(op);
-		// and fall through
-	}
-	else if (op == _meta_arb)
-	{
-		int args = (*meta_rp++ & 0xFF);
-		// args = (D:[0..1] + 2*S[0..2] + 8*(B:[1..5]-1))
-		int D = ((args >> 0) & 1);
-		int S = ((args >> 1) & 3);
-		int B = ((args >> 3) & -1) + 1;
-		// & (H[1..256]-1)
-		int H = (*meta_rp++ & 0xFF) + 1;
-		foundc = coding::findBySpec(B, H, S, D);
-		to_free = foundc; // findBySpec may dynamically allocate
-		if (foundc == nullptr)
-		{
-			unpack_abort("illegal arbitrary coding");
-			return;
-		}
-		// and fall through
-	}
-	else if (op >= _meta_run && op < _meta_pop)
-	{
-		int args = (op - _meta_run);
-		// args: KX:[0..3] + 4*(KBFlag:[0..1]) + 8*(ABDef:[0..2])
-		int KX = ((args >> 0) & 3);
-		int KBFlag = ((args >> 2) & 1);
-		int ABDef = ((args >> 3) & -1);
-		assert(ABDef <= 2);
-		// & KB: one of [0..255] if KBFlag=1
-		int KB = (!KBFlag ? 3 : (*meta_rp++ & 0xFF));
-		int K = (KB + 1) << (KX * 4);
-		int N2 = (N >= 0) ? N - K : N;
-		if (N == 0 || (N2 <= 0 && N2 != N))
-		{
-			unpack_abort("illegal run encoding");
-		}
-		if ((mode & DISABLE_RUN) != 0)
-		{
-			unpack_abort("illegal nested run encoding");
-		}
-
-		// & Enc{ ACode } if ADef=0  (ABDef != 1)
-		// No direct nesting of 'run' in ACode, but in BCode it's OK.
-		int disRun = mode | DISABLE_RUN;
-		if (ABDef == 1)
-		{
-			this->init(band_rp, band_limit, NO_META, disRun, defc, K, valueSink);
-		}
-		else
-		{
-			this->init(band_rp, band_limit, meta_rp, disRun, defc, K, valueSink);
-		}
-
-		// & Enc{ BCode } if BDef=0  (ABDef != 2)
-		coding_method *tail = U_NEW(coding_method, 1);
-		if (!tail)
-			return;
-		tail->u = u;
-
-		// The 'run' codings may be nested indirectly via 'pop' codings.
-		// This means that this->next may already be filled in, if
-		// ACode was of type 'pop' with a 'run' token coding.
-		// No problem:  Just chain the upcoming BCode onto the end.
-		for (coding_method *self = this;; self = self->next)
-		{
-			if (self->next == nullptr)
-			{
-				self->next = tail;
-				break;
-			}
-		}
-
-		if (ABDef == 2)
-		{
-			tail->init(band_rp, band_limit, NO_META, mode, defc, N2, valueSink);
-		}
-		else
-		{
-			tail->init(band_rp, band_limit, meta_rp, mode, defc, N2, valueSink);
-		}
-		// Note:  The preceding calls to init should be tail-recursive.
-
-		return; // done; no falling through
-	}
-	else if (op >= _meta_pop && op < _meta_limit)
-	{
-		int args = (op - _meta_pop);
-		// args: (FDef:[0..1]) + 2*UDef:[0..1] + 4*(TDefL:[0..11])
-		int FDef = ((args >> 0) & 1);
-		int UDef = ((args >> 1) & 1);
-		int TDefL = ((args >> 2) & -1);
-		assert(TDefL <= 11);
-		int TDef = (TDefL > 0);
-		int TL = (TDefL <= 6) ? (2 << TDefL) : (256 - (4 << (11 - TDefL)));
-		int TH = (256 - TL);
-		if (N <= 0)
-		{
-			unpack_abort("illegal pop encoding");
-		}
-		if ((mode & DISABLE_POP) != 0)
-		{
-			unpack_abort("illegal nested pop encoding");
-		}
-
-		// No indirect nesting of 'pop', but 'run' is OK.
-		int disPop = DISABLE_POP;
-
-		// & Enc{ FCode } if FDef=0
-		int FN = POP_FAVORED_N;
-		assert(valueSink == nullptr);
-		intlist fValueSink;
-		fValueSink.init();
-		coding_method fval;
-		BYTES_OF(fval).clear();
-		fval.u = u;
-		if (FDef != 0)
-		{
-			fval.init(band_rp, band_limit, NO_META, disPop, defc, FN, &fValueSink);
-		}
-		else
-		{
-			fval.init(band_rp, band_limit, meta_rp, disPop, defc, FN, &fValueSink);
-		}
-		bytes fvbuf;
-		fValues = (u->saveTo(fvbuf, fValueSink.b), (int *)fvbuf.ptr);
-		fVlength = fValueSink.length(); // i.e., the parameter K
-		fValueSink.free();
-
-		// Skip the first {F} run in all subsequent passes.
-		// The next call to this->init(...) will set vs0.rp to point after the {F}.
-
-		// & Enc{ TCode } if TDef=0  (TDefL==0)
-		if (TDef != 0)
-		{
-			coding *tcode = coding::findBySpec(1, 256); // BYTE1
-			// find the most narrowly sufficient code:
-			for (int B = 2; B <= B_MAX; B++)
-			{
-				if (fVlength <= tcode->umax)
-					break; // found it
-				tcode->free();
-				tcode = coding::findBySpec(B, TH);
-				if (!tcode)
-					return;
-			}
-			if (!(fVlength <= tcode->umax))
-			{
-				unpack_abort("pop.L value too small");
-			}
-			this->init(band_rp, band_limit, NO_META, disPop, tcode, N, nullptr);
-			tcode->free();
-		}
-		else
-		{
-			this->init(band_rp, band_limit, meta_rp, disPop, defc, N, nullptr);
-		}
-
-		// Count the number of zero tokens right now.
-		// Also verify that they are in bounds.
-		int UN = 0; // one {U} for each zero in {T}
-		value_stream vs = vs0;
-		for (int i = 0; i < N; i++)
-		{
-			uint32_t val = vs.getInt();
-			if (val == 0)
-				UN += 1;
-			if (!(val <= (uint32_t)fVlength))
-			{
-				unpack_abort("pop token out of range");
-			}
-		}
-		vs.done();
-
-		// & Enc{ UCode } if UDef=0
-		if (UN != 0)
-		{
-			uValues = U_NEW(coding_method, 1);
-			if (uValues == nullptr)
-				return;
-			uValues->u = u;
-			if (UDef != 0)
-			{
-				uValues->init(band_rp, band_limit, NO_META, disPop, defc, UN, nullptr);
-			}
-			else
-			{
-				uValues->init(band_rp, band_limit, meta_rp, disPop, defc, UN, nullptr);
-			}
-		}
-		else
-		{
-			if (UDef == 0)
-			{
-				int uop = (*meta_rp++ & 0xFF);
-				if (uop > _meta_canon_max)
-					// %%% Spec. requires the more strict (uop != _meta_default).
-					unpack_abort("bad meta-coding for empty pop/U");
-			}
-		}
-
-		// Bug fix for 6259542
-		// Last of all, adjust vs0.cmk to the 'pop' flavor
-		for (coding_method *self = this; self != nullptr; self = self->next)
-		{
-			coding_method_kind cmk2 = cmk_pop;
-			switch (self->vs0.cmk)
-			{
-			case cmk_BHS0:
-				cmk2 = cmk_pop_BHS0;
-				break;
-			case cmk_BYTE1:
-				cmk2 = cmk_pop_BYTE1;
-				break;
-			default:
-				break;
-			}
-			self->vs0.cmk = cmk2;
-			if (self != this)
-			{
-				assert(self->fValues == nullptr); // no double init
-				self->fValues = this->fValues;
-				self->fVlength = this->fVlength;
-				assert(self->uValues == nullptr); // must stay nullptr
-			}
-		}
-
-		return; // done; no falling through
-	}
-	else
-	{
-		unpack_abort("bad meta-coding");
-	}
-
-	// Common code here skips a series of values with one coding.
-	assert(foundc != nullptr);
-
-	assert(vs0.cmk == cmk_ERROR);   // no garbage, please
-	assert(vs0.rp == nullptr);	  // no garbage, please
-	assert(vs0.rplimit == nullptr); // no garbage, please
-	assert(vs0.sum == 0);		   // no garbage, please
-
-	vs0.init(band_rp, band_limit, foundc);
-
-	// Done with foundc.  Free if necessary.
-	if (to_free != nullptr)
-	{
-		to_free->free();
-		to_free = nullptr;
-	}
-	foundc = nullptr;
-
-	coding &c = vs0.c;
-	CODING_PRIVATE(c.spec);
-	// assert sane N
-	assert((uint32_t)N < INT_MAX_VALUE || N == POP_FAVORED_N);
-
-	// Look at the values, or at least skip over them quickly.
-	if (valueSink == nullptr)
-	{
-		// Skip and ignore values in the first pass.
-		c.parseMultiple(band_rp, N, band_limit, B, H);
-	}
-	else if (N >= 0)
-	{
-		// Pop coding, {F} sequence, initial run of values...
-		assert((mode & DISABLE_POP) != 0);
-		value_stream vs = vs0;
-		for (int n = 0; n < N; n++)
-		{
-			int val = vs.getInt();
-			valueSink->add(val);
-		}
-		band_rp = vs.rp;
-	}
-	else
-	{
-		// Pop coding, {F} sequence, final run of values...
-		assert((mode & DISABLE_POP) != 0);
-		assert(N == POP_FAVORED_N);
-		int min = INT_MIN_VALUE; // farthest from the center
-		// min2 is based on the buggy specification of centrality in version 150.7
-		// no known implementations transmit this value, but just in case...
-		// int min2 = INT_MIN_VALUE;
-		int last = 0;
-		// if there were initial runs, find the potential sentinels in them:
-		for (int i = 0; i < valueSink->length(); i++)
-		{
-			last = valueSink->get(i);
-			min = moreCentral(min, last);
-			// min2 = moreCentral2(min2, last, min);
-		}
-		value_stream vs = vs0;
-		for (;;)
-		{
-			int val = vs.getInt();
-			if (valueSink->length() > 0 && (val == last || val == min)) //|| val == min2
-				break;
-			valueSink->add(val);
-			last = val;
-			min = moreCentral(min, last);
-			// min2 = moreCentral2(min2, last, min);
-		}
-		band_rp = vs.rp;
-	}
-
-	// Get an accurate upper limit now.
-	vs0.rplimit = band_rp;
-	vs0.cm = this;
-
-	return; // success
-}
-
-coding basic_codings[] = {
-	// This one is not a usable irregular coding, but is used by cp_Utf8_chars.
-	CODING_INIT(3, 128, 0, 0),
-
-	// Fixed-length codings:
-	CODING_INIT(1, 256, 0, 0), CODING_INIT(1, 256, 1, 0), CODING_INIT(1, 256, 0, 1),
-	CODING_INIT(1, 256, 1, 1), CODING_INIT(2, 256, 0, 0), CODING_INIT(2, 256, 1, 0),
-	CODING_INIT(2, 256, 0, 1), CODING_INIT(2, 256, 1, 1), CODING_INIT(3, 256, 0, 0),
-	CODING_INIT(3, 256, 1, 0), CODING_INIT(3, 256, 0, 1), CODING_INIT(3, 256, 1, 1),
-	CODING_INIT(4, 256, 0, 0), CODING_INIT(4, 256, 1, 0), CODING_INIT(4, 256, 0, 1),
-	CODING_INIT(4, 256, 1, 1),
-
-	// Full-range variable-length codings:
-	CODING_INIT(5, 4, 0, 0),   CODING_INIT(5, 4, 1, 0),   CODING_INIT(5, 4, 2, 0),
-	CODING_INIT(5, 16, 0, 0),  CODING_INIT(5, 16, 1, 0),  CODING_INIT(5, 16, 2, 0),
-	CODING_INIT(5, 32, 0, 0),  CODING_INIT(5, 32, 1, 0),  CODING_INIT(5, 32, 2, 0),
-	CODING_INIT(5, 64, 0, 0),  CODING_INIT(5, 64, 1, 0),  CODING_INIT(5, 64, 2, 0),
-	CODING_INIT(5, 128, 0, 0), CODING_INIT(5, 128, 1, 0), CODING_INIT(5, 128, 2, 0),
-	CODING_INIT(5, 4, 0, 1),   CODING_INIT(5, 4, 1, 1),   CODING_INIT(5, 4, 2, 1),
-	CODING_INIT(5, 16, 0, 1),  CODING_INIT(5, 16, 1, 1),  CODING_INIT(5, 16, 2, 1),
-	CODING_INIT(5, 32, 0, 1),  CODING_INIT(5, 32, 1, 1),  CODING_INIT(5, 32, 2, 1),
-	CODING_INIT(5, 64, 0, 1),  CODING_INIT(5, 64, 1, 1),  CODING_INIT(5, 64, 2, 1),
-	CODING_INIT(5, 128, 0, 1), CODING_INIT(5, 128, 1, 1), CODING_INIT(5, 128, 2, 1),
-
-	// Variable length subrange codings:
-	CODING_INIT(2, 192, 0, 0), CODING_INIT(2, 224, 0, 0), CODING_INIT(2, 240, 0, 0),
-	CODING_INIT(2, 248, 0, 0), CODING_INIT(2, 252, 0, 0), CODING_INIT(2, 8, 0, 1),
-	CODING_INIT(2, 8, 1, 1),   CODING_INIT(2, 16, 0, 1),  CODING_INIT(2, 16, 1, 1),
-	CODING_INIT(2, 32, 0, 1),  CODING_INIT(2, 32, 1, 1),  CODING_INIT(2, 64, 0, 1),
-	CODING_INIT(2, 64, 1, 1),  CODING_INIT(2, 128, 0, 1), CODING_INIT(2, 128, 1, 1),
-	CODING_INIT(2, 192, 0, 1), CODING_INIT(2, 192, 1, 1), CODING_INIT(2, 224, 0, 1),
-	CODING_INIT(2, 224, 1, 1), CODING_INIT(2, 240, 0, 1), CODING_INIT(2, 240, 1, 1),
-	CODING_INIT(2, 248, 0, 1), CODING_INIT(2, 248, 1, 1), CODING_INIT(3, 192, 0, 0),
-	CODING_INIT(3, 224, 0, 0), CODING_INIT(3, 240, 0, 0), CODING_INIT(3, 248, 0, 0),
-	CODING_INIT(3, 252, 0, 0), CODING_INIT(3, 8, 0, 1),   CODING_INIT(3, 8, 1, 1),
-	CODING_INIT(3, 16, 0, 1),  CODING_INIT(3, 16, 1, 1),  CODING_INIT(3, 32, 0, 1),
-	CODING_INIT(3, 32, 1, 1),  CODING_INIT(3, 64, 0, 1),  CODING_INIT(3, 64, 1, 1),
-	CODING_INIT(3, 128, 0, 1), CODING_INIT(3, 128, 1, 1), CODING_INIT(3, 192, 0, 1),
-	CODING_INIT(3, 192, 1, 1), CODING_INIT(3, 224, 0, 1), CODING_INIT(3, 224, 1, 1),
-	CODING_INIT(3, 240, 0, 1), CODING_INIT(3, 240, 1, 1), CODING_INIT(3, 248, 0, 1),
-	CODING_INIT(3, 248, 1, 1), CODING_INIT(4, 192, 0, 0), CODING_INIT(4, 224, 0, 0),
-	CODING_INIT(4, 240, 0, 0), CODING_INIT(4, 248, 0, 0), CODING_INIT(4, 252, 0, 0),
-	CODING_INIT(4, 8, 0, 1),   CODING_INIT(4, 8, 1, 1),   CODING_INIT(4, 16, 0, 1),
-	CODING_INIT(4, 16, 1, 1),  CODING_INIT(4, 32, 0, 1),  CODING_INIT(4, 32, 1, 1),
-	CODING_INIT(4, 64, 0, 1),  CODING_INIT(4, 64, 1, 1),  CODING_INIT(4, 128, 0, 1),
-	CODING_INIT(4, 128, 1, 1), CODING_INIT(4, 192, 0, 1), CODING_INIT(4, 192, 1, 1),
-	CODING_INIT(4, 224, 0, 1), CODING_INIT(4, 224, 1, 1), CODING_INIT(4, 240, 0, 1),
-	CODING_INIT(4, 240, 1, 1), CODING_INIT(4, 248, 0, 1), CODING_INIT(4, 248, 1, 1),
-	CODING_INIT(0, 0, 0, 0)};
-#define BASIC_INDEX_LIMIT (int)(sizeof(basic_codings) / sizeof(basic_codings[0]) - 1)
-
-coding *coding::findByIndex(int idx)
-{
-	int index_limit = BASIC_INDEX_LIMIT;
-	assert(_meta_canon_min == 1 && _meta_canon_max + 1 == index_limit);
-
-	if (idx >= _meta_canon_min && idx <= _meta_canon_max)
-		return basic_codings[idx].init();
-	else
-		return nullptr;
-}
diff --git a/depends/pack200/src/coding.h b/depends/pack200/src/coding.h
deleted file mode 100644
index f9bd6ca2..00000000
--- a/depends/pack200/src/coding.h
+++ /dev/null
@@ -1,247 +0,0 @@
-/*
- * Copyright (c) 2002, 2008, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-struct unpacker;
-
-#define INT_MAX_VALUE ((int)0x7FFFFFFF)
-#define INT_MIN_VALUE ((int)0x80000000)
-
-#define CODING_SPEC(B, H, S, D) ((B) << 20 | (H) << 8 | (S) << 4 | (D) << 0)
-#define CODING_B(x) ((x) >> 20 & 0xF)
-#define CODING_H(x) ((x) >> 8 & 0xFFF)
-#define CODING_S(x) ((x) >> 4 & 0xF)
-#define CODING_D(x) ((x) >> 0 & 0xF)
-
-#define CODING_INIT(B, H, S, D)                                                                \
-	{                                                                                          \
-		CODING_SPEC(B, H, S, D), 0, 0, 0, 0, 0, 0, 0, 0                                        \
-	}
-
-// For debugging purposes, some compilers do not like this and will complain.
-//    #define long do_not_use_C_long_types_use_jlong_or_int
-// Use of the type "long" is problematic, do not use it.
-
-struct coding
-{
-	int spec; // B,H,S,D
-
-	// Handy values derived from the spec:
-	int B()
-	{
-		return CODING_B(spec);
-	}
-	int H()
-	{
-		return CODING_H(spec);
-	}
-	int S()
-	{
-		return CODING_S(spec);
-	}
-	int D()
-	{
-		return CODING_D(spec);
-	}
-	int L()
-	{
-		return 256 - CODING_H(spec);
-	}
-	int min, max;
-	int umin, umax;
-	char isSigned, isSubrange, isFullRange, isMalloc;
-
-	coding *init(); // returns self or nullptr if error
-	coding *initFrom(int spec_)
-	{
-		assert(this->spec == 0);
-		this->spec = spec_;
-		return init();
-	}
-
-	static coding *findBySpec(int spec);
-	static coding *findBySpec(int B, int H, int S = 0, int D = 0);
-	static coding *findByIndex(int irregularCodingIndex);
-
-	static uint32_t parse(byte *&rp, int B, int H);
-	static uint32_t parse_lgH(byte *&rp, int B, int H, int lgH);
-	static void parseMultiple(byte *&rp, int N, byte *limit, int B, int H);
-
-	uint32_t parse(byte *&rp)
-	{
-		return parse(rp, CODING_B(spec), CODING_H(spec));
-	}
-	void parseMultiple(byte *&rp, int N, byte *limit)
-	{
-		parseMultiple(rp, N, limit, CODING_B(spec), CODING_H(spec));
-	}
-
-	bool canRepresent(int x)
-	{
-		return (x >= min && x <= max);
-	}
-	bool canRepresentUnsigned(int x)
-	{
-		return (x >= umin && x <= umax);
-	}
-
-	int sumInUnsignedRange(int x, int y);
-
-	int readFrom(byte *&rpVar, int *dbase);
-	void readArrayFrom(byte *&rpVar, int *dbase, int length, int *values);
-	void skipArrayFrom(byte *&rpVar, int length)
-	{
-		readArrayFrom(rpVar, (int *)NULL, length, (int *)NULL);
-	}
-
-	void free(); // free self if isMalloc
-};
-
-enum coding_method_kind
-{
-	cmk_ERROR,
-	cmk_BHS,
-	cmk_BHS0,
-	cmk_BHS1,
-	cmk_BHSD1,
-	cmk_BHS1D1full, // isFullRange
-	cmk_BHS1D1sub,  // isSubRange
-
-	// special cases hand-optimized (~50% of all decoded values)
-	cmk_BYTE1,	 //(1,256)      6%
-	cmk_CHAR3,	 //(3,128)      7%
-	cmk_UNSIGNED5, //(5,64)      13%
-	cmk_DELTA5,	//(5,64,1,1)   5%
-	cmk_BCI5,	  //(5,4)       18%
-	cmk_BRANCH5,   //(5,4,2)      4%
-				   // cmk_UNSIGNED5H16,  //(5,16)       5%
-				   // cmk_UNSIGNED2H4,   //(2,4)        6%
-				   // cmk_DELTA4H8,      //(4,8,1,1)   10%
-	// cmk_DELTA3H16,     //(3,16,1,1)   9%
-	cmk_BHS_LIMIT,
-	cmk_pop,
-	cmk_pop_BHS0,
-	cmk_pop_BYTE1,
-	cmk_pop_LIMIT,
-	cmk_LIMIT
-};
-
-enum
-{
-	BYTE1_spec = CODING_SPEC(1, 256, 0, 0),
-	CHAR3_spec = CODING_SPEC(3, 128, 0, 0),
-	UNSIGNED4_spec = CODING_SPEC(4, 256, 0, 0),
-	UNSIGNED5_spec = CODING_SPEC(5, 64, 0, 0),
-	SIGNED5_spec = CODING_SPEC(5, 64, 1, 0),
-	DELTA5_spec = CODING_SPEC(5, 64, 1, 1),
-	UDELTA5_spec = CODING_SPEC(5, 64, 0, 1),
-	MDELTA5_spec = CODING_SPEC(5, 64, 2, 1),
-	BCI5_spec = CODING_SPEC(5, 4, 0, 0),
-	BRANCH5_spec = CODING_SPEC(5, 4, 2, 0)
-};
-
-enum
-{
-	B_MAX = 5,
-	C_SLOP = B_MAX * 10
-};
-
-struct coding_method;
-
-// iterator under the control of a meta-coding
-struct value_stream
-{
-	// current coding of values or values
-	coding c;			   // B,H,S,D,etc.
-	coding_method_kind cmk; // type of decoding needed
-	byte *rp;			   // read pointer
-	byte *rplimit;		  // final value of read pointer
-	int sum;				// partial sum of all values so far (D=1 only)
-	coding_method *cm;	  // coding method that defines this stream
-
-	void init(byte *band_rp, byte *band_limit, coding *defc);
-	void init(byte *band_rp, byte *band_limit, int spec)
-	{
-		init(band_rp, band_limit, coding::findBySpec(spec));
-	}
-
-	void setCoding(coding *c);
-	void setCoding(int spec)
-	{
-		setCoding(coding::findBySpec(spec));
-	}
-
-	// Parse and decode a single value.
-	int getInt();
-
-	// Parse and decode a single byte, with no error checks.
-	int getByte()
-	{
-		assert(cmk == cmk_BYTE1);
-		assert(rp < rplimit);
-		return *rp++ & 0xFF;
-	}
-
-	// Used only for asserts.
-	bool hasValue();
-
-	void done()
-	{
-		assert(!hasValue());
-	}
-
-	// Sometimes a value stream has an auxiliary (but there are never two).
-	value_stream *helper()
-	{
-		assert(hasHelper());
-		return this + 1;
-	}
-	bool hasHelper();
-};
-
-struct coding_method
-{
-	value_stream vs0; // initial state snapshot (vs.meta==this)
-
-	coding_method *next; // what to do when we run out of bytes
-
-	// these fields are used for pop codes only:
-	int *fValues;		   // favored value array
-	int fVlength;		   // maximum favored value token
-	coding_method *uValues; // unfavored value stream
-
-	// pointer to outer unpacker, for error checks etc.
-	unpacker *u;
-
-	// Initialize a value stream.
-	void reset(value_stream *state);
-
-	// Parse a band header, size a band, and initialize for further action.
-	// band_rp advances (but not past band_limit), and meta_rp advances.
-	// The mode gives context, such as "inside a pop".
-	// The defc and N are the incoming parameters to a meta-coding.
-	// The value sink is used to collect output values, when desired.
-	void init(byte *&band_rp, byte *band_limit, byte *&meta_rp, int mode, coding *defc, int N,
-			  intlist *valueSink);
-};
diff --git a/depends/pack200/src/constants.h b/depends/pack200/src/constants.h
deleted file mode 100644
index 2cc14b7d..00000000
--- a/depends/pack200/src/constants.h
+++ /dev/null
@@ -1,442 +0,0 @@
-/*
- * Copyright (c) 2001, 2005, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/*
-  Java Class Version numbers history
-  1.0 to 1.3.X 45,3
-  1.4 to 1.4.X 46,0
-  1.5 to 1.5.X 49,0
-  1.6 to 1.5.x 50,0 NOTE Assumed for now
-*/
-
-// classfile constants
-#define JAVA_MAGIC 0xCAFEBABE
-#define JAVA_MIN_MAJOR_VERSION 45
-#define JAVA_MIN_MINOR_VERSION 3
-#define JAVA5_MAX_MAJOR_VERSION 49
-#define JAVA5_MAX_MINOR_VERSION 0
-// NOTE: Assume for now
-#define JAVA6_MAX_MAJOR_VERSION 50
-#define JAVA6_MAX_MINOR_VERSION 0
-
-// package file constants
-#define JAVA_PACKAGE_MAGIC 0xCAFED00D
-#define JAVA5_PACKAGE_MAJOR_VERSION 150
-#define JAVA5_PACKAGE_MINOR_VERSION 7
-
-#define JAVA6_PACKAGE_MAJOR_VERSION 160
-#define JAVA6_PACKAGE_MINOR_VERSION 1
-
-// magic number for gzip streams (for processing pack200-gzip data)
-#define GZIP_MAGIC 0x1F8B0800
-#define GZIP_MAGIC_MASK 0xFFFFFF00 // last \bchar\b is variable "flg" field
-
-enum
-{
-	CONSTANT_None,
-	CONSTANT_Utf8,
-	CONSTANT_unused2, /* unused, was Unicode */
-	CONSTANT_Integer,
-	CONSTANT_Float,
-	CONSTANT_Long,
-	CONSTANT_Double,
-	CONSTANT_Class,
-	CONSTANT_String,
-	CONSTANT_Fieldref,
-	CONSTANT_Methodref,
-	CONSTANT_InterfaceMethodref,
-	CONSTANT_NameandType,
-	CONSTANT_Signature = 13,
-	CONSTANT_All = 14,
-	CONSTANT_Limit = 15,
-	CONSTANT_NONE = 0,
-	CONSTANT_Literal = 20, // pseudo-tag for debugging
-	CONSTANT_Member = 21,  // pseudo-tag for debugging
-	SUBINDEX_BIT = 64,	 // combined with CONSTANT_xxx for ixTag
-	ACC_STATIC = 0x0008,
-	ACC_IC_LONG_FORM = (1 << 16), // for ic_flags
-	CLASS_ATTR_SourceFile = 17,
-	CLASS_ATTR_EnclosingMethod = 18,
-	CLASS_ATTR_InnerClasses = 23,
-	CLASS_ATTR_ClassFile_version = 24,
-	FIELD_ATTR_ConstantValue = 17,
-	METHOD_ATTR_Code = 17,
-	METHOD_ATTR_Exceptions = 18,
-	METHOD_ATTR_RuntimeVisibleParameterAnnotations = 23,
-	METHOD_ATTR_RuntimeInvisibleParameterAnnotations = 24,
-	METHOD_ATTR_AnnotationDefault = 25,
-	CODE_ATTR_StackMapTable = 0,
-	CODE_ATTR_LineNumberTable = 1,
-	CODE_ATTR_LocalVariableTable = 2,
-	CODE_ATTR_LocalVariableTypeTable = 3,
-	// X_ATTR_Synthetic = 12,  // ACC_SYNTHETIC; not predefined
-	X_ATTR_Signature = 19,
-	X_ATTR_Deprecated = 20,
-	X_ATTR_RuntimeVisibleAnnotations = 21,
-	X_ATTR_RuntimeInvisibleAnnotations = 22,
-	X_ATTR_OVERFLOW = 16,
-	X_ATTR_LIMIT_NO_FLAGS_HI = 32,
-	X_ATTR_LIMIT_FLAGS_HI = 63,
-
-#define O_ATTR_DO(F)                                                                           \
-	F(X_ATTR_OVERFLOW, 01)                                                                     \
-		/*(end)*/
-#define X_ATTR_DO(F)                                                                           \
-	O_ATTR_DO(F) F(X_ATTR_Signature, Signature) F(X_ATTR_Deprecated, Deprecated)               \
-		F(X_ATTR_RuntimeVisibleAnnotations, RuntimeVisibleAnnotations)                         \
-		F(X_ATTR_RuntimeInvisibleAnnotations, RuntimeInvisibleAnnotations)                     \
-		/*F(X_ATTR_Synthetic,Synthetic)*/                                                      \
-		/*(end)*/
-#define CLASS_ATTR_DO(F)                                                                       \
-	F(CLASS_ATTR_SourceFile, SourceFile) F(CLASS_ATTR_InnerClasses, InnerClasses)              \
-		F(CLASS_ATTR_EnclosingMethod, EnclosingMethod) F(CLASS_ATTR_ClassFile_version, 02)     \
-		/*(end)*/
-#define FIELD_ATTR_DO(F)                                                                       \
-	F(FIELD_ATTR_ConstantValue, ConstantValue)                                                 \
-		/*(end)*/
-#define METHOD_ATTR_DO(F)                                                                      \
-	F(METHOD_ATTR_Code, Code) F(METHOD_ATTR_Exceptions, Exceptions)                            \
-		F(METHOD_ATTR_RuntimeVisibleParameterAnnotations, RuntimeVisibleParameterAnnotations)  \
-		F(METHOD_ATTR_RuntimeInvisibleParameterAnnotations,                                    \
-		  RuntimeInvisibleParameterAnnotations)                                                \
-		F(METHOD_ATTR_AnnotationDefault, AnnotationDefault)                                    \
-		/*(end)*/
-#define CODE_ATTR_DO(F)                                                                        \
-	F(CODE_ATTR_StackMapTable, StackMapTable) F(CODE_ATTR_LineNumberTable, LineNumberTable)    \
-		F(CODE_ATTR_LocalVariableTable, LocalVariableTable)                                    \
-		F(CODE_ATTR_LocalVariableTypeTable, LocalVariableTypeTable)                            \
-		/*(end)*/
-#define ALL_ATTR_DO(F)                                                                         \
-	X_ATTR_DO(F) CLASS_ATTR_DO(F) FIELD_ATTR_DO(F) METHOD_ATTR_DO(F) CODE_ATTR_DO(F)           \
-		/*(end)*/
-
-	// attribute "context types"
-	ATTR_CONTEXT_CLASS = 0,
-	ATTR_CONTEXT_FIELD = 1,
-	ATTR_CONTEXT_METHOD = 2,
-	ATTR_CONTEXT_CODE = 3,
-	ATTR_CONTEXT_LIMIT = 4,
-
-	// constants for parsed layouts (stored in band::le_kind)
-	EK_NONE = 0,   // not a layout element
-	EK_INT = 'I',  // B H I SH etc., also FH etc.
-	EK_BCI = 'P',  // PH etc.
-	EK_BCID = 'Q', // POH etc.
-	EK_BCO = 'O',  // OH etc.
-	EK_REPL = 'N', // NH[...] etc.
-	EK_REF = 'R',  // RUH, RUNH, KQH, etc.
-	EK_UN = 'T',   // TB(...)[...] etc.
-	EK_CASE = 'K', // (...)[...] etc.
-	EK_CALL = '(', // (0), (1), etc.
-	EK_CBLE = '[', // [...][...] etc.
-	NO_BAND_INDEX = -1,
-
-	// File option bits, from LSB in ascending bit position.
-	FO_DEFLATE_HINT = 1 << 0,
-	FO_IS_CLASS_STUB = 1 << 1,
-
-	// Archive option bits, from LSB in ascending bit position:
-	AO_HAVE_SPECIAL_FORMATS = 1 << 0,
-	AO_HAVE_CP_NUMBERS = 1 << 1,
-	AO_HAVE_ALL_CODE_FLAGS = 1 << 2,
-	AO_3_UNUSED_MBZ = 1 << 3,
-	AO_HAVE_FILE_HEADERS = 1 << 4,
-	AO_DEFLATE_HINT = 1 << 5,
-	AO_HAVE_FILE_MODTIME = 1 << 6,
-	AO_HAVE_FILE_OPTIONS = 1 << 7,
-	AO_HAVE_FILE_SIZE_HI = 1 << 8,
-	AO_HAVE_CLASS_FLAGS_HI = 1 << 9,
-	AO_HAVE_FIELD_FLAGS_HI = 1 << 10,
-	AO_HAVE_METHOD_FLAGS_HI = 1 << 11,
-	AO_HAVE_CODE_FLAGS_HI = 1 << 12,
-#define ARCHIVE_BIT_DO(F)                                                                      \
-	F(AO_HAVE_SPECIAL_FORMATS) F(AO_HAVE_CP_NUMBERS) F(AO_HAVE_ALL_CODE_FLAGS)                 \
-		/*F(AO_3_UNUSED_MBZ)*/                                                                 \
-		F(AO_HAVE_FILE_HEADERS) F(AO_DEFLATE_HINT) F(AO_HAVE_FILE_MODTIME)                     \
-		F(AO_HAVE_FILE_OPTIONS) F(AO_HAVE_FILE_SIZE_HI) F(AO_HAVE_CLASS_FLAGS_HI)              \
-		F(AO_HAVE_FIELD_FLAGS_HI) F(AO_HAVE_METHOD_FLAGS_HI) F(AO_HAVE_CODE_FLAGS_HI)          \
-		/*(end)*/
-
-	// Constants for decoding attribute definition header bytes.
-	ADH_CONTEXT_MASK = 0x3, // (hdr & ADH_CONTEXT_MASK)
-	ADH_BIT_SHIFT = 0x2,	// (hdr >> ADH_BIT_SHIFT)
-	ADH_BIT_IS_LSB = 1,	 // (hdr >> ADH_BIT_SHIFT) - ADH_BIT_IS_LSB
-#define ADH_BYTE(context, index) ((((index) + ADH_BIT_IS_LSB) << ADH_BIT_SHIFT) + (context))
-#define ADH_BYTE_CONTEXT(adhb) ((adhb) & ADH_CONTEXT_MASK)
-#define ADH_BYTE_INDEX(adhb) (((adhb) >> ADH_BIT_SHIFT) - ADH_BIT_IS_LSB)
-	NO_MODTIME = 0, // nullptr modtime value
-
-	// meta-coding
-	_meta_default = 0,
-	_meta_canon_min = 1,
-	_meta_canon_max = 115,
-	_meta_arb = 116,
-	_meta_run = 117,
-	_meta_pop = 141,
-	_meta_limit = 189,
-	_meta_error = 255,
-	_xxx_1_end
-};
-
-// Bytecodes.
-
-enum
-{
-	bc_nop = 0,			   // 0x00
-	bc_aconst_null = 1,	   // 0x01
-	bc_iconst_m1 = 2,		 // 0x02
-	bc_iconst_0 = 3,		  // 0x03
-	bc_iconst_1 = 4,		  // 0x04
-	bc_iconst_2 = 5,		  // 0x05
-	bc_iconst_3 = 6,		  // 0x06
-	bc_iconst_4 = 7,		  // 0x07
-	bc_iconst_5 = 8,		  // 0x08
-	bc_lconst_0 = 9,		  // 0x09
-	bc_lconst_1 = 10,		 // 0x0a
-	bc_fconst_0 = 11,		 // 0x0b
-	bc_fconst_1 = 12,		 // 0x0c
-	bc_fconst_2 = 13,		 // 0x0d
-	bc_dconst_0 = 14,		 // 0x0e
-	bc_dconst_1 = 15,		 // 0x0f
-	bc_bipush = 16,		   // 0x10
-	bc_sipush = 17,		   // 0x11
-	bc_ldc = 18,			  // 0x12
-	bc_ldc_w = 19,			// 0x13
-	bc_ldc2_w = 20,		   // 0x14
-	bc_iload = 21,			// 0x15
-	bc_lload = 22,			// 0x16
-	bc_fload = 23,			// 0x17
-	bc_dload = 24,			// 0x18
-	bc_aload = 25,			// 0x19
-	bc_iload_0 = 26,		  // 0x1a
-	bc_iload_1 = 27,		  // 0x1b
-	bc_iload_2 = 28,		  // 0x1c
-	bc_iload_3 = 29,		  // 0x1d
-	bc_lload_0 = 30,		  // 0x1e
-	bc_lload_1 = 31,		  // 0x1f
-	bc_lload_2 = 32,		  // 0x20
-	bc_lload_3 = 33,		  // 0x21
-	bc_fload_0 = 34,		  // 0x22
-	bc_fload_1 = 35,		  // 0x23
-	bc_fload_2 = 36,		  // 0x24
-	bc_fload_3 = 37,		  // 0x25
-	bc_dload_0 = 38,		  // 0x26
-	bc_dload_1 = 39,		  // 0x27
-	bc_dload_2 = 40,		  // 0x28
-	bc_dload_3 = 41,		  // 0x29
-	bc_aload_0 = 42,		  // 0x2a
-	bc_aload_1 = 43,		  // 0x2b
-	bc_aload_2 = 44,		  // 0x2c
-	bc_aload_3 = 45,		  // 0x2d
-	bc_iaload = 46,		   // 0x2e
-	bc_laload = 47,		   // 0x2f
-	bc_faload = 48,		   // 0x30
-	bc_daload = 49,		   // 0x31
-	bc_aaload = 50,		   // 0x32
-	bc_baload = 51,		   // 0x33
-	bc_caload = 52,		   // 0x34
-	bc_saload = 53,		   // 0x35
-	bc_istore = 54,		   // 0x36
-	bc_lstore = 55,		   // 0x37
-	bc_fstore = 56,		   // 0x38
-	bc_dstore = 57,		   // 0x39
-	bc_astore = 58,		   // 0x3a
-	bc_istore_0 = 59,		 // 0x3b
-	bc_istore_1 = 60,		 // 0x3c
-	bc_istore_2 = 61,		 // 0x3d
-	bc_istore_3 = 62,		 // 0x3e
-	bc_lstore_0 = 63,		 // 0x3f
-	bc_lstore_1 = 64,		 // 0x40
-	bc_lstore_2 = 65,		 // 0x41
-	bc_lstore_3 = 66,		 // 0x42
-	bc_fstore_0 = 67,		 // 0x43
-	bc_fstore_1 = 68,		 // 0x44
-	bc_fstore_2 = 69,		 // 0x45
-	bc_fstore_3 = 70,		 // 0x46
-	bc_dstore_0 = 71,		 // 0x47
-	bc_dstore_1 = 72,		 // 0x48
-	bc_dstore_2 = 73,		 // 0x49
-	bc_dstore_3 = 74,		 // 0x4a
-	bc_astore_0 = 75,		 // 0x4b
-	bc_astore_1 = 76,		 // 0x4c
-	bc_astore_2 = 77,		 // 0x4d
-	bc_astore_3 = 78,		 // 0x4e
-	bc_iastore = 79,		  // 0x4f
-	bc_lastore = 80,		  // 0x50
-	bc_fastore = 81,		  // 0x51
-	bc_dastore = 82,		  // 0x52
-	bc_aastore = 83,		  // 0x53
-	bc_bastore = 84,		  // 0x54
-	bc_castore = 85,		  // 0x55
-	bc_sastore = 86,		  // 0x56
-	bc_pop = 87,			  // 0x57
-	bc_pop2 = 88,			 // 0x58
-	bc_dup = 89,			  // 0x59
-	bc_dup_x1 = 90,		   // 0x5a
-	bc_dup_x2 = 91,		   // 0x5b
-	bc_dup2 = 92,			 // 0x5c
-	bc_dup2_x1 = 93,		  // 0x5d
-	bc_dup2_x2 = 94,		  // 0x5e
-	bc_swap = 95,			 // 0x5f
-	bc_iadd = 96,			 // 0x60
-	bc_ladd = 97,			 // 0x61
-	bc_fadd = 98,			 // 0x62
-	bc_dadd = 99,			 // 0x63
-	bc_isub = 100,			// 0x64
-	bc_lsub = 101,			// 0x65
-	bc_fsub = 102,			// 0x66
-	bc_dsub = 103,			// 0x67
-	bc_imul = 104,			// 0x68
-	bc_lmul = 105,			// 0x69
-	bc_fmul = 106,			// 0x6a
-	bc_dmul = 107,			// 0x6b
-	bc_idiv = 108,			// 0x6c
-	bc_ldiv = 109,			// 0x6d
-	bc_fdiv = 110,			// 0x6e
-	bc_ddiv = 111,			// 0x6f
-	bc_irem = 112,			// 0x70
-	bc_lrem = 113,			// 0x71
-	bc_frem = 114,			// 0x72
-	bc_drem = 115,			// 0x73
-	bc_ineg = 116,			// 0x74
-	bc_lneg = 117,			// 0x75
-	bc_fneg = 118,			// 0x76
-	bc_dneg = 119,			// 0x77
-	bc_ishl = 120,			// 0x78
-	bc_lshl = 121,			// 0x79
-	bc_ishr = 122,			// 0x7a
-	bc_lshr = 123,			// 0x7b
-	bc_iushr = 124,		   // 0x7c
-	bc_lushr = 125,		   // 0x7d
-	bc_iand = 126,			// 0x7e
-	bc_land = 127,			// 0x7f
-	bc_ior = 128,			 // 0x80
-	bc_lor = 129,			 // 0x81
-	bc_ixor = 130,			// 0x82
-	bc_lxor = 131,			// 0x83
-	bc_iinc = 132,			// 0x84
-	bc_i2l = 133,			 // 0x85
-	bc_i2f = 134,			 // 0x86
-	bc_i2d = 135,			 // 0x87
-	bc_l2i = 136,			 // 0x88
-	bc_l2f = 137,			 // 0x89
-	bc_l2d = 138,			 // 0x8a
-	bc_f2i = 139,			 // 0x8b
-	bc_f2l = 140,			 // 0x8c
-	bc_f2d = 141,			 // 0x8d
-	bc_d2i = 142,			 // 0x8e
-	bc_d2l = 143,			 // 0x8f
-	bc_d2f = 144,			 // 0x90
-	bc_i2b = 145,			 // 0x91
-	bc_i2c = 146,			 // 0x92
-	bc_i2s = 147,			 // 0x93
-	bc_lcmp = 148,			// 0x94
-	bc_fcmpl = 149,		   // 0x95
-	bc_fcmpg = 150,		   // 0x96
-	bc_dcmpl = 151,		   // 0x97
-	bc_dcmpg = 152,		   // 0x98
-	bc_ifeq = 153,			// 0x99
-	bc_ifne = 154,			// 0x9a
-	bc_iflt = 155,			// 0x9b
-	bc_ifge = 156,			// 0x9c
-	bc_ifgt = 157,			// 0x9d
-	bc_ifle = 158,			// 0x9e
-	bc_if_icmpeq = 159,	   // 0x9f
-	bc_if_icmpne = 160,	   // 0xa0
-	bc_if_icmplt = 161,	   // 0xa1
-	bc_if_icmpge = 162,	   // 0xa2
-	bc_if_icmpgt = 163,	   // 0xa3
-	bc_if_icmple = 164,	   // 0xa4
-	bc_if_acmpeq = 165,	   // 0xa5
-	bc_if_acmpne = 166,	   // 0xa6
-	bc_goto = 167,			// 0xa7
-	bc_jsr = 168,			 // 0xa8
-	bc_ret = 169,			 // 0xa9
-	bc_tableswitch = 170,	 // 0xaa
-	bc_lookupswitch = 171,	// 0xab
-	bc_ireturn = 172,		 // 0xac
-	bc_lreturn = 173,		 // 0xad
-	bc_freturn = 174,		 // 0xae
-	bc_dreturn = 175,		 // 0xaf
-	bc_areturn = 176,		 // 0xb0
-	bc_return = 177,		  // 0xb1
-	bc_getstatic = 178,	   // 0xb2
-	bc_putstatic = 179,	   // 0xb3
-	bc_getfield = 180,		// 0xb4
-	bc_putfield = 181,		// 0xb5
-	bc_invokevirtual = 182,   // 0xb6
-	bc_invokespecial = 183,   // 0xb7
-	bc_invokestatic = 184,	// 0xb8
-	bc_invokeinterface = 185, // 0xb9
-	bc_xxxunusedxxx = 186,	// 0xba
-	bc_new = 187,			 // 0xbb
-	bc_newarray = 188,		// 0xbc
-	bc_anewarray = 189,	   // 0xbd
-	bc_arraylength = 190,	 // 0xbe
-	bc_athrow = 191,		  // 0xbf
-	bc_checkcast = 192,	   // 0xc0
-	bc_instanceof = 193,	  // 0xc1
-	bc_monitorenter = 194,	// 0xc2
-	bc_monitorexit = 195,	 // 0xc3
-	bc_wide = 196,			// 0xc4
-	bc_multianewarray = 197,  // 0xc5
-	bc_ifnull = 198,		  // 0xc6
-	bc_ifnonnull = 199,	   // 0xc7
-	bc_goto_w = 200,		  // 0xc8
-	bc_jsr_w = 201,		   // 0xc9
-	bc_bytecode_limit = 202   // 0xca
-};
-
-enum
-{
-	bc_end_marker = 255,
-	bc_byte_escape = 254,
-	bc_ref_escape = 253,
-	_first_linker_op = bc_getstatic,
-	_last_linker_op = bc_invokestatic,
-	_num_linker_ops = (_last_linker_op - _first_linker_op) + 1,
-	_self_linker_op = bc_bytecode_limit,
-	_self_linker_aload_flag = 1 * _num_linker_ops,
-	_self_linker_super_flag = 2 * _num_linker_ops,
-	_self_linker_limit = _self_linker_op + 4 * _num_linker_ops,
-	_invokeinit_op = _self_linker_limit,
-	_invokeinit_self_option = 0,
-	_invokeinit_super_option = 1,
-	_invokeinit_new_option = 2,
-	_invokeinit_limit = _invokeinit_op + 3,
-	_xldc_op = _invokeinit_limit,
-	bc_aldc = bc_ldc,
-	bc_cldc = _xldc_op + 0,
-	bc_ildc = _xldc_op + 1,
-	bc_fldc = _xldc_op + 2,
-	bc_aldc_w = bc_ldc_w,
-	bc_cldc_w = _xldc_op + 3,
-	bc_ildc_w = _xldc_op + 4,
-	bc_fldc_w = _xldc_op + 5,
-	bc_lldc2_w = bc_ldc2_w,
-	bc_dldc2_w = _xldc_op + 6,
-	_xldc_limit = _xldc_op + 7,
-	_xxx_3_end
-};
diff --git a/depends/pack200/src/defines.h b/depends/pack200/src/defines.h
deleted file mode 100644
index cfe5fc28..00000000
--- a/depends/pack200/src/defines.h
+++ /dev/null
@@ -1,65 +0,0 @@
-/*
- * Copyright (c) 2001, 2009, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-// random definitions
-
-#ifdef _MSC_VER
-#include <windows.h>
-#include <winuser.h>
-#else
-#include <unistd.h>
-#endif
-
-// Error messages that we have
-#define ERROR_ENOMEM "Memory allocation failed"
-#define ERROR_FORMAT "Corrupted pack file"
-#define ERROR_RESOURCE "Cannot extract resource file"
-#define ERROR_OVERFLOW "Internal buffer overflow"
-#define ERROR_INTERNAL "Internal error"
-
-#define lengthof(array) (sizeof(array) / sizeof(array[0]))
-
-#define NEW(T, n) (T *) must_malloc((int)(scale_size(n, sizeof(T))))
-#define U_NEW(T, n) (T *) u->alloc(scale_size(n, sizeof(T)))
-#define T_NEW(T, n) (T *) u->temp_alloc(scale_size(n, sizeof(T)))
-
-typedef signed char byte;
-
-#ifdef _MSC_VER
-#define MKDIR(dir) mkdir(dir)
-#define getpid() _getpid()
-#define PATH_MAX MAX_PATH
-#define dup2(a, b) _dup2(a, b)
-#define strcasecmp(s1, s2) _stricmp(s1, s2)
-#define tempname _tempname
-#define sleep Sleep
-#else
-#define MKDIR(dir) mkdir(dir, 0777);
-#endif
-
-/* Must cast to void *, then size_t, then int. */
-#define ptrlowbits(x) ((int)(size_t)(void *)(x))
-
-#define DEFAULT_ARCHIVE_MODTIME 1060000000 // Aug 04, 2003 5:26 PM PDT
diff --git a/depends/pack200/src/unpack.cpp b/depends/pack200/src/unpack.cpp
deleted file mode 100644
index 55d253b2..00000000
--- a/depends/pack200/src/unpack.cpp
+++ /dev/null
@@ -1,4793 +0,0 @@
-/*
- * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-// -*- C++ -*-
-// Program for unpacking specially compressed Java packages.
-// John R. Rose
-
-/*
- * When compiling for a 64bit LP64 system (longs and pointers being 64bits),
- *    the printf format %ld is correct and use of %lld will cause warning
- *    errors from some compilers (gcc/g++).
- * _LP64 can be explicitly set (used on Linux).
- * Solaris compilers will define __sparcv9 or __x86_64 on 64bit compilations.
- */
-#if defined(_LP64) || defined(__sparcv9) || defined(__x86_64)
-#define LONG_LONG_FORMAT "%ld"
-#define LONG_LONG_HEX_FORMAT "%lx"
-#else
-#define LONG_LONG_FORMAT "%lld"
-#define LONG_LONG_HEX_FORMAT "%016llx"
-#endif
-
-#include <sys/types.h>
-
-#include <stdio.h>
-#include <string.h>
-#include <stdlib.h>
-#include <stdarg.h>
-#include <assert.h>
-#include <limits.h>
-#include <time.h>
-#include <stdint.h>
-
-#include "defines.h"
-#include "bytes.h"
-#include "utils.h"
-#include "coding.h"
-#include "bands.h"
-
-#include "constants.h"
-
-#include "zip.h"
-
-#include "unpack.h"
-
-// tags, in canonical order:
-static const byte TAGS_IN_ORDER[] = {
-	CONSTANT_Utf8,		CONSTANT_Integer,  CONSTANT_Float,	 CONSTANT_Long,
-	CONSTANT_Double,	  CONSTANT_String,   CONSTANT_Class,	 CONSTANT_Signature,
-	CONSTANT_NameandType, CONSTANT_Fieldref, CONSTANT_Methodref, CONSTANT_InterfaceMethodref};
-#define N_TAGS_IN_ORDER (sizeof TAGS_IN_ORDER)
-
-// REQUESTED must be -2 for u2 and REQUESTED_LDC must be -1 for u1
-enum
-{
-	NOT_REQUESTED = 0,
-	REQUESTED = -2,
-	REQUESTED_LDC = -1
-};
-
-#define NO_INORD ((uint32_t) - 1)
-
-struct entry
-{
-	byte tag;
-	unsigned short nrefs; // pack w/ tag
-
-	int outputIndex;
-	uint32_t inord; // &cp.entries[cp.tag_base[this->tag]+this->inord] == this
-
-	entry **refs;
-
-	// put last to pack best
-	union
-	{
-		bytes b;
-		int i;
-		int64_t l;
-	} value;
-
-	void requestOutputIndex(constant_pool &cp, int req = REQUESTED);
-	int getOutputIndex()
-	{
-		assert(outputIndex > NOT_REQUESTED);
-		return outputIndex;
-	}
-
-	entry *ref(int refnum)
-	{
-		assert((uint32_t)refnum < nrefs);
-		return refs[refnum];
-	}
-
-	const char *utf8String()
-	{
-		assert(tagMatches(CONSTANT_Utf8));
-		assert(value.b.len == strlen((const char *)value.b.ptr));
-		return (const char *)value.b.ptr;
-	}
-
-	entry *className()
-	{
-		assert(tagMatches(CONSTANT_Class));
-		return ref(0);
-	}
-
-	entry *memberClass()
-	{
-		assert(tagMatches(CONSTANT_Member));
-		return ref(0);
-	}
-
-	entry *memberDescr()
-	{
-		assert(tagMatches(CONSTANT_Member));
-		return ref(1);
-	}
-
-	entry *descrName()
-	{
-		assert(tagMatches(CONSTANT_NameandType));
-		return ref(0);
-	}
-
-	entry *descrType()
-	{
-		assert(tagMatches(CONSTANT_NameandType));
-		return ref(1);
-	}
-
-	int typeSize();
-
-	bytes &asUtf8();
-	int asInteger()
-	{
-		assert(tag == CONSTANT_Integer);
-		return value.i;
-	}
-
-	bool isUtf8(bytes &b)
-	{
-		return tagMatches(CONSTANT_Utf8) && value.b.equals(b);
-	}
-
-	bool isDoubleWord()
-	{
-		return tag == CONSTANT_Double || tag == CONSTANT_Long;
-	}
-
-	bool tagMatches(byte tag2)
-	{
-		return (tag2 == tag) || (tag2 == CONSTANT_Utf8 && tag == CONSTANT_Signature) ||
-			   (tag2 == CONSTANT_Literal && tag >= CONSTANT_Integer && tag <= CONSTANT_String &&
-				tag != CONSTANT_Class) ||
-			   (tag2 == CONSTANT_Member && tag >= CONSTANT_Fieldref &&
-				tag <= CONSTANT_InterfaceMethodref);
-	}
-};
-
-entry *cpindex::get(uint32_t i)
-{
-	if (i >= len)
-		return nullptr;
-	else if (base1 != nullptr)
-		// primary index
-		return &base1[i];
-	else
-		// secondary index
-		return base2[i];
-}
-
-inline bytes &entry::asUtf8()
-{
-	assert(tagMatches(CONSTANT_Utf8));
-	return value.b;
-}
-
-int entry::typeSize()
-{
-	assert(tagMatches(CONSTANT_Utf8));
-	const char *sigp = (char *)value.b.ptr;
-	switch (*sigp)
-	{
-	case '(':
-		sigp++;
-		break; // skip opening '('
-	case 'D':
-	case 'J':
-		return 2; // double field
-	default:
-		return 1; // field
-	}
-	int siglen = 0;
-	for (;;)
-	{
-		int ch = *sigp++;
-		switch (ch)
-		{
-		case 'D':
-		case 'J':
-			siglen += 1;
-			break;
-		case '[':
-			// Skip rest of array info.
-			while (ch == '[')
-			{
-				ch = *sigp++;
-			}
-			if (ch != 'L')
-				break;
-		// else fall through
-		case 'L':
-			sigp = strchr(sigp, ';');
-			if (sigp == nullptr)
-			{
-				unpack_abort("bad data");
-				return 0;
-			}
-			sigp += 1;
-			break;
-		case ')': // closing ')'
-			return siglen;
-		}
-		siglen += 1;
-	}
-}
-
-inline cpindex *constant_pool::getFieldIndex(entry *classRef)
-{
-	assert(classRef->tagMatches(CONSTANT_Class));
-	assert((uint32_t)classRef->inord < (uint32_t)tag_count[CONSTANT_Class]);
-	return &member_indexes[classRef->inord * 2 + 0];
-}
-inline cpindex *constant_pool::getMethodIndex(entry *classRef)
-{
-	assert(classRef->tagMatches(CONSTANT_Class));
-	assert((uint32_t)classRef->inord < (uint32_t)tag_count[CONSTANT_Class]);
-	return &member_indexes[classRef->inord * 2 + 1];
-}
-
-struct inner_class
-{
-	entry *inner;
-	entry *outer;
-	entry *name;
-	int flags;
-	inner_class *next_sibling;
-	bool requested;
-};
-
-// Here is where everything gets deallocated:
-void unpacker::free()
-{
-	int i;
-	if (jarout != nullptr)
-		jarout->reset();
-	if (gzin != nullptr)
-	{
-		gzin->free();
-		gzin = nullptr;
-	}
-	if (free_input)
-		input.free();
-	/*
-	 * free everybody ever allocated with U_NEW or (recently) with T_NEW
-	 */
-	assert(smallbuf.base() == nullptr || mallocs.contains(smallbuf.base()));
-	assert(tsmallbuf.base() == nullptr || tmallocs.contains(tsmallbuf.base()));
-	mallocs.freeAll();
-	tmallocs.freeAll();
-	smallbuf.init();
-	tsmallbuf.init();
-	bcimap.free();
-	class_fixup_type.free();
-	class_fixup_offset.free();
-	class_fixup_ref.free();
-	code_fixup_type.free();
-	code_fixup_offset.free();
-	code_fixup_source.free();
-	requested_ics.free();
-	cur_classfile_head.free();
-	cur_classfile_tail.free();
-	for (i = 0; i < ATTR_CONTEXT_LIMIT; i++)
-		attr_defs[i].free();
-
-	// free CP state
-	cp.outputEntries.free();
-	for (i = 0; i < CONSTANT_Limit; i++)
-		cp.tag_extras[i].free();
-}
-
-// input handling
-// Attempts to advance rplimit so that (rplimit-rp) is at least 'more'.
-// Will eagerly read ahead by larger chunks, if possible.
-// Returns false if (rplimit-rp) is not at least 'more',
-// unless rplimit hits input.limit().
-bool unpacker::ensure_input(int64_t more)
-{
-	uint64_t want = more - input_remaining();
-	if ((int64_t)want <= 0)
-		return true; // it's already in the buffer
-	if (rplimit == input.limit())
-		return true; // not expecting any more
-
-	if (read_input_fn == nullptr)
-	{
-		// assume it is already all there
-		bytes_read += input.limit() - rplimit;
-		rplimit = input.limit();
-		return true;
-	}
-
-	uint64_t remaining = (input.limit() - rplimit); // how much left to read?
-	byte *rpgoal = (want >= remaining) ? input.limit() : rplimit + (size_t)want;
-	enum
-	{
-		CHUNK_SIZE = (1 << 14)
-	};
-	uint64_t fetch = want;
-	if (fetch < CHUNK_SIZE)
-		fetch = CHUNK_SIZE;
-	if (fetch > remaining * 3 / 4)
-		fetch = remaining;
-	// Try to fetch at least "more" bytes.
-	while ((int64_t)fetch > 0)
-	{
-		int64_t nr = (*read_input_fn)(this, rplimit, fetch, remaining);
-		if (nr <= 0)
-		{
-			return (rplimit >= rpgoal);
-		}
-		remaining -= nr;
-		rplimit += nr;
-		fetch -= nr;
-		bytes_read += nr;
-		assert(remaining == (uint64_t)(input.limit() - rplimit));
-	}
-	return true;
-}
-
-// output handling
-
-fillbytes *unpacker::close_output(fillbytes *which)
-{
-	assert(wp != nullptr);
-	if (which == nullptr)
-	{
-		if (wpbase == cur_classfile_head.base())
-		{
-			which = &cur_classfile_head;
-		}
-		else
-		{
-			which = &cur_classfile_tail;
-		}
-	}
-	assert(wpbase == which->base());
-	assert(wplimit == which->end());
-	which->setLimit(wp);
-	wp = nullptr;
-	wplimit = nullptr;
-	// wpbase = nullptr;
-	return which;
-}
-
-// maybe_inline
-void unpacker::ensure_put_space(size_t size)
-{
-	if (wp + size <= wplimit)
-		return;
-	// Determine which segment needs expanding.
-	fillbytes *which = close_output();
-	byte *wp0 = which->grow(size);
-	wpbase = which->base();
-	wplimit = which->end();
-	wp = wp0;
-}
-
-byte *unpacker::put_space(size_t size)
-{
-	byte *wp0 = wp;
-	byte *wp1 = wp0 + size;
-	if (wp1 > wplimit)
-	{
-		ensure_put_space(size);
-		wp0 = wp;
-		wp1 = wp0 + size;
-	}
-	wp = wp1;
-	return wp0;
-}
-
-void unpacker::putu2_at(byte *wp, int n)
-{
-	if (n != (unsigned short)n)
-	{
-		unpack_abort(ERROR_OVERFLOW);
-		return;
-	}
-	wp[0] = (n) >> 8;
-	wp[1] = (n) >> 0;
-}
-
-void unpacker::putu4_at(byte *wp, int n)
-{
-	wp[0] = (n) >> 24;
-	wp[1] = (n) >> 16;
-	wp[2] = (n) >> 8;
-	wp[3] = (n) >> 0;
-}
-
-void unpacker::putu8_at(byte *wp, int64_t n)
-{
-	putu4_at(wp + 0, (int)((uint64_t)n >> 32));
-	putu4_at(wp + 4, (int)((uint64_t)n >> 0));
-}
-
-void unpacker::putu2(int n)
-{
-	putu2_at(put_space(2), n);
-}
-
-void unpacker::putu4(int n)
-{
-	putu4_at(put_space(4), n);
-}
-
-void unpacker::putu8(int64_t n)
-{
-	putu8_at(put_space(8), n);
-}
-
-int unpacker::putref_index(entry *e, int size)
-{
-	if (e == nullptr)
-		return 0;
-	else if (e->outputIndex > NOT_REQUESTED)
-		return e->outputIndex;
-	else if (e->tag == CONSTANT_Signature)
-		return putref_index(e->ref(0), size);
-	else
-	{
-		e->requestOutputIndex(cp, -size);
-		// Later on we'll fix the bits.
-		class_fixup_type.addByte(size);
-		class_fixup_offset.add((int)wpoffset());
-		class_fixup_ref.add(e);
-		return 0;
-	}
-}
-
-void unpacker::putref(entry *e)
-{
-	int oidx = putref_index(e, 2);
-	putu2_at(put_space(2), oidx);
-}
-
-void unpacker::putu1ref(entry *e)
-{
-	int oidx = putref_index(e, 1);
-	putu1_at(put_space(1), oidx);
-}
-
-// Allocation of small and large blocks.
-
-enum
-{
-	CHUNK = (1 << 14),
-	SMALL = (1 << 9)
-};
-
-// Call malloc.  Try to combine small blocks and free much later.
-void *unpacker::alloc_heap(size_t size, bool smallOK, bool temp)
-{
-	if (!smallOK || size > SMALL)
-	{
-		void *res = must_malloc((int)size);
-		(temp ? &tmallocs : &mallocs)->add(res);
-		return res;
-	}
-	fillbytes &xsmallbuf = *(temp ? &tsmallbuf : &smallbuf);
-	if (!xsmallbuf.canAppend(size + 1))
-	{
-		xsmallbuf.init(CHUNK);
-		(temp ? &tmallocs : &mallocs)->add(xsmallbuf.base());
-	}
-	int growBy = (int)size;
-	growBy += -growBy & 7; // round up mod 8
-	return xsmallbuf.grow(growBy);
-}
-
-void unpacker::saveTo(bytes &b, byte *ptr, size_t len)
-{
-	b.ptr = U_NEW(byte, add_size(len, 1));
-	b.len = len;
-	b.copyFrom(ptr, len);
-}
-
-// Read up through band_headers.
-// Do the archive_size dance to set the size of the input mega-buffer.
-void unpacker::read_file_header()
-{
-	// Read file header to determine file type and total size.
-	enum
-	{
-		MAGIC_BYTES = 4,
-		AH_LENGTH_0 = 3, // minver, majver, options are outside of archive_size
-		AH_LENGTH_0_MAX = AH_LENGTH_0 + 1, // options might have 2 bytes
-		AH_LENGTH = 26,					// maximum archive header length (w/ all fields)
-		// Length contributions from optional header fields:
-		AH_FILE_HEADER_LEN = 5,	// sizehi/lo/next/modtime/files
-		AH_ARCHIVE_SIZE_LEN = 2,   // sizehi/lo only; part of AH_FILE_HEADER_LEN
-		AH_CP_NUMBER_LEN = 4,	  // int/float/long/double
-		AH_SPECIAL_FORMAT_LEN = 2, // layouts/band-headers
-		AH_LENGTH_MIN =
-			AH_LENGTH - (AH_FILE_HEADER_LEN + AH_SPECIAL_FORMAT_LEN + AH_CP_NUMBER_LEN),
-		ARCHIVE_SIZE_MIN = AH_LENGTH_MIN - (AH_LENGTH_0 + AH_ARCHIVE_SIZE_LEN),
-		FIRST_READ = MAGIC_BYTES + AH_LENGTH_MIN
-	};
-
-	assert(AH_LENGTH_MIN == 15);	// # of UNSIGNED5 fields required after archive_magic
-	assert(ARCHIVE_SIZE_MIN == 10); // # of UNSIGNED5 fields required after archive_size
-	// An absolute minimum nullptr archive is magic[4], {minver,majver,options}[3],
-	// archive_size[0], cp_counts[8], class_counts[4], for a total of 19 bytes.
-	// (Note that archive_size is optional; it may be 0..10 bytes in length.)
-	// The first read must capture everything up through the options field.
-	// This happens to work even if {minver,majver,options} is a pathological
-	// 15 bytes long.  Legal pack files limit those three fields to 1+1+2 bytes.
-	assert(FIRST_READ >= MAGIC_BYTES + AH_LENGTH_0 * B_MAX);
-
-	// Up through archive_size, the largest possible archive header is
-	// magic[4], {minver,majver,options}[4], archive_size[10].
-	// (Note only the low 12 bits of options are allowed to be non-zero.)
-	// In order to parse archive_size, we need at least this many bytes
-	// in the first read.  Of course, if archive_size_hi is more than
-	// a byte, we probably will fail to allocate the buffer, since it
-	// will be many gigabytes long.  This is a practical, not an
-	// architectural limit to Pack200 archive sizes.
-	assert(FIRST_READ >= MAGIC_BYTES + AH_LENGTH_0_MAX + 2 * B_MAX);
-
-	bool foreign_buf = (read_input_fn == nullptr);
-	byte initbuf[(int)FIRST_READ + (int)C_SLOP + 200]; // 200 is for JAR I/O
-	if (foreign_buf)
-	{
-		// inbytes is all there is
-		input.set(inbytes);
-		rp = input.base();
-		rplimit = input.limit();
-	}
-	else
-	{
-		// inbytes, if not empty, contains some read-ahead we must use first
-		// ensure_input will take care of copying it into initbuf,
-		// then querying read_input_fn for any additional data needed.
-		// However, the caller must assume that we use up all of inbytes.
-		// There is no way to tell the caller that we used only part of them.
-		// Therefore, the caller must use only a bare minimum of read-ahead.
-		if (inbytes.len > FIRST_READ)
-		{
-			unpack_abort("too much read-ahead");
-		}
-		input.set(initbuf, sizeof(initbuf));
-		input.b.clear();
-		input.b.copyFrom(inbytes);
-		rplimit = rp = input.base();
-		rplimit += inbytes.len;
-		bytes_read += inbytes.len;
-	}
-	// Read only 19 bytes, which is certain to contain #archive_options fields,
-	// but is certain not to overflow past the archive_header.
-	input.b.len = FIRST_READ;
-	if (!ensure_input(FIRST_READ))
-		unpack_abort("EOF reading archive magic number");
-
-	if (rp[0] == 'P' && rp[1] == 'K')
-	{
-		// In the Unix-style program, we simply simulate a copy command.
-		// Copy until EOF; assume the JAR file is the last segment.
-		fprintf(stderr, "Copy-mode.\n");
-		for (;;)
-		{
-			jarout->write_data(rp, (int)input_remaining());
-			if (foreign_buf)
-				break; // one-time use of a passed in buffer
-			if (input.size() < CHUNK)
-			{
-				// Get some breathing room.
-				input.set(U_NEW(byte, (size_t)CHUNK + C_SLOP), (size_t)CHUNK);
-			}
-			rp = rplimit = input.base();
-			if (!ensure_input(1))
-				break;
-		}
-		jarout->closeJarFile(false);
-		return;
-	}
-
-	// Read the magic number.
-	magic = 0;
-	for (int i1 = 0; i1 < (int)sizeof(magic); i1++)
-	{
-		magic <<= 8;
-		magic += (*rp++ & 0xFF);
-	}
-
-	// Read the first 3 values from the header.
-	value_stream hdr;
-	int hdrVals = 0;
-	int hdrValsSkipped = 0; // debug only
-	hdr.init(rp, rplimit, UNSIGNED5_spec);
-	minver = hdr.getInt();
-	majver = hdr.getInt();
-	hdrVals += 2;
-
-	if (magic != (int)JAVA_PACKAGE_MAGIC ||
-		(majver != JAVA5_PACKAGE_MAJOR_VERSION && majver != JAVA6_PACKAGE_MAJOR_VERSION) ||
-		(minver != JAVA5_PACKAGE_MINOR_VERSION && minver != JAVA6_PACKAGE_MINOR_VERSION))
-	{
-		char message[200];
-		sprintf(message, "@" ERROR_FORMAT ": magic/ver = "
-						 "%08X/%d.%d should be %08X/%d.%d OR %08X/%d.%d\n",
-				magic, majver, minver, JAVA_PACKAGE_MAGIC, JAVA5_PACKAGE_MAJOR_VERSION,
-				JAVA5_PACKAGE_MINOR_VERSION, JAVA_PACKAGE_MAGIC, JAVA6_PACKAGE_MAJOR_VERSION,
-				JAVA6_PACKAGE_MINOR_VERSION);
-		unpack_abort(message);
-	}
-
-	archive_options = hdr.getInt();
-	hdrVals += 1;
-	assert(hdrVals == AH_LENGTH_0); // first three fields only
-
-#define ORBIT(bit) | (bit)
-	int OPTION_LIMIT = (0 ARCHIVE_BIT_DO(ORBIT));
-#undef ORBIT
-	if ((archive_options & ~OPTION_LIMIT) != 0)
-	{
-		fprintf(stderr, "Warning: Illegal archive options 0x%x\n", archive_options);
-		unpack_abort("illegal archive options");
-		return;
-	}
-
-	if ((archive_options & AO_HAVE_FILE_HEADERS) != 0)
-	{
-		uint32_t hi = hdr.getInt();
-		uint32_t lo = hdr.getInt();
-		uint64_t x = band::makeLong(hi, lo);
-		archive_size = (size_t)x;
-		if (archive_size != x)
-		{
-			// Silly size specified; force overflow.
-			archive_size = PSIZE_MAX + 1;
-		}
-		hdrVals += 2;
-	}
-	else
-	{
-		hdrValsSkipped += 2;
-	}
-
-	// Now we can size the whole archive.
-	// Read everything else into a mega-buffer.
-	rp = hdr.rp;
-	int header_size_0 = (int)(rp - input.base()); // used-up header (4byte + 3int)
-	int header_size_1 = (int)(rplimit - rp);	  // buffered unused initial fragment
-	int header_size = header_size_0 + header_size_1;
-	unsized_bytes_read = header_size_0;
-	if (foreign_buf)
-	{
-		if (archive_size > (size_t)header_size_1)
-		{
-			unpack_abort("EOF reading fixed input buffer");
-			return;
-		}
-	}
-	else if (archive_size != 0)
-	{
-		if (archive_size < ARCHIVE_SIZE_MIN)
-		{
-			unpack_abort("impossible archive size"); // bad input data
-			return;
-		}
-		if (archive_size < (size_t)header_size_1)
-		{
-			unpack_abort("too much read-ahead"); // somehow we pre-fetched too much?
-			return;
-		}
-		input.set(U_NEW(byte, add_size(header_size_0, archive_size, C_SLOP)),
-				  (size_t)header_size_0 + archive_size);
-		assert(input.limit()[0] == 0);
-		// Move all the bytes we read initially into the real buffer.
-		input.b.copyFrom(initbuf, header_size);
-		rp = input.b.ptr + header_size_0;
-		rplimit = input.b.ptr + header_size;
-	}
-	else
-	{
-		// It's more complicated and painful.
-		// A zero archive_size means that we must read until EOF.
-		input.init(CHUNK * 2);
-		input.b.len = input.allocated;
-		rp = rplimit = input.base();
-		// Set up input buffer as if we already read the header:
-		input.b.copyFrom(initbuf, header_size);
-		rplimit += header_size;
-		while (ensure_input(input.limit() - rp))
-		{
-			size_t dataSoFar = input_remaining();
-			size_t nextSize = add_size(dataSoFar, CHUNK);
-			input.ensureSize(nextSize);
-			input.b.len = input.allocated;
-			rp = rplimit = input.base();
-			rplimit += dataSoFar;
-		}
-		size_t dataSize = (rplimit - input.base());
-		input.b.len = dataSize;
-		input.grow(C_SLOP);
-		free_input = true; // free it later
-		input.b.len = dataSize;
-		assert(input.limit()[0] == 0);
-		rp = rplimit = input.base();
-		rplimit += dataSize;
-		rp += header_size_0; // already scanned these bytes...
-	}
-	live_input = true; // mark as "do not reuse"
-
-	// read the rest of the header fields
-	ensure_input((AH_LENGTH - AH_LENGTH_0) * B_MAX);
-	hdr.rp = rp;
-	hdr.rplimit = rplimit;
-
-	if ((archive_options & AO_HAVE_FILE_HEADERS) != 0)
-	{
-		archive_next_count = hdr.getInt();
-		if (archive_next_count < 0)
-			unpack_abort("bad archive_next_count");
-		archive_modtime = hdr.getInt();
-		file_count = hdr.getInt();
-		if (file_count < 0)
-			unpack_abort("bad file_count");
-		hdrVals += 3;
-	}
-	else
-	{
-		hdrValsSkipped += 3;
-	}
-
-	if ((archive_options & AO_HAVE_SPECIAL_FORMATS) != 0)
-	{
-		band_headers_size = hdr.getInt();
-		if (band_headers_size < 0)
-			unpack_abort("bad band_headers_size");
-		attr_definition_count = hdr.getInt();
-		if (attr_definition_count < 0)
-			unpack_abort("bad attr_definition_count");
-		hdrVals += 2;
-	}
-	else
-	{
-		hdrValsSkipped += 2;
-	}
-
-	int cp_counts[N_TAGS_IN_ORDER];
-	for (int k = 0; k < (int)N_TAGS_IN_ORDER; k++)
-	{
-		if (!(archive_options & AO_HAVE_CP_NUMBERS))
-		{
-			switch (TAGS_IN_ORDER[k])
-			{
-			case CONSTANT_Integer:
-			case CONSTANT_Float:
-			case CONSTANT_Long:
-			case CONSTANT_Double:
-				cp_counts[k] = 0;
-				hdrValsSkipped += 1;
-				continue;
-			}
-		}
-		cp_counts[k] = hdr.getInt();
-		if (cp_counts[k] < 0)
-			unpack_abort("bad cp_counts");
-		hdrVals += 1;
-	}
-
-	ic_count = hdr.getInt();
-	if (ic_count < 0)
-		unpack_abort("bad ic_count");
-
-	default_class_minver = hdr.getInt();
-	default_class_majver = hdr.getInt();
-
-	class_count = hdr.getInt();
-	if (class_count < 0)
-		unpack_abort("bad class_count");
-
-	hdrVals += 4;
-
-	// done with archive_header
-	hdrVals += hdrValsSkipped;
-	assert(hdrVals == AH_LENGTH);
-
-	rp = hdr.rp;
-	if (rp > rplimit)
-		unpack_abort("EOF reading archive header");
-
-	// Now size the CP.
-	cp.init(this, cp_counts);
-
-	default_file_modtime = archive_modtime;
-	if (default_file_modtime == 0 && !(archive_options & AO_HAVE_FILE_MODTIME))
-		default_file_modtime = DEFAULT_ARCHIVE_MODTIME; // taken from driver
-	if ((archive_options & AO_DEFLATE_HINT) != 0)
-		default_file_options |= FO_DEFLATE_HINT;
-
-	// meta-bytes, if any, immediately follow archive header
-	// band_headers.readData(band_headers_size);
-	ensure_input(band_headers_size);
-	if (input_remaining() < (size_t)band_headers_size)
-	{
-		unpack_abort("EOF reading band headers");
-		return;
-	}
-	bytes band_headers;
-	// The "1+" allows an initial byte to be pushed on the front.
-	band_headers.set(1 + U_NEW(byte, 1 + band_headers_size + C_SLOP), band_headers_size);
-
-	// Start scanning band headers here:
-	band_headers.copyFrom(rp, band_headers.len);
-	rp += band_headers.len;
-	assert(rp <= rplimit);
-	meta_rp = band_headers.ptr;
-	// Put evil meta-codes at the end of the band headers,
-	// so we are sure to throw an error if we run off the end.
-	bytes::of(band_headers.limit(), C_SLOP).clear(_meta_error);
-}
-
-void unpacker::finish()
-{
-	if (verbose >= 1)
-	{
-		fprintf(stderr, "A total of " LONG_LONG_FORMAT " bytes were read in %d segment(s).\n",
-				(bytes_read_before_reset + bytes_read), segments_read_before_reset + 1);
-		fprintf(stderr, "A total of " LONG_LONG_FORMAT " file content bytes were written.\n",
-				(bytes_written_before_reset + bytes_written));
-		fprintf(stderr,
-				"A total of %d files (of which %d are classes) were written to output.\n",
-				files_written_before_reset + files_written,
-				classes_written_before_reset + classes_written);
-	}
-	if (jarout != nullptr)
-		jarout->closeJarFile(true);
-}
-
-// Cf. PackageReader.readConstantPoolCounts
-void constant_pool::init(unpacker *u_, int counts[NUM_COUNTS])
-{
-	this->u = u_;
-
-	// Fill-pointer for CP.
-	int next_entry = 0;
-
-	// Size the constant pool:
-	for (int k = 0; k < (int)N_TAGS_IN_ORDER; k++)
-	{
-		byte tag = TAGS_IN_ORDER[k];
-		int len = counts[k];
-		tag_count[tag] = len;
-		tag_base[tag] = next_entry;
-		next_entry += len;
-		// Detect and defend against constant pool size overflow.
-		// (Pack200 forbids the sum of CP counts to exceed 2^29-1.)
-		enum
-		{
-			CP_SIZE_LIMIT = (1 << 29),
-			IMPLICIT_ENTRY_COUNT = 1 // empty Utf8 string
-		};
-		if (len >= (1 << 29) || len < 0 || next_entry >= CP_SIZE_LIMIT + IMPLICIT_ENTRY_COUNT)
-		{
-			unpack_abort("archive too large:  constant pool limit exceeded");
-		}
-	}
-
-	// Close off the end of the CP:
-	nentries = next_entry;
-
-	// place a limit on future CP growth:
-	int generous = 0;
-	generous = add_size(generous, u->ic_count);	// implicit name
-	generous = add_size(generous, u->ic_count);	// outer
-	generous = add_size(generous, u->ic_count);	// outer.utf8
-	generous = add_size(generous, 40);			 // WKUs, misc
-	generous = add_size(generous, u->class_count); // implicit SourceFile strings
-	maxentries = add_size(nentries, generous);
-
-	// Note that this CP does not include "empty" entries
-	// for longs and doubles.  Those are introduced when
-	// the entries are renumbered for classfile output.
-
-	entries = U_NEW(entry, maxentries);
-
-	first_extra_entry = &entries[nentries];
-
-	// Initialize the standard indexes.
-	tag_count[CONSTANT_All] = nentries;
-	tag_base[CONSTANT_All] = 0;
-	for (int tag = 0; tag < CONSTANT_Limit; tag++)
-	{
-		entry *cpMap = &entries[tag_base[tag]];
-		tag_index[tag].init(tag_count[tag], cpMap, tag);
-	}
-
-	// Initialize hashTab to a generous power-of-two size.
-	uint32_t pow2 = 1;
-	uint32_t target = maxentries + maxentries / 2; // 60% full
-	while (pow2 < target)
-		pow2 <<= 1;
-	hashTab = U_NEW(entry *, hashTabLength = pow2);
-}
-
-static byte *store_Utf8_char(byte *cp, unsigned short ch)
-{
-	if (ch >= 0x001 && ch <= 0x007F)
-	{
-		*cp++ = (byte)ch;
-	}
-	else if (ch <= 0x07FF)
-	{
-		*cp++ = (byte)(0xC0 | ((ch >> 6) & 0x1F));
-		*cp++ = (byte)(0x80 | ((ch >> 0) & 0x3F));
-	}
-	else
-	{
-		*cp++ = (byte)(0xE0 | ((ch >> 12) & 0x0F));
-		*cp++ = (byte)(0x80 | ((ch >> 6) & 0x3F));
-		*cp++ = (byte)(0x80 | ((ch >> 0) & 0x3F));
-	}
-	return cp;
-}
-
-static byte *skip_Utf8_chars(byte *cp, int len)
-{
-	for (;; cp++)
-	{
-		int ch = *cp & 0xFF;
-		if ((ch & 0xC0) != 0x80)
-		{
-			if (len-- == 0)
-				return cp;
-			if (ch < 0x80 && len == 0)
-				return cp + 1;
-		}
-	}
-}
-
-static int compare_Utf8_chars(bytes &b1, bytes &b2)
-{
-	int l1 = (int)b1.len;
-	int l2 = (int)b2.len;
-	int l0 = (l1 < l2) ? l1 : l2;
-	byte *p1 = b1.ptr;
-	byte *p2 = b2.ptr;
-	int c0 = 0;
-	for (int i = 0; i < l0; i++)
-	{
-		int c1 = p1[i] & 0xFF;
-		int c2 = p2[i] & 0xFF;
-		if (c1 != c2)
-		{
-			// Before returning the obvious answer,
-			// check to see if c1 or c2 is part of a 0x0000,
-			// which encodes as {0xC0,0x80}.  The 0x0000 is the
-			// lowest-sorting Java char value, and yet it encodes
-			// as if it were the first char after 0x7F, which causes
-			// strings containing nulls to sort too high.  All other
-			// comparisons are consistent between Utf8 and Java chars.
-			if (c1 == 0xC0 && (p1[i + 1] & 0xFF) == 0x80)
-				c1 = 0;
-			if (c2 == 0xC0 && (p2[i + 1] & 0xFF) == 0x80)
-				c2 = 0;
-			if (c0 == 0xC0)
-			{
-				assert(((c1 | c2) & 0xC0) == 0x80); // c1 & c2 are extension chars
-				if (c1 == 0x80)
-					c1 = 0; // will sort below c2
-				if (c2 == 0x80)
-					c2 = 0; // will sort below c1
-			}
-			return c1 - c2;
-		}
-		c0 = c1; // save away previous char
-	}
-	// common prefix is identical; return length difference if any
-	return l1 - l2;
-}
-
-// Cf. PackageReader.readUtf8Bands
-void unpacker::read_Utf8_values(entry *cpMap, int len)
-{
-	// Implicit first Utf8 string is the empty string.
-	enum
-	{
-		// certain bands begin with implicit zeroes
-		PREFIX_SKIP_2 = 2,
-		SUFFIX_SKIP_1 = 1
-	};
-
-	int i;
-
-	// First band:  Read lengths of shared prefixes.
-	if (len > PREFIX_SKIP_2)
-		cp_Utf8_prefix.readData(len - PREFIX_SKIP_2);
-
-	// Second band:  Read lengths of unshared suffixes:
-	if (len > SUFFIX_SKIP_1)
-		cp_Utf8_suffix.readData(len - SUFFIX_SKIP_1);
-
-	bytes *allsuffixes = T_NEW(bytes, len);
-
-	int nbigsuf = 0;
-	fillbytes charbuf; // buffer to allocate small strings
-	charbuf.init();
-
-	// Third band:  Read the char values in the unshared suffixes:
-	cp_Utf8_chars.readData(cp_Utf8_suffix.getIntTotal());
-	for (i = 0; i < len; i++)
-	{
-		int suffix = (i < SUFFIX_SKIP_1) ? 0 : cp_Utf8_suffix.getInt();
-		if (suffix < 0)
-		{
-			unpack_abort("bad utf8 suffix");
-		}
-		if (suffix == 0 && i >= SUFFIX_SKIP_1)
-		{
-			// chars are packed in cp_Utf8_big_chars
-			nbigsuf += 1;
-			continue;
-		}
-		bytes &chars = allsuffixes[i];
-		uint32_t size3 = suffix * 3; // max Utf8 length
-		bool isMalloc = (suffix > SMALL);
-		if (isMalloc)
-		{
-			chars.malloc(size3);
-		}
-		else
-		{
-			if (!charbuf.canAppend(size3 + 1))
-			{
-				assert(charbuf.allocated == 0 || tmallocs.contains(charbuf.base()));
-				charbuf.init(CHUNK); // Reset to new buffer.
-				tmallocs.add(charbuf.base());
-			}
-			chars.set(charbuf.grow(size3 + 1), size3);
-		}
-
-		byte *chp = chars.ptr;
-		for (int j = 0; j < suffix; j++)
-		{
-			unsigned short ch = cp_Utf8_chars.getInt();
-			chp = store_Utf8_char(chp, ch);
-		}
-		// shrink to fit:
-		if (isMalloc)
-		{
-			chars.realloc(chp - chars.ptr);
-			tmallocs.add(chars.ptr); // free it later
-		}
-		else
-		{
-			int shrink = (int)(chars.limit() - chp);
-			chars.len -= shrink;
-			charbuf.b.len -= shrink; // ungrow to reclaim buffer space
-			// Note that we did not reclaim the final '\0'.
-			assert(chars.limit() == charbuf.limit() - 1);
-			assert(strlen((char *)chars.ptr) == chars.len);
-		}
-	}
-	// cp_Utf8_chars.done();
-
-	// Fourth band:  Go back and size the specially packed strings.
-	int maxlen = 0;
-	cp_Utf8_big_suffix.readData(nbigsuf);
-	cp_Utf8_suffix.rewind();
-	for (i = 0; i < len; i++)
-	{
-		int suffix = (i < SUFFIX_SKIP_1) ? 0 : cp_Utf8_suffix.getInt();
-		int prefix = (i < PREFIX_SKIP_2) ? 0 : cp_Utf8_prefix.getInt();
-		if (prefix < 0 || prefix + suffix < 0)
-		{
-			unpack_abort("bad utf8 prefix");
-		}
-		bytes &chars = allsuffixes[i];
-		if (suffix == 0 && i >= SUFFIX_SKIP_1)
-		{
-			suffix = cp_Utf8_big_suffix.getInt();
-			assert(chars.ptr == nullptr);
-			chars.len = suffix; // just a momentary hack
-		}
-		else
-		{
-			assert(chars.ptr != nullptr);
-		}
-		if (maxlen < prefix + suffix)
-		{
-			maxlen = prefix + suffix;
-		}
-	}
-	// cp_Utf8_suffix.done();      // will use allsuffixes[i].len (ptr!=nullptr)
-	// cp_Utf8_big_suffix.done();  // will use allsuffixes[i].len
-
-	// Fifth band(s):  Get the specially packed characters.
-	cp_Utf8_big_suffix.rewind();
-	for (i = 0; i < len; i++)
-	{
-		bytes &chars = allsuffixes[i];
-		if (chars.ptr != nullptr)
-			continue;				// already input
-		int suffix = (int)chars.len; // pick up the hack
-		uint32_t size3 = suffix * 3;
-		if (suffix == 0)
-			continue; // done with empty string
-		chars.malloc(size3);
-		byte *chp = chars.ptr;
-		band saved_band = cp_Utf8_big_chars;
-		cp_Utf8_big_chars.readData(suffix);
-		for (int j = 0; j < suffix; j++)
-		{
-			unsigned short ch = cp_Utf8_big_chars.getInt();
-			chp = store_Utf8_char(chp, ch);
-		}
-		chars.realloc(chp - chars.ptr);
-		tmallocs.add(chars.ptr); // free it later
-		// cp_Utf8_big_chars.done();
-		cp_Utf8_big_chars = saved_band; // reset the band for the next string
-	}
-	cp_Utf8_big_chars.readData(0); // zero chars
-								   // cp_Utf8_big_chars.done();
-
-	// Finally, sew together all the prefixes and suffixes.
-	bytes bigbuf;
-	bigbuf.malloc(maxlen * 3 + 1); // max Utf8 length, plus slop for nullptr
-	int prevlen = 0;			   // previous string length (in chars)
-	tmallocs.add(bigbuf.ptr);	  // free after this block
-	cp_Utf8_prefix.rewind();
-	for (i = 0; i < len; i++)
-	{
-		bytes &chars = allsuffixes[i];
-		int prefix = (i < PREFIX_SKIP_2) ? 0 : cp_Utf8_prefix.getInt();
-		int suffix = (int)chars.len;
-		byte *fillp;
-		// by induction, the buffer is already filled with the prefix
-		// make sure the prefix value is not corrupted, though:
-		if (prefix > prevlen)
-		{
-			unpack_abort("utf8 prefix overflow");
-			return;
-		}
-		fillp = skip_Utf8_chars(bigbuf.ptr, prefix);
-		// copy the suffix into the same buffer:
-		fillp = chars.writeTo(fillp);
-		assert(bigbuf.inBounds(fillp));
-		*fillp = 0; // bigbuf must contain a well-formed Utf8 string
-		int length = (int)(fillp - bigbuf.ptr);
-		bytes &value = cpMap[i].value.b;
-		value.set(U_NEW(byte, add_size(length, 1)), length);
-		value.copyFrom(bigbuf.ptr, length);
-		// Index all Utf8 strings
-		entry *&htref = cp.hashTabRef(CONSTANT_Utf8, value);
-		if (htref == nullptr)
-		{
-			// Note that if two identical strings are transmitted,
-			// the first is taken to be the canonical one.
-			htref = &cpMap[i];
-		}
-		prevlen = prefix + suffix;
-	}
-	// cp_Utf8_prefix.done();
-
-	// Free intermediate buffers.
-	free_temps();
-}
-
-void unpacker::read_single_words(band &cp_band, entry *cpMap, int len)
-{
-	cp_band.readData(len);
-	for (int i = 0; i < len; i++)
-	{
-		cpMap[i].value.i = cp_band.getInt(); // coding handles signs OK
-	}
-}
-
-void unpacker::read_double_words(band &cp_bands, entry *cpMap, int len)
-{
-	band &cp_band_hi = cp_bands;
-	band &cp_band_lo = cp_bands.nextBand();
-	cp_band_hi.readData(len);
-	cp_band_lo.readData(len);
-	for (int i = 0; i < len; i++)
-	{
-		cpMap[i].value.l = cp_band_hi.getLong(cp_band_lo, true);
-	}
-	// cp_band_hi.done();
-	// cp_band_lo.done();
-}
-
-void unpacker::read_single_refs(band &cp_band, byte refTag, entry *cpMap, int len)
-{
-	assert(refTag == CONSTANT_Utf8);
-	cp_band.setIndexByTag(refTag);
-	cp_band.readData(len);
-	int indexTag = (cp_band.bn == e_cp_Class) ? CONSTANT_Class : 0;
-	for (int i = 0; i < len; i++)
-	{
-		entry &e = cpMap[i];
-		e.refs = U_NEW(entry *, e.nrefs = 1);
-		entry *utf = cp_band.getRef();
-		e.refs[0] = utf;
-		e.value.b = utf->value.b; // copy value of Utf8 string to self
-		if (indexTag != 0)
-		{
-			// Maintain cross-reference:
-			entry *&htref = cp.hashTabRef(indexTag, e.value.b);
-			if (htref == nullptr)
-			{
-				// Note that if two identical classes are transmitted,
-				// the first is taken to be the canonical one.
-				htref = &e;
-			}
-		}
-	}
-	// cp_band.done();
-}
-
-void unpacker::read_double_refs(band &cp_band, byte ref1Tag, byte ref2Tag, entry *cpMap,
-								int len)
-{
-	band &cp_band1 = cp_band;
-	band &cp_band2 = cp_band.nextBand();
-	cp_band1.setIndexByTag(ref1Tag);
-	cp_band2.setIndexByTag(ref2Tag);
-	cp_band1.readData(len);
-	cp_band2.readData(len);
-	for (int i = 0; i < len; i++)
-	{
-		entry &e = cpMap[i];
-		e.refs = U_NEW(entry *, e.nrefs = 2);
-		e.refs[0] = cp_band1.getRef();
-		e.refs[1] = cp_band2.getRef();
-	}
-	// cp_band1.done();
-	// cp_band2.done();
-}
-
-// Cf. PackageReader.readSignatureBands
-void unpacker::read_signature_values(entry *cpMap, int len)
-{
-	cp_Signature_form.setIndexByTag(CONSTANT_Utf8);
-	cp_Signature_form.readData(len);
-	int ncTotal = 0;
-	int i;
-	for (i = 0; i < len; i++)
-	{
-		entry &e = cpMap[i];
-		entry &form = *cp_Signature_form.getRef();
-		int nc = 0;
-
-		for (const char *ncp = form.utf8String(); *ncp; ncp++)
-		{
-			if (*ncp == 'L')
-				nc++;
-		}
-
-		ncTotal += nc;
-		e.refs = U_NEW(entry *, cpMap[i].nrefs = 1 + nc);
-		e.refs[0] = &form;
-	}
-	// cp_Signature_form.done();
-	cp_Signature_classes.setIndexByTag(CONSTANT_Class);
-	cp_Signature_classes.readData(ncTotal);
-	for (i = 0; i < len; i++)
-	{
-		entry &e = cpMap[i];
-		for (int j = 1; j < e.nrefs; j++)
-		{
-			e.refs[j] = cp_Signature_classes.getRef();
-		}
-	}
-	// cp_Signature_classes.done();
-}
-
-// Cf. PackageReader.readConstantPool
-void unpacker::read_cp()
-{
-	int i;
-
-	for (int k = 0; k < (int)N_TAGS_IN_ORDER; k++)
-	{
-		byte tag = TAGS_IN_ORDER[k];
-		int len = cp.tag_count[tag];
-		int base = cp.tag_base[tag];
-
-		entry *cpMap = &cp.entries[base];
-		for (i = 0; i < len; i++)
-		{
-			cpMap[i].tag = tag;
-			cpMap[i].inord = i;
-		}
-
-		switch (tag)
-		{
-		case CONSTANT_Utf8:
-			read_Utf8_values(cpMap, len);
-			break;
-		case CONSTANT_Integer:
-			read_single_words(cp_Int, cpMap, len);
-			break;
-		case CONSTANT_Float:
-			read_single_words(cp_Float, cpMap, len);
-			break;
-		case CONSTANT_Long:
-			read_double_words(cp_Long_hi /*& cp_Long_lo*/, cpMap, len);
-			break;
-		case CONSTANT_Double:
-			read_double_words(cp_Double_hi /*& cp_Double_lo*/, cpMap, len);
-			break;
-		case CONSTANT_String:
-			read_single_refs(cp_String, CONSTANT_Utf8, cpMap, len);
-			break;
-		case CONSTANT_Class:
-			read_single_refs(cp_Class, CONSTANT_Utf8, cpMap, len);
-			break;
-		case CONSTANT_Signature:
-			read_signature_values(cpMap, len);
-			break;
-		case CONSTANT_NameandType:
-			read_double_refs(cp_Descr_name /*& cp_Descr_type*/, CONSTANT_Utf8,
-							 CONSTANT_Signature, cpMap, len);
-			break;
-		case CONSTANT_Fieldref:
-			read_double_refs(cp_Field_class /*& cp_Field_desc*/, CONSTANT_Class,
-							 CONSTANT_NameandType, cpMap, len);
-			break;
-		case CONSTANT_Methodref:
-			read_double_refs(cp_Method_class /*& cp_Method_desc*/, CONSTANT_Class,
-							 CONSTANT_NameandType, cpMap, len);
-			break;
-		case CONSTANT_InterfaceMethodref:
-			read_double_refs(cp_Imethod_class /*& cp_Imethod_desc*/, CONSTANT_Class,
-							 CONSTANT_NameandType, cpMap, len);
-			break;
-		default:
-			assert(false);
-			break;
-		}
-	}
-
-	cp.expandSignatures();
-	cp.initMemberIndexes();
-
-#define SNAME(n, s) #s "\0"
-	const char *symNames = (ALL_ATTR_DO(SNAME) "<init>");
-#undef SNAME
-
-	for (int sn = 0; sn < constant_pool::s_LIMIT; sn++)
-	{
-		assert(symNames[0] >= '0' && symNames[0] <= 'Z'); // sanity
-		bytes name;
-		name.set(symNames);
-		if (name.len > 0 && name.ptr[0] != '0')
-		{
-			cp.sym[sn] = cp.ensureUtf8(name);
-		}
-		symNames += name.len + 1; // skip trailing nullptr to next name
-	}
-
-	band::initIndexes(this);
-}
-
-static band *no_bands[] = {nullptr}; // shared empty body
-
-inline band &unpacker::attr_definitions::fixed_band(int e_class_xxx)
-{
-	return u->all_bands[xxx_flags_hi_bn + (e_class_xxx - e_class_flags_hi)];
-}
-inline band &unpacker::attr_definitions::xxx_flags_hi()
-{
-	return fixed_band(e_class_flags_hi);
-}
-inline band &unpacker::attr_definitions::xxx_flags_lo()
-{
-	return fixed_band(e_class_flags_lo);
-}
-inline band &unpacker::attr_definitions::xxx_attr_count()
-{
-	return fixed_band(e_class_attr_count);
-}
-inline band &unpacker::attr_definitions::xxx_attr_indexes()
-{
-	return fixed_band(e_class_attr_indexes);
-}
-inline band &unpacker::attr_definitions::xxx_attr_calls()
-{
-	return fixed_band(e_class_attr_calls);
-}
-
-inline unpacker::layout_definition *
-unpacker::attr_definitions::defineLayout(int idx, entry *nameEntry, const char *layout)
-{
-	const char *name = nameEntry->value.b.strval();
-	layout_definition *lo = defineLayout(idx, name, layout);
-	lo->nameEntry = nameEntry;
-	return lo;
-}
-
-unpacker::layout_definition *unpacker::attr_definitions::defineLayout(int idx, const char *name,
-																	  const char *layout)
-{
-	assert(flag_limit != 0); // must be set up already
-	if (idx >= 0)
-	{
-		// Fixed attr.
-		if (idx >= (int)flag_limit)
-			unpack_abort("attribute index too large");
-		if (isRedefined(idx))
-			unpack_abort("redefined attribute index");
-		redef |= ((uint64_t)1 << idx);
-	}
-	else
-	{
-		idx = flag_limit + overflow_count.length();
-		overflow_count.add(0); // make a new counter
-	}
-	layout_definition *lo = U_NEW(layout_definition, 1);
-	lo->idx = idx;
-	lo->name = name;
-	lo->layout = layout;
-	for (int adds = (idx + 1) - layouts.length(); adds > 0; adds--)
-	{
-		layouts.add(nullptr);
-	}
-	layouts.get(idx) = lo;
-	return lo;
-}
-
-band **unpacker::attr_definitions::buildBands(unpacker::layout_definition *lo)
-{
-	int i;
-	if (lo->elems != nullptr)
-		return lo->bands();
-	if (lo->layout[0] == '\0')
-	{
-		lo->elems = no_bands;
-	}
-	else
-	{
-		// Create bands for this attribute by parsing the layout.
-		bool hasCallables = lo->hasCallables();
-		bands_made = 0x10000; // base number for bands made
-		const char *lp = lo->layout;
-		lp = parseLayout(lp, lo->elems, -1);
-		if (lp[0] != '\0' || band_stack.length() > 0)
-		{
-			unpack_abort("garbage at end of layout");
-		}
-		band_stack.popTo(0);
-
-		// Fix up callables to point at their callees.
-		band **bands = lo->elems;
-		assert(bands == lo->bands());
-		int num_callables = 0;
-		if (hasCallables)
-		{
-			while (bands[num_callables] != nullptr)
-			{
-				if (bands[num_callables]->le_kind != EK_CBLE)
-				{
-					unpack_abort("garbage mixed with callables");
-					break;
-				}
-				num_callables += 1;
-			}
-		}
-		for (i = 0; i < calls_to_link.length(); i++)
-		{
-			band &call = *(band *)calls_to_link.get(i);
-			assert(call.le_kind == EK_CALL);
-			// Determine the callee.
-			int call_num = call.le_len;
-			if (call_num < 0 || call_num >= num_callables)
-			{
-				unpack_abort("bad call in layout");
-				break;
-			}
-			band &cble = *bands[call_num];
-			// Link the call to it.
-			call.le_body[0] = &cble;
-			// Distinguish backward calls and callables:
-			assert(cble.le_kind == EK_CBLE);
-			// FIXME: hit this one
-			// assert(cble.le_len == call_num);
-			cble.le_back |= call.le_back;
-		}
-		calls_to_link.popTo(0);
-	}
-	return lo->elems;
-}
-
-/* attribute layout language parser
-
-  attribute_layout:
-		( layout_element )* | ( callable )+
-  layout_element:
-		( integral | replication | union | call | reference )
-
-  callable:
-		'[' body ']'
-  body:
-		( layout_element )+
-
-  integral:
-		( unsigned_int | signed_int | bc_index | bc_offset | flag )
-  unsigned_int:
-		uint_type
-  signed_int:
-		'S' uint_type
-  any_int:
-		( unsigned_int | signed_int )
-  bc_index:
-		( 'P' uint_type | 'PO' uint_type )
-  bc_offset:
-		'O' any_int
-  flag:
-		'F' uint_type
-  uint_type:
-		( 'B' | 'H' | 'I' | 'V' )
-
-  replication:
-		'N' uint_type '[' body ']'
-
-  union:
-		'T' any_int (union_case)* '(' ')' '[' (body)? ']'
-  union_case:
-		'(' union_case_tag (',' union_case_tag)* ')' '[' (body)? ']'
-  union_case_tag:
-		( numeral | numeral '-' numeral )
-  call:
-		'(' numeral ')'
-
-  reference:
-		reference_type ( 'N' )? uint_type
-  reference_type:
-		( constant_ref | schema_ref | utf8_ref | untyped_ref )
-  constant_ref:
-		( 'KI' | 'KJ' | 'KF' | 'KD' | 'KS' | 'KQ' )
-  schema_ref:
-		( 'RC' | 'RS' | 'RD' | 'RF' | 'RM' | 'RI' )
-  utf8_ref:
-		'RU'
-  untyped_ref:
-		'RQ'
-
-  numeral:
-		'(' ('-')? (digit)+ ')'
-  digit:
-		( '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' )
-
-*/
-
-const char *unpacker::attr_definitions::parseIntLayout(const char *lp, band *&res, byte le_kind,
-													   bool can_be_signed)
-{
-	band *b = U_NEW(band, 1);
-	char le = *lp++;
-	int spec = UNSIGNED5_spec;
-	if (le == 'S' && can_be_signed)
-	{
-		// Note:  This is the last use of sign.  There is no 'EF_SIGN'.
-		spec = SIGNED5_spec;
-		le = *lp++;
-	}
-	else if (le == 'B')
-	{
-		spec = BYTE1_spec; // unsigned byte
-	}
-	b->init(u, bands_made++, spec);
-	b->le_kind = le_kind;
-	int le_len = 0;
-	switch (le)
-	{
-	case 'B':
-		le_len = 1;
-		break;
-	case 'H':
-		le_len = 2;
-		break;
-	case 'I':
-		le_len = 4;
-		break;
-	case 'V':
-		le_len = 0;
-		break;
-	default:
-		unpack_abort("bad layout element");
-	}
-	b->le_len = le_len;
-	band_stack.add(b);
-	res = b;
-	return lp;
-}
-
-const char *unpacker::attr_definitions::parseNumeral(const char *lp, int &res)
-{
-	bool sgn = false;
-	if (*lp == '0')
-	{
-		res = 0;
-		return lp + 1;
-	} // special case '0'
-	if (*lp == '-')
-	{
-		sgn = true;
-		lp++;
-	}
-	const char *dp = lp;
-	int con = 0;
-	while (*dp >= '0' && *dp <= '9')
-	{
-		int con0 = con;
-		con *= 10;
-		con += (*dp++) - '0';
-		if (con <= con0)
-		{
-			con = -1;
-			break;
-		} //  numeral overflow
-	}
-	if (lp == dp)
-	{
-		unpack_abort("missing numeral in layout");
-	}
-	lp = dp;
-	if (con < 0 && !(sgn && con == -con))
-	{
-		// (Portability note:  Misses the error if int is not 32 bits.)
-		unpack_abort("numeral overflow");
-	}
-	if (sgn)
-		con = -con;
-	res = con;
-	return lp;
-}
-
-band **unpacker::attr_definitions::popBody(int bs_base)
-{
-	// Return everything that was pushed, as a nullptr-terminated pointer array.
-	int bs_limit = band_stack.length();
-	if (bs_base == bs_limit)
-	{
-		return no_bands;
-	}
-	else
-	{
-		int nb = bs_limit - bs_base;
-		band **res = U_NEW(band *, add_size(nb, 1));
-		for (int i = 0; i < nb; i++)
-		{
-			band *b = (band *)band_stack.get(bs_base + i);
-			res[i] = b;
-		}
-		band_stack.popTo(bs_base);
-		return res;
-	}
-}
-
-const char *unpacker::attr_definitions::parseLayout(const char *lp, band **&res, int curCble)
-{
-	int bs_base = band_stack.length();
-	bool top_level = (bs_base == 0);
-	band *b;
-	enum
-	{
-		can_be_signed = true
-	}; // optional arg to parseIntLayout
-
-	for (bool done = false; !done;)
-	{
-		switch (*lp++)
-		{
-		case 'B':
-		case 'H':
-		case 'I':
-		case 'V': // unsigned_int
-		case 'S': // signed_int
-			--lp; // reparse
-		case 'F':
-			lp = parseIntLayout(lp, b, EK_INT);
-			break;
-		case 'P':
-		{
-			int le_bci = EK_BCI;
-			if (*lp == 'O')
-			{
-				++lp;
-				le_bci = EK_BCID;
-			}
-			assert(*lp != 'S'); // no PSH, etc.
-			lp = parseIntLayout(lp, b, EK_INT);
-			b->le_bci = le_bci;
-			if (le_bci == EK_BCI)
-				b->defc = coding::findBySpec(BCI5_spec);
-			else
-				b->defc = coding::findBySpec(BRANCH5_spec);
-		}
-		break;
-		case 'O':
-			lp = parseIntLayout(lp, b, EK_INT, can_be_signed);
-			b->le_bci = EK_BCO;
-			b->defc = coding::findBySpec(BRANCH5_spec);
-			break;
-		case 'N': // replication: 'N' uint32_t '[' elem ... ']'
-			lp = parseIntLayout(lp, b, EK_REPL);
-			assert(*lp == '[');
-			++lp;
-			lp = parseLayout(lp, b->le_body, curCble);
-			break;
-		case 'T': // union: 'T' any_int union_case* '(' ')' '[' body ']'
-			lp = parseIntLayout(lp, b, EK_UN, can_be_signed);
-			{
-				int union_base = band_stack.length();
-				for (;;)
-				{ // for each case
-					band &k_case = *U_NEW(band, 1);
-					band_stack.add(&k_case);
-					k_case.le_kind = EK_CASE;
-					k_case.bn = bands_made++;
-					if (*lp++ != '(')
-					{
-						unpack_abort("bad union case");
-						return "";
-					}
-					if (*lp++ != ')')
-					{
-						--lp; // reparse
-						// Read some case values.  (Use band_stack for temp. storage.)
-						int case_base = band_stack.length();
-						for (;;)
-						{
-							int caseval = 0;
-							lp = parseNumeral(lp, caseval);
-							band_stack.add((void *)(size_t)caseval);
-							if (*lp == '-')
-							{
-								// new in version 160, allow (1-5) for (1,2,3,4,5)
-								if (u->majver < JAVA6_PACKAGE_MAJOR_VERSION)
-								{
-									unpack_abort(
-										"bad range in union case label (old archive format)");
-									return "";
-								}
-								int caselimit = caseval;
-								lp++;
-								lp = parseNumeral(lp, caselimit);
-								if (caseval >= caselimit ||
-									(uint32_t)(caselimit - caseval) > 0x10000)
-								{
-									// Note:  0x10000 is arbitrary implementation restriction.
-									// We can remove it later if it's important to.
-									unpack_abort("bad range in union case label");
-								}
-								for (;;)
-								{
-									++caseval;
-									band_stack.add((void *)(size_t)caseval);
-									if (caseval == caselimit)
-										break;
-								}
-							}
-							if (*lp != ',')
-								break;
-							lp++;
-						}
-						if (*lp++ != ')')
-						{
-							unpack_abort("bad case label");
-						}
-						// save away the case labels
-						int ntags = band_stack.length() - case_base;
-						int *tags = U_NEW(int, add_size(ntags, 1));
-						k_case.le_casetags = tags;
-						*tags++ = ntags;
-						for (int i = 0; i < ntags; i++)
-						{
-							*tags++ = ptrlowbits(band_stack.get(case_base + i));
-						}
-						band_stack.popTo(case_base);
-					}
-					// Got le_casetags.  Now grab the body.
-					assert(*lp == '[');
-					++lp;
-					lp = parseLayout(lp, k_case.le_body, curCble);
-					if (k_case.le_casetags == nullptr)
-						break; // done
-				}
-				b->le_body = popBody(union_base);
-			}
-			break;
-		case '(': // call: '(' -?NN* ')'
-		{
-			band &call = *U_NEW(band, 1);
-			band_stack.add(&call);
-			call.le_kind = EK_CALL;
-			call.bn = bands_made++;
-			call.le_body = U_NEW(band *, 2); // fill in later
-			int call_num = 0;
-			lp = parseNumeral(lp, call_num);
-			call.le_back = (call_num <= 0);
-			call_num += curCble;	// numeral is self-relative offset
-			call.le_len = call_num; // use le_len as scratch
-			calls_to_link.add(&call);
-			if (*lp++ != ')')
-			{
-				unpack_abort("bad call label");
-			}
-		}
-		break;
-		case 'K': // reference_type: constant_ref
-		case 'R': // reference_type: schema_ref
-		{
-			int ixTag = CONSTANT_None;
-			if (lp[-1] == 'K')
-			{
-				switch (*lp++)
-				{
-				case 'I':
-					ixTag = CONSTANT_Integer;
-					break;
-				case 'J':
-					ixTag = CONSTANT_Long;
-					break;
-				case 'F':
-					ixTag = CONSTANT_Float;
-					break;
-				case 'D':
-					ixTag = CONSTANT_Double;
-					break;
-				case 'S':
-					ixTag = CONSTANT_String;
-					break;
-				case 'Q':
-					ixTag = CONSTANT_Literal;
-					break;
-				}
-			}
-			else
-			{
-				switch (*lp++)
-				{
-				case 'C':
-					ixTag = CONSTANT_Class;
-					break;
-				case 'S':
-					ixTag = CONSTANT_Signature;
-					break;
-				case 'D':
-					ixTag = CONSTANT_NameandType;
-					break;
-				case 'F':
-					ixTag = CONSTANT_Fieldref;
-					break;
-				case 'M':
-					ixTag = CONSTANT_Methodref;
-					break;
-				case 'I':
-					ixTag = CONSTANT_InterfaceMethodref;
-					break;
-				case 'U':
-					ixTag = CONSTANT_Utf8;
-					break; // utf8_ref
-				case 'Q':
-					ixTag = CONSTANT_All;
-					break; // untyped_ref
-				}
-			}
-			if (ixTag == CONSTANT_None)
-			{
-				unpack_abort("bad reference layout");
-				break;
-			}
-			bool nullOK = false;
-			if (*lp == 'N')
-			{
-				nullOK = true;
-				lp++;
-			}
-			lp = parseIntLayout(lp, b, EK_REF);
-			b->defc = coding::findBySpec(UNSIGNED5_spec);
-			b->initRef(ixTag, nullOK);
-		}
-		break;
-		case '[':
-		{
-			// [callable1][callable2]...
-			if (!top_level)
-			{
-				unpack_abort("bad nested callable");
-				break;
-			}
-			curCble += 1;
-			band &cble = *U_NEW(band, 1);
-			band_stack.add(&cble);
-			cble.le_kind = EK_CBLE;
-			cble.bn = bands_made++;
-			lp = parseLayout(lp, cble.le_body, curCble);
-		}
-		break;
-		case ']':
-			// Hit a closing brace.  This ends whatever body we were in.
-			done = true;
-			break;
-		case '\0':
-			// Hit a nullptr.  Also ends the (top-level) body.
-			--lp; // back up, so caller can see the nullptr also
-			done = true;
-			break;
-		default:
-			unpack_abort("bad layout");
-		}
-	}
-
-	// Return the accumulated bands:
-	res = popBody(bs_base);
-	return lp;
-}
-
-void unpacker::read_attr_defs()
-{
-	int i;
-
-	// Tell each AD which attrc it is and where its fixed flags are:
-	attr_defs[ATTR_CONTEXT_CLASS].attrc = ATTR_CONTEXT_CLASS;
-	attr_defs[ATTR_CONTEXT_CLASS].xxx_flags_hi_bn = e_class_flags_hi;
-	attr_defs[ATTR_CONTEXT_FIELD].attrc = ATTR_CONTEXT_FIELD;
-	attr_defs[ATTR_CONTEXT_FIELD].xxx_flags_hi_bn = e_field_flags_hi;
-	attr_defs[ATTR_CONTEXT_METHOD].attrc = ATTR_CONTEXT_METHOD;
-	attr_defs[ATTR_CONTEXT_METHOD].xxx_flags_hi_bn = e_method_flags_hi;
-	attr_defs[ATTR_CONTEXT_CODE].attrc = ATTR_CONTEXT_CODE;
-	attr_defs[ATTR_CONTEXT_CODE].xxx_flags_hi_bn = e_code_flags_hi;
-
-	// Decide whether bands for the optional high flag words are present.
-	attr_defs[ATTR_CONTEXT_CLASS]
-		.setHaveLongFlags((archive_options & AO_HAVE_CLASS_FLAGS_HI) != 0);
-	attr_defs[ATTR_CONTEXT_FIELD]
-		.setHaveLongFlags((archive_options & AO_HAVE_FIELD_FLAGS_HI) != 0);
-	attr_defs[ATTR_CONTEXT_METHOD]
-		.setHaveLongFlags((archive_options & AO_HAVE_METHOD_FLAGS_HI) != 0);
-	attr_defs[ATTR_CONTEXT_CODE]
-		.setHaveLongFlags((archive_options & AO_HAVE_CODE_FLAGS_HI) != 0);
-
-	// Set up built-in attrs.
-	// (The simple ones are hard-coded.  The metadata layouts are not.)
-	const char *md_layout = (
-// parameter annotations:
-#define MDL0 "[NB[(1)]]"
-		MDL0
-// annotations:
-#define MDL1                                                                                   \
-	"[NH[(1)]]"                                                                                \
-	"[RSHNH[RUH(1)]]"
-			MDL1
-		// member_value:
-		"[TB"
-		"(66,67,73,83,90)[KIH]"
-		"(68)[KDH]"
-		"(70)[KFH]"
-		"(74)[KJH]"
-		"(99)[RSH]"
-		"(101)[RSHRUH]"
-		"(115)[RUH]"
-		"(91)[NH[(0)]]"
-		"(64)["
-		// nested annotation:
-		"RSH"
-		"NH[RUH(0)]"
-		"]"
-		"()[]"
-		"]");
-
-	const char *md_layout_P = md_layout;
-	const char *md_layout_A = md_layout + strlen(MDL0);
-	const char *md_layout_V = md_layout + strlen(MDL0 MDL1);
-	assert(0 == strncmp(&md_layout_A[-3], ")]][", 4));
-	assert(0 == strncmp(&md_layout_V[-3], ")]][", 4));
-
-	for (i = 0; i < ATTR_CONTEXT_LIMIT; i++)
-	{
-		attr_definitions &ad = attr_defs[i];
-		ad.defineLayout(X_ATTR_RuntimeVisibleAnnotations, "RuntimeVisibleAnnotations",
-						md_layout_A);
-		ad.defineLayout(X_ATTR_RuntimeInvisibleAnnotations, "RuntimeInvisibleAnnotations",
-						md_layout_A);
-		if (i != ATTR_CONTEXT_METHOD)
-			continue;
-		ad.defineLayout(METHOD_ATTR_RuntimeVisibleParameterAnnotations,
-						"RuntimeVisibleParameterAnnotations", md_layout_P);
-		ad.defineLayout(METHOD_ATTR_RuntimeInvisibleParameterAnnotations,
-						"RuntimeInvisibleParameterAnnotations", md_layout_P);
-		ad.defineLayout(METHOD_ATTR_AnnotationDefault, "AnnotationDefault", md_layout_V);
-	}
-
-	attr_definition_headers.readData(attr_definition_count);
-	attr_definition_name.readData(attr_definition_count);
-	attr_definition_layout.readData(attr_definition_count);
-
-// Initialize correct predef bits, to distinguish predefs from new defs.
-#define ORBIT(n, s) | ((uint64_t)1 << n)
-	attr_defs[ATTR_CONTEXT_CLASS].predef = (0 X_ATTR_DO(ORBIT) CLASS_ATTR_DO(ORBIT));
-	attr_defs[ATTR_CONTEXT_FIELD].predef = (0 X_ATTR_DO(ORBIT) FIELD_ATTR_DO(ORBIT));
-	attr_defs[ATTR_CONTEXT_METHOD].predef = (0 X_ATTR_DO(ORBIT) METHOD_ATTR_DO(ORBIT));
-	attr_defs[ATTR_CONTEXT_CODE].predef = (0 O_ATTR_DO(ORBIT) CODE_ATTR_DO(ORBIT));
-#undef ORBIT
-	// Clear out the redef bits, folding them back into predef.
-	for (i = 0; i < ATTR_CONTEXT_LIMIT; i++)
-	{
-		attr_defs[i].predef |= attr_defs[i].redef;
-		attr_defs[i].redef = 0;
-	}
-
-	// Now read the transmitted locally defined attrs.
-	// This will set redef bits again.
-	for (i = 0; i < attr_definition_count; i++)
-	{
-		int header = attr_definition_headers.getByte();
-		int attrc = ADH_BYTE_CONTEXT(header);
-		int idx = ADH_BYTE_INDEX(header);
-		entry *name = attr_definition_name.getRef();
-		entry *layout = attr_definition_layout.getRef();
-		attr_defs[attrc].defineLayout(idx, name, layout->value.b.strval());
-	}
-}
-
-#define NO_ENTRY_YET ((entry *)-1)
-
-static bool isDigitString(bytes &x, int beg, int end)
-{
-	if (beg == end)
-		return false; // nullptr string
-	byte *xptr = x.ptr;
-	for (int i = beg; i < end; i++)
-	{
-		char ch = xptr[i];
-		if (!(ch >= '0' && ch <= '9'))
-			return false;
-	}
-	return true;
-}
-
-enum
-{ // constants for parsing class names
-	SLASH_MIN = '.',
-	SLASH_MAX = '/',
-	DOLLAR_MIN = 0,
-	DOLLAR_MAX = '-'};
-
-static int lastIndexOf(int chmin, int chmax, bytes &x, int pos)
-{
-	byte *ptr = x.ptr;
-	for (byte *cp = ptr + pos; --cp >= ptr;)
-	{
-		assert(x.inBounds(cp));
-		if (*cp >= chmin && *cp <= chmax)
-			return (int)(cp - ptr);
-	}
-	return -1;
-}
-
-inner_class *constant_pool::getIC(entry *inner)
-{
-	if (inner == nullptr)
-		return nullptr;
-	assert(inner->tag == CONSTANT_Class);
-	if (inner->inord == NO_INORD)
-		return nullptr;
-	inner_class *ic = ic_index[inner->inord];
-	assert(ic == nullptr || ic->inner == inner);
-	return ic;
-}
-
-inner_class *constant_pool::getFirstChildIC(entry *outer)
-{
-	if (outer == nullptr)
-		return nullptr;
-	assert(outer->tag == CONSTANT_Class);
-	if (outer->inord == NO_INORD)
-		return nullptr;
-	inner_class *ic = ic_child_index[outer->inord];
-	assert(ic == nullptr || ic->outer == outer);
-	return ic;
-}
-
-inner_class *constant_pool::getNextChildIC(inner_class *child)
-{
-	inner_class *ic = child->next_sibling;
-	assert(ic == nullptr || ic->outer == child->outer);
-	return ic;
-}
-
-void unpacker::read_ics()
-{
-	int i;
-	int index_size = cp.tag_count[CONSTANT_Class];
-	inner_class **ic_index = U_NEW(inner_class *, index_size);
-	inner_class **ic_child_index = U_NEW(inner_class *, index_size);
-	cp.ic_index = ic_index;
-	cp.ic_child_index = ic_child_index;
-	ics = U_NEW(inner_class, ic_count);
-	ic_this_class.readData(ic_count);
-	ic_flags.readData(ic_count);
-	// Scan flags to get count of long-form bands.
-	int long_forms = 0;
-	for (i = 0; i < ic_count; i++)
-	{
-		int flags = ic_flags.getInt(); // may be long form!
-		if ((flags & ACC_IC_LONG_FORM) != 0)
-		{
-			long_forms += 1;
-			ics[i].name = NO_ENTRY_YET;
-		}
-		flags &= ~ACC_IC_LONG_FORM;
-		entry *inner = ic_this_class.getRef();
-		uint32_t inord = inner->inord;
-		assert(inord < (uint32_t)cp.tag_count[CONSTANT_Class]);
-		if (ic_index[inord] != nullptr)
-		{
-			unpack_abort("identical inner class");
-			break;
-		}
-		ic_index[inord] = &ics[i];
-		ics[i].inner = inner;
-		ics[i].flags = flags;
-		assert(cp.getIC(inner) == &ics[i]);
-	}
-	// ic_this_class.done();
-	// ic_flags.done();
-	ic_outer_class.readData(long_forms);
-	ic_name.readData(long_forms);
-	for (i = 0; i < ic_count; i++)
-	{
-		if (ics[i].name == NO_ENTRY_YET)
-		{
-			// Long form.
-			ics[i].outer = ic_outer_class.getRefN();
-			ics[i].name = ic_name.getRefN();
-		}
-		else
-		{
-			// Fill in outer and name based on inner.
-			bytes &n = ics[i].inner->value.b;
-			bytes pkgOuter;
-			bytes number;
-			bytes name;
-			// Parse n into pkgOuter and name (and number).
-			int dollar1, dollar2; // pointers to $ in the pattern
-			// parse n = (<pkg>/)*<outer>($<number>)?($<name>)?
-			int nlen = (int)n.len;
-			int pkglen = lastIndexOf(SLASH_MIN, SLASH_MAX, n, nlen) + 1;
-			dollar2 = lastIndexOf(DOLLAR_MIN, DOLLAR_MAX, n, nlen);
-			if (dollar2 < 0)
-			{
-				unpack_abort();
-			}
-			assert(dollar2 >= pkglen);
-			if (isDigitString(n, dollar2 + 1, nlen))
-			{
-				// n = (<pkg>/)*<outer>$<number>
-				number = n.slice(dollar2 + 1, nlen);
-				name.set(nullptr, 0);
-				dollar1 = dollar2;
-			}
-			else if (pkglen < (dollar1 = lastIndexOf(DOLLAR_MIN, DOLLAR_MAX, n, dollar2 - 1)) &&
-					 isDigitString(n, dollar1 + 1, dollar2))
-			{
-				// n = (<pkg>/)*<outer>$<number>$<name>
-				number = n.slice(dollar1 + 1, dollar2);
-				name = n.slice(dollar2 + 1, nlen);
-			}
-			else
-			{
-				// n = (<pkg>/)*<outer>$<name>
-				dollar1 = dollar2;
-				number.set(nullptr, 0);
-				name = n.slice(dollar2 + 1, nlen);
-			}
-			if (number.ptr == nullptr)
-				pkgOuter = n.slice(0, dollar1);
-			else
-				pkgOuter.set(nullptr, 0);
-
-			if (pkgOuter.ptr != nullptr)
-				ics[i].outer = cp.ensureClass(pkgOuter);
-
-			if (name.ptr != nullptr)
-				ics[i].name = cp.ensureUtf8(name);
-		}
-
-		// update child/sibling list
-		if (ics[i].outer != nullptr)
-		{
-			uint32_t outord = ics[i].outer->inord;
-			if (outord != NO_INORD)
-			{
-				assert(outord < (uint32_t)cp.tag_count[CONSTANT_Class]);
-				ics[i].next_sibling = ic_child_index[outord];
-				ic_child_index[outord] = &ics[i];
-			}
-		}
-	}
-	// ic_outer_class.done();
-	// ic_name.done();
-}
-
-void unpacker::read_classes()
-{
-	class_this.readData(class_count);
-	class_super.readData(class_count);
-	class_interface_count.readData(class_count);
-	class_interface.readData(class_interface_count.getIntTotal());
-
-#if 0
-  int i;
-  // Make a little mark on super-classes.
-  for (i = 0; i < class_count; i++) {
-    entry* e = class_super.getRefN();
-    if (e != nullptr)  e->bits |= entry::EB_SUPER;
-  }
-  class_super.rewind();
-#endif
-
-	// Members.
-	class_field_count.readData(class_count);
-	class_method_count.readData(class_count);
-
-	int field_count = class_field_count.getIntTotal();
-	int method_count = class_method_count.getIntTotal();
-
-	field_descr.readData(field_count);
-	read_attrs(ATTR_CONTEXT_FIELD, field_count);
-	method_descr.readData(method_count);
-	read_attrs(ATTR_CONTEXT_METHOD, method_count);
-	read_attrs(ATTR_CONTEXT_CLASS, class_count);
-	read_code_headers();
-}
-
-int unpacker::attr_definitions::predefCount(uint32_t idx)
-{
-	return isPredefined(idx) ? flag_count[idx] : 0;
-}
-
-void unpacker::read_attrs(int attrc, int obj_count)
-{
-	attr_definitions &ad = attr_defs[attrc];
-	assert(ad.attrc == attrc);
-
-	int i, idx, count;
-
-	bool haveLongFlags = ad.haveLongFlags();
-
-	band &xxx_flags_hi = ad.xxx_flags_hi();
-	if (haveLongFlags)
-		xxx_flags_hi.readData(obj_count);
-
-	band &xxx_flags_lo = ad.xxx_flags_lo();
-	xxx_flags_lo.readData(obj_count);
-
-	// pre-scan flags, counting occurrences of each index bit
-	uint64_t indexMask = ad.flagIndexMask(); // which flag bits are index bits?
-	for (i = 0; i < obj_count; i++)
-	{
-		uint64_t indexBits = xxx_flags_hi.getLong(xxx_flags_lo, haveLongFlags);
-		if ((indexBits & ~indexMask) > (ushort) - 1)
-		{
-			unpack_abort("undefined attribute flag bit");
-			return;
-		}
-		indexBits &= indexMask; // ignore classfile flag bits
-		for (idx = 0; indexBits != 0; idx++, indexBits >>= 1)
-		{
-			ad.flag_count[idx] += (int)(indexBits & 1);
-		}
-	}
-	// we'll scan these again later for output:
-	xxx_flags_lo.rewind();
-	xxx_flags_hi.rewind();
-
-	band &xxx_attr_count = ad.xxx_attr_count();
-	// There is one count element for each 1<<16 bit set in flags:
-	xxx_attr_count.readData(ad.predefCount(X_ATTR_OVERFLOW));
-
-	band &xxx_attr_indexes = ad.xxx_attr_indexes();
-	int overflowIndexCount = xxx_attr_count.getIntTotal();
-	xxx_attr_indexes.readData(overflowIndexCount);
-	// pre-scan attr indexes, counting occurrences of each value
-	for (i = 0; i < overflowIndexCount; i++)
-	{
-		idx = xxx_attr_indexes.getInt();
-		if (!ad.isIndex(idx))
-		{
-			unpack_abort("attribute index out of bounds");
-			return;
-		}
-		ad.getCount(idx) += 1;
-	}
-	xxx_attr_indexes.rewind(); // we'll scan it again later for output
-
-	// We will need a backward call count for each used backward callable.
-	int backwardCounts = 0;
-	for (idx = 0; idx < ad.layouts.length(); idx++)
-	{
-		layout_definition *lo = ad.getLayout(idx);
-		if (lo != nullptr && ad.getCount(idx) != 0)
-		{
-			// Build the bands lazily, only when they are used.
-			band **bands = ad.buildBands(lo);
-			if (lo->hasCallables())
-			{
-				for (i = 0; bands[i] != nullptr; i++)
-				{
-					if (bands[i]->le_back)
-					{
-						assert(bands[i]->le_kind == EK_CBLE);
-						backwardCounts += 1;
-					}
-				}
-			}
-		}
-	}
-	ad.xxx_attr_calls().readData(backwardCounts);
-
-	// Read built-in bands.
-	// Mostly, these are hand-coded equivalents to readBandData().
-	switch (attrc)
-	{
-	case ATTR_CONTEXT_CLASS:
-
-		count = ad.predefCount(CLASS_ATTR_SourceFile);
-		class_SourceFile_RUN.readData(count);
-
-		count = ad.predefCount(CLASS_ATTR_EnclosingMethod);
-		class_EnclosingMethod_RC.readData(count);
-		class_EnclosingMethod_RDN.readData(count);
-
-		count = ad.predefCount(X_ATTR_Signature);
-		class_Signature_RS.readData(count);
-
-		ad.readBandData(X_ATTR_RuntimeVisibleAnnotations);
-		ad.readBandData(X_ATTR_RuntimeInvisibleAnnotations);
-
-		count = ad.predefCount(CLASS_ATTR_InnerClasses);
-		class_InnerClasses_N.readData(count);
-
-		count = class_InnerClasses_N.getIntTotal();
-		class_InnerClasses_RC.readData(count);
-		class_InnerClasses_F.readData(count);
-
-		// Drop remaining columns wherever flags are zero:
-		count -= class_InnerClasses_F.getIntCount(0);
-		class_InnerClasses_outer_RCN.readData(count);
-		class_InnerClasses_name_RUN.readData(count);
-
-		count = ad.predefCount(CLASS_ATTR_ClassFile_version);
-		class_ClassFile_version_minor_H.readData(count);
-		class_ClassFile_version_major_H.readData(count);
-		break;
-
-	case ATTR_CONTEXT_FIELD:
-
-		count = ad.predefCount(FIELD_ATTR_ConstantValue);
-		field_ConstantValue_KQ.readData(count);
-
-		count = ad.predefCount(X_ATTR_Signature);
-		field_Signature_RS.readData(count);
-
-		ad.readBandData(X_ATTR_RuntimeVisibleAnnotations);
-		ad.readBandData(X_ATTR_RuntimeInvisibleAnnotations);
-		break;
-
-	case ATTR_CONTEXT_METHOD:
-
-		code_count = ad.predefCount(METHOD_ATTR_Code);
-		// Code attrs are handled very specially below...
-
-		count = ad.predefCount(METHOD_ATTR_Exceptions);
-		method_Exceptions_N.readData(count);
-		count = method_Exceptions_N.getIntTotal();
-		method_Exceptions_RC.readData(count);
-
-		count = ad.predefCount(X_ATTR_Signature);
-		method_Signature_RS.readData(count);
-
-		ad.readBandData(X_ATTR_RuntimeVisibleAnnotations);
-		ad.readBandData(X_ATTR_RuntimeInvisibleAnnotations);
-		ad.readBandData(METHOD_ATTR_RuntimeVisibleParameterAnnotations);
-		ad.readBandData(METHOD_ATTR_RuntimeInvisibleParameterAnnotations);
-		ad.readBandData(METHOD_ATTR_AnnotationDefault);
-		break;
-
-	case ATTR_CONTEXT_CODE:
-		// (keep this code aligned with its brother in unpacker::write_attrs)
-		count = ad.predefCount(CODE_ATTR_StackMapTable);
-		// disable this feature in old archives!
-		if (count != 0 && majver < JAVA6_PACKAGE_MAJOR_VERSION)
-		{
-			unpack_abort("undefined StackMapTable attribute (old archive format)");
-			return;
-		}
-		code_StackMapTable_N.readData(count);
-		count = code_StackMapTable_N.getIntTotal();
-		code_StackMapTable_frame_T.readData(count);
-		// the rest of it depends in a complicated way on frame tags
-		{
-			int fat_frame_count = 0;
-			int offset_count = 0;
-			int type_count = 0;
-			for (int k = 0; k < count; k++)
-			{
-				int tag = code_StackMapTable_frame_T.getByte();
-				if (tag <= 127)
-				{
-					// (64-127)  [(2)]
-					if (tag >= 64)
-						type_count++;
-				}
-				else if (tag <= 251)
-				{
-					// (247)     [(1)(2)]
-					// (248-251) [(1)]
-					if (tag >= 247)
-						offset_count++;
-					if (tag == 247)
-						type_count++;
-				}
-				else if (tag <= 254)
-				{
-					// (252)     [(1)(2)]
-					// (253)     [(1)(2)(2)]
-					// (254)     [(1)(2)(2)(2)]
-					offset_count++;
-					type_count += (tag - 251);
-				}
-				else
-				{
-					// (255)     [(1)NH[(2)]NH[(2)]]
-					fat_frame_count++;
-				}
-			}
-
-			// done pre-scanning frame tags:
-			code_StackMapTable_frame_T.rewind();
-
-			// deal completely with fat frames:
-			offset_count += fat_frame_count;
-			code_StackMapTable_local_N.readData(fat_frame_count);
-			type_count += code_StackMapTable_local_N.getIntTotal();
-			code_StackMapTable_stack_N.readData(fat_frame_count);
-			type_count += code_StackMapTable_stack_N.getIntTotal();
-			// read the rest:
-			code_StackMapTable_offset.readData(offset_count);
-			code_StackMapTable_T.readData(type_count);
-			// (7) [RCH]
-			count = code_StackMapTable_T.getIntCount(7);
-			code_StackMapTable_RC.readData(count);
-			// (8) [PH]
-			count = code_StackMapTable_T.getIntCount(8);
-			code_StackMapTable_P.readData(count);
-		}
-
-		count = ad.predefCount(CODE_ATTR_LineNumberTable);
-		code_LineNumberTable_N.readData(count);
-		count = code_LineNumberTable_N.getIntTotal();
-		code_LineNumberTable_bci_P.readData(count);
-		code_LineNumberTable_line.readData(count);
-
-		count = ad.predefCount(CODE_ATTR_LocalVariableTable);
-		code_LocalVariableTable_N.readData(count);
-		count = code_LocalVariableTable_N.getIntTotal();
-		code_LocalVariableTable_bci_P.readData(count);
-		code_LocalVariableTable_span_O.readData(count);
-		code_LocalVariableTable_name_RU.readData(count);
-		code_LocalVariableTable_type_RS.readData(count);
-		code_LocalVariableTable_slot.readData(count);
-
-		count = ad.predefCount(CODE_ATTR_LocalVariableTypeTable);
-		code_LocalVariableTypeTable_N.readData(count);
-		count = code_LocalVariableTypeTable_N.getIntTotal();
-		code_LocalVariableTypeTable_bci_P.readData(count);
-		code_LocalVariableTypeTable_span_O.readData(count);
-		code_LocalVariableTypeTable_name_RU.readData(count);
-		code_LocalVariableTypeTable_type_RS.readData(count);
-		code_LocalVariableTypeTable_slot.readData(count);
-		break;
-	}
-
-	// Read compressor-defined bands.
-	for (idx = 0; idx < ad.layouts.length(); idx++)
-	{
-		if (ad.getLayout(idx) == nullptr)
-			continue; // none at this fixed index <32
-		if (idx < (int)ad.flag_limit && ad.isPredefined(idx))
-			continue; // already handled
-		if (ad.getCount(idx) == 0)
-			continue; // no attributes of this type (then why transmit layouts?)
-		ad.readBandData(idx);
-	}
-}
-
-void unpacker::attr_definitions::readBandData(int idx)
-{
-	int j;
-	uint32_t count = getCount(idx);
-	if (count == 0)
-		return;
-	layout_definition *lo = getLayout(idx);
-	bool hasCallables = lo->hasCallables();
-	band **bands = lo->bands();
-	if (!hasCallables)
-	{
-		// Read through the rest of the bands in a regular way.
-		readBandData(bands, count);
-	}
-	else
-	{
-		// Deal with the callables.
-		// First set up the forward entry count for each callable.
-		// This is stored on band::length of the callable.
-		bands[0]->expectMoreLength(count);
-		for (j = 0; bands[j] != nullptr; j++)
-		{
-			band &j_cble = *bands[j];
-			assert(j_cble.le_kind == EK_CBLE);
-			if (j_cble.le_back)
-			{
-				// Add in the predicted effects of backward calls, too.
-				int back_calls = xxx_attr_calls().getInt();
-				j_cble.expectMoreLength(back_calls);
-				// In a moment, more forward calls may increment j_cble.length.
-			}
-		}
-		// Now consult whichever callables have non-zero entry counts.
-		readBandData(bands, (uint32_t) - 1);
-	}
-}
-
-// Recursive helper to the previous function:
-void unpacker::attr_definitions::readBandData(band **body, uint32_t count)
-{
-	int j, k;
-	for (j = 0; body[j] != nullptr; j++)
-	{
-		band &b = *body[j];
-		if (b.defc != nullptr)
-		{
-			// It has data, so read it.
-			b.readData(count);
-		}
-		switch (b.le_kind)
-		{
-		case EK_REPL:
-		{
-			int reps = b.getIntTotal();
-			readBandData(b.le_body, reps);
-		}
-		break;
-		case EK_UN:
-		{
-			int remaining = count;
-			for (k = 0; b.le_body[k] != nullptr; k++)
-			{
-				band &k_case = *b.le_body[k];
-				int k_count = 0;
-				if (k_case.le_casetags == nullptr)
-				{
-					k_count = remaining; // last (empty) case
-				}
-				else
-				{
-					int *tags = k_case.le_casetags;
-					int ntags = *tags++; // 1st element is length (why not?)
-					while (ntags-- > 0)
-					{
-						int tag = *tags++;
-						k_count += b.getIntCount(tag);
-					}
-				}
-				readBandData(k_case.le_body, k_count);
-				remaining -= k_count;
-			}
-			assert(remaining == 0);
-		}
-		break;
-		case EK_CALL:
-			// Push the count forward, if it is not a backward call.
-			if (!b.le_back)
-			{
-				band &cble = *b.le_body[0];
-				assert(cble.le_kind == EK_CBLE);
-				cble.expectMoreLength(count);
-			}
-			break;
-		case EK_CBLE:
-			assert((int)count == -1); // incoming count is meaningless
-			k = b.length;
-			assert(k >= 0);
-			// This is intended and required for non production mode.
-			assert((b.length = -1)); // make it unable to accept more calls now.
-			readBandData(b.le_body, k);
-			break;
-		}
-	}
-}
-
-static inline band **findMatchingCase(int matchTag, band **cases)
-{
-	for (int k = 0; cases[k] != nullptr; k++)
-	{
-		band &k_case = *cases[k];
-		if (k_case.le_casetags != nullptr)
-		{
-			// If it has tags, it must match a tag.
-			int *tags = k_case.le_casetags;
-			int ntags = *tags++; // 1st element is length
-			for (; ntags > 0; ntags--)
-			{
-				int tag = *tags++;
-				if (tag == matchTag)
-					break;
-			}
-			if (ntags == 0)
-				continue; // does not match
-		}
-		return k_case.le_body;
-	}
-	return nullptr;
-}
-
-// write attribute band data:
-void unpacker::putlayout(band **body)
-{
-	int i;
-	int prevBII = -1;
-	int prevBCI = -1;
-	if (body == NULL)
-	{
-		unpack_abort("putlayout: unexpected NULL for body");
-		return;
-	}
-	for (i = 0; body[i] != nullptr; i++)
-	{
-		band &b = *body[i];
-		byte le_kind = b.le_kind;
-
-		// Handle scalar part, if any.
-		int x = 0;
-		entry *e = nullptr;
-		if (b.defc != nullptr)
-		{
-			// It has data, so unparse an element.
-			if (b.ixTag != CONSTANT_None)
-			{
-				assert(le_kind == EK_REF);
-				if (b.ixTag == CONSTANT_Literal)
-					e = b.getRefUsing(cp.getKQIndex());
-				else
-					e = b.getRefN();
-				switch (b.le_len)
-				{
-				case 0:
-					break;
-				case 1:
-					putu1ref(e);
-					break;
-				case 2:
-					putref(e);
-					break;
-				case 4:
-					putu2(0);
-					putref(e);
-					break;
-				default:
-					assert(false);
-				}
-			}
-			else
-			{
-				assert(le_kind == EK_INT || le_kind == EK_REPL || le_kind == EK_UN);
-				x = b.getInt();
-
-				assert(!b.le_bci || prevBCI == (int)to_bci(prevBII));
-				switch (b.le_bci)
-				{
-				case EK_BCI: // PH:  transmit R(bci), store bci
-					x = to_bci(prevBII = x);
-					prevBCI = x;
-					break;
-				case EK_BCID: // POH: transmit D(R(bci)), store bci
-					x = to_bci(prevBII += x);
-					prevBCI = x;
-					break;
-				case EK_BCO: // OH:  transmit D(R(bci)), store D(bci)
-					x = to_bci(prevBII += x) - prevBCI;
-					prevBCI += x;
-					break;
-				}
-				assert(!b.le_bci || prevBCI == (int)to_bci(prevBII));
-
-				switch (b.le_len)
-				{
-				case 0:
-					break;
-				case 1:
-					putu1(x);
-					break;
-				case 2:
-					putu2(x);
-					break;
-				case 4:
-					putu4(x);
-					break;
-				default:
-					assert(false);
-				}
-			}
-		}
-
-		// Handle subparts, if any.
-		switch (le_kind)
-		{
-		case EK_REPL:
-			// x is the repeat count
-			while (x-- > 0)
-			{
-				putlayout(b.le_body);
-			}
-			break;
-		case EK_UN:
-			// x is the tag
-			putlayout(findMatchingCase(x, b.le_body));
-			break;
-		case EK_CALL:
-		{
-			band &cble = *b.le_body[0];
-			assert(cble.le_kind == EK_CBLE);
-			// FIXME: hit this one
-			// assert(cble.le_len == b.le_len);
-			putlayout(cble.le_body);
-		}
-		break;
-
-		case EK_CBLE:
-		case EK_CASE:
-			assert(false); // should not reach here
-		}
-	}
-}
-
-void unpacker::read_files()
-{
-	file_name.readData(file_count);
-	if ((archive_options & AO_HAVE_FILE_SIZE_HI) != 0)
-		file_size_hi.readData(file_count);
-	file_size_lo.readData(file_count);
-	if ((archive_options & AO_HAVE_FILE_MODTIME) != 0)
-		file_modtime.readData(file_count);
-	int allFiles = file_count + class_count;
-	if ((archive_options & AO_HAVE_FILE_OPTIONS) != 0)
-	{
-		file_options.readData(file_count);
-		// FO_IS_CLASS_STUB might be set, causing overlap between classes and files
-		for (int i = 0; i < file_count; i++)
-		{
-			if ((file_options.getInt() & FO_IS_CLASS_STUB) != 0)
-			{
-				allFiles -= 1; // this one counts as both class and file
-			}
-		}
-		file_options.rewind();
-	}
-	assert((default_file_options & FO_IS_CLASS_STUB) == 0);
-	files_remaining = allFiles;
-}
-
-void unpacker::get_code_header(int &max_stack, int &max_na_locals, int &handler_count,
-							   int &cflags)
-{
-	int sc = code_headers.getByte();
-	if (sc == 0)
-	{
-		max_stack = max_na_locals = handler_count = cflags = -1;
-		return;
-	}
-	// Short code header is the usual case:
-	int nh;
-	int mod;
-	if (sc < 1 + 12 * 12)
-	{
-		sc -= 1;
-		nh = 0;
-		mod = 12;
-	}
-	else if (sc < 1 + 12 * 12 + 8 * 8)
-	{
-		sc -= 1 + 12 * 12;
-		nh = 1;
-		mod = 8;
-	}
-	else
-	{
-		assert(sc < 1 + 12 * 12 + 8 * 8 + 7 * 7);
-		sc -= 1 + 12 * 12 + 8 * 8;
-		nh = 2;
-		mod = 7;
-	}
-	max_stack = sc % mod;
-	max_na_locals = sc / mod; // caller must add static, siglen
-	handler_count = nh;
-	if ((archive_options & AO_HAVE_ALL_CODE_FLAGS) != 0)
-		cflags = -1;
-	else
-		cflags = 0; // this one has no attributes
-}
-
-// Cf. PackageReader.readCodeHeaders
-void unpacker::read_code_headers()
-{
-	code_headers.readData(code_count);
-	int totalHandlerCount = 0;
-	int totalFlagsCount = 0;
-	for (int i = 0; i < code_count; i++)
-	{
-		int max_stack, max_locals, handler_count, cflags;
-		get_code_header(max_stack, max_locals, handler_count, cflags);
-		if (max_stack < 0)
-			code_max_stack.expectMoreLength(1);
-		if (max_locals < 0)
-			code_max_na_locals.expectMoreLength(1);
-		if (handler_count < 0)
-			code_handler_count.expectMoreLength(1);
-		else
-			totalHandlerCount += handler_count;
-		if (cflags < 0)
-			totalFlagsCount += 1;
-	}
-	code_headers.rewind(); // replay later during writing
-
-	code_max_stack.readData();
-	code_max_na_locals.readData();
-	code_handler_count.readData();
-	totalHandlerCount += code_handler_count.getIntTotal();
-
-	// Read handler specifications.
-	// Cf. PackageReader.readCodeHandlers.
-	code_handler_start_P.readData(totalHandlerCount);
-	code_handler_end_PO.readData(totalHandlerCount);
-	code_handler_catch_PO.readData(totalHandlerCount);
-	code_handler_class_RCN.readData(totalHandlerCount);
-
-	read_attrs(ATTR_CONTEXT_CODE, totalFlagsCount);
-}
-
-static inline bool is_in_range(uint32_t n, uint32_t min, uint32_t max)
-{
-	return n - min <= max - min; // unsigned arithmetic!
-}
-static inline bool is_field_op(int bc)
-{
-	return is_in_range(bc, bc_getstatic, bc_putfield);
-}
-static inline bool is_invoke_init_op(int bc)
-{
-	return is_in_range(bc, _invokeinit_op, _invokeinit_limit - 1);
-}
-static inline bool is_self_linker_op(int bc)
-{
-	return is_in_range(bc, _self_linker_op, _self_linker_limit - 1);
-}
-static bool is_branch_op(int bc)
-{
-	return is_in_range(bc, bc_ifeq, bc_jsr) || is_in_range(bc, bc_ifnull, bc_jsr_w);
-}
-static bool is_local_slot_op(int bc)
-{
-	return is_in_range(bc, bc_iload, bc_aload) || is_in_range(bc, bc_istore, bc_astore) ||
-		   bc == bc_iinc || bc == bc_ret;
-}
-band *unpacker::ref_band_for_op(int bc)
-{
-	switch (bc)
-	{
-	case bc_ildc:
-	case bc_ildc_w:
-		return &bc_intref;
-	case bc_fldc:
-	case bc_fldc_w:
-		return &bc_floatref;
-	case bc_lldc2_w:
-		return &bc_longref;
-	case bc_dldc2_w:
-		return &bc_doubleref;
-	case bc_aldc:
-	case bc_aldc_w:
-		return &bc_stringref;
-	case bc_cldc:
-	case bc_cldc_w:
-		return &bc_classref;
-
-	case bc_getstatic:
-	case bc_putstatic:
-	case bc_getfield:
-	case bc_putfield:
-		return &bc_fieldref;
-
-	case bc_invokevirtual:
-	case bc_invokespecial:
-	case bc_invokestatic:
-		return &bc_methodref;
-	case bc_invokeinterface:
-		return &bc_imethodref;
-
-	case bc_new:
-	case bc_anewarray:
-	case bc_checkcast:
-	case bc_instanceof:
-	case bc_multianewarray:
-		return &bc_classref;
-	}
-	return nullptr;
-}
-
-band *unpacker::ref_band_for_self_op(int bc, bool &isAloadVar, int &origBCVar)
-{
-	if (!is_self_linker_op(bc))
-		return nullptr;
-	int idx = (bc - _self_linker_op);
-	bool isSuper = (idx >= _self_linker_super_flag);
-	if (isSuper)
-		idx -= _self_linker_super_flag;
-	bool isAload = (idx >= _self_linker_aload_flag);
-	if (isAload)
-		idx -= _self_linker_aload_flag;
-	int origBC = _first_linker_op + idx;
-	bool isField = is_field_op(origBC);
-	isAloadVar = isAload;
-	origBCVar = _first_linker_op + idx;
-	if (!isSuper)
-		return isField ? &bc_thisfield : &bc_thismethod;
-	else
-		return isField ? &bc_superfield : &bc_supermethod;
-}
-
-// Cf. PackageReader.readByteCodes
-inline // called exactly once => inline
-	void
-unpacker::read_bcs()
-{
-	// read from bc_codes and bc_case_count
-	fillbytes all_switch_ops;
-	all_switch_ops.init();
-
-	// Read directly from rp/rplimit.
-	// Do this later:  bc_codes.readData(...)
-	byte *rp0 = rp;
-
-	band *bc_which;
-	byte *opptr = rp;
-	byte *oplimit = rplimit;
-
-	bool isAload; // passed by ref and then ignored
-	int junkBC;   // passed by ref and then ignored
-	for (int k = 0; k < code_count; k++)
-	{
-		// Scan one method:
-		for (;;)
-		{
-			if (opptr + 2 > oplimit)
-			{
-				rp = opptr;
-				ensure_input(2);
-				oplimit = rplimit;
-				rp = rp0; // back up
-			}
-			if (opptr == oplimit)
-			{
-				unpack_abort();
-			}
-			int bc = *opptr++ & 0xFF;
-			bool isWide = false;
-			if (bc == bc_wide)
-			{
-				if (opptr == oplimit)
-				{
-					unpack_abort();
-				}
-				bc = *opptr++ & 0xFF;
-				isWide = true;
-			}
-			// Adjust expectations of various band sizes.
-			switch (bc)
-			{
-			case bc_tableswitch:
-			case bc_lookupswitch:
-				all_switch_ops.addByte(bc);
-				break;
-			case bc_iinc:
-				bc_local.expectMoreLength(1);
-				bc_which = isWide ? &bc_short : &bc_byte;
-				bc_which->expectMoreLength(1);
-				break;
-			case bc_sipush:
-				bc_short.expectMoreLength(1);
-				break;
-			case bc_bipush:
-				bc_byte.expectMoreLength(1);
-				break;
-			case bc_newarray:
-				bc_byte.expectMoreLength(1);
-				break;
-			case bc_multianewarray:
-				assert(ref_band_for_op(bc) == &bc_classref);
-				bc_classref.expectMoreLength(1);
-				bc_byte.expectMoreLength(1);
-				break;
-			case bc_ref_escape:
-				bc_escrefsize.expectMoreLength(1);
-				bc_escref.expectMoreLength(1);
-				break;
-			case bc_byte_escape:
-				bc_escsize.expectMoreLength(1);
-				// bc_escbyte will have to be counted too
-				break;
-			default:
-				if (is_invoke_init_op(bc))
-				{
-					bc_initref.expectMoreLength(1);
-					break;
-				}
-				bc_which = ref_band_for_self_op(bc, isAload, junkBC);
-				if (bc_which != nullptr)
-				{
-					bc_which->expectMoreLength(1);
-					break;
-				}
-				if (is_branch_op(bc))
-				{
-					bc_label.expectMoreLength(1);
-					break;
-				}
-				bc_which = ref_band_for_op(bc);
-				if (bc_which != nullptr)
-				{
-					bc_which->expectMoreLength(1);
-					assert(bc != bc_multianewarray); // handled elsewhere
-					break;
-				}
-				if (is_local_slot_op(bc))
-				{
-					bc_local.expectMoreLength(1);
-					break;
-				}
-				break;
-			case bc_end_marker:
-				// Increment k and test against code_count.
-				goto doneScanningMethod;
-			}
-		}
-	doneScanningMethod:
-	{
-	}
-	}
-
-	// Go through the formality, so we can use it in a regular fashion later:
-	assert(rp == rp0);
-	bc_codes.readData((int)(opptr - rp));
-
-	int i = 0;
-
-	// To size instruction bands correctly, we need info on switches:
-	bc_case_count.readData((int)all_switch_ops.size());
-	for (i = 0; i < (int)all_switch_ops.size(); i++)
-	{
-		int caseCount = bc_case_count.getInt();
-		int bc = all_switch_ops.getByte(i);
-		bc_label.expectMoreLength(1 + caseCount); // default label + cases
-		bc_case_value.expectMoreLength(bc == bc_tableswitch ? 1 : caseCount);
-	}
-	bc_case_count.rewind(); // uses again for output
-
-	all_switch_ops.free();
-
-	for (i = e_bc_case_value; i <= e_bc_escsize; i++)
-	{
-		all_bands[i].readData();
-	}
-
-	// The bc_escbyte band is counted by the immediately previous band.
-	bc_escbyte.readData(bc_escsize.getIntTotal());
-}
-
-void unpacker::read_bands()
-{
-	read_file_header();
-
-	if (cp.nentries == 0)
-	{
-		// read_file_header failed to read a CP, because it copied a JAR.
-		return;
-	}
-
-	// Do this after the file header has been read:
-	check_options();
-
-	read_cp();
-	read_attr_defs();
-	read_ics();
-	read_classes();
-	read_bcs();
-	read_files();
-}
-
-/// CP routines
-
-entry *&constant_pool::hashTabRef(byte tag, bytes &b)
-{
-	uint32_t hash = tag + (int)b.len;
-	for (int i = 0; i < (int)b.len; i++)
-	{
-		hash = hash * 31 + (0xFF & b.ptr[i]);
-	}
-	entry **ht = hashTab;
-	int hlen = hashTabLength;
-	assert((hlen & (hlen - 1)) == 0);   // must be power of 2
-	uint32_t hash1 = hash & (hlen - 1); // == hash % hlen
-	uint32_t hash2 = 0;				 // lazily computed (requires mod op.)
-	int probes = 0;
-	while (ht[hash1] != nullptr)
-	{
-		entry &e = *ht[hash1];
-		if (e.value.b.equals(b) && e.tag == tag)
-			break;
-		if (hash2 == 0)
-			// Note:  hash2 must be relatively prime to hlen, hence the "|1".
-			hash2 = (((hash % 499) & (hlen - 1)) | 1);
-		hash1 += hash2;
-		if (hash1 >= (uint32_t)hlen)
-			hash1 -= hlen;
-		assert(hash1 < (uint32_t)hlen);
-		assert(++probes < hlen);
-	}
-	return ht[hash1];
-}
-
-static void insert_extra(entry *e, ptrlist &extras)
-{
-	// This ordering helps implement the Pack200 requirement
-	// of a predictable CP order in the class files produced.
-	e->inord = NO_INORD; // mark as an "extra"
-	extras.add(e);
-	// Note:  We will sort the list (by string-name) later.
-}
-
-entry *constant_pool::ensureUtf8(bytes &b)
-{
-	entry *&ix = hashTabRef(CONSTANT_Utf8, b);
-	if (ix != nullptr)
-		return ix;
-	// Make one.
-	if (nentries == maxentries)
-	{
-		unpack_abort("cp utf8 overflow");
-		return &entries[tag_base[CONSTANT_Utf8]]; // return something
-	}
-	entry &e = entries[nentries++];
-	e.tag = CONSTANT_Utf8;
-	u->saveTo(e.value.b, b);
-	assert(&e >= first_extra_entry);
-	insert_extra(&e, tag_extras[CONSTANT_Utf8]);
-	return ix = &e;
-}
-
-entry *constant_pool::ensureClass(bytes &b)
-{
-	entry *&ix = hashTabRef(CONSTANT_Class, b);
-	if (ix != nullptr)
-		return ix;
-	// Make one.
-	if (nentries == maxentries)
-	{
-		unpack_abort("cp class overflow");
-		return &entries[tag_base[CONSTANT_Class]]; // return something
-	}
-	entry &e = entries[nentries++];
-	e.tag = CONSTANT_Class;
-	e.nrefs = 1;
-	e.refs = U_NEW(entry *, 1);
-	ix = &e; // hold my spot in the index
-	entry *utf = ensureUtf8(b);
-	e.refs[0] = utf;
-	e.value.b = utf->value.b;
-	assert(&e >= first_extra_entry);
-	insert_extra(&e, tag_extras[CONSTANT_Class]);
-	return &e;
-}
-
-void constant_pool::expandSignatures()
-{
-	int i;
-	int nsigs = 0;
-	int nreused = 0;
-	int first_sig = tag_base[CONSTANT_Signature];
-	int sig_limit = tag_count[CONSTANT_Signature] + first_sig;
-	fillbytes buf;
-	buf.init(1 << 10);
-	for (i = first_sig; i < sig_limit; i++)
-	{
-		entry &e = entries[i];
-		assert(e.tag == CONSTANT_Signature);
-		int refnum = 0;
-		bytes form = e.refs[refnum++]->asUtf8();
-		buf.empty();
-		for (int j = 0; j < (int)form.len; j++)
-		{
-			int c = form.ptr[j];
-			buf.addByte(c);
-			if (c == 'L')
-			{
-				entry *cls = e.refs[refnum++];
-				buf.append(cls->className()->asUtf8());
-			}
-		}
-		assert(refnum == e.nrefs);
-		bytes &sig = buf.b;
-
-		// try to find a pre-existing Utf8:
-		entry *&e2 = hashTabRef(CONSTANT_Utf8, sig);
-		if (e2 != nullptr)
-		{
-			assert(e2->isUtf8(sig));
-			e.value.b = e2->value.b;
-			e.refs[0] = e2;
-			e.nrefs = 1;
-			nreused++;
-		}
-		else
-		{
-			// there is no other replacement; reuse this CP entry as a Utf8
-			u->saveTo(e.value.b, sig);
-			e.tag = CONSTANT_Utf8;
-			e.nrefs = 0;
-			e2 = &e;
-		}
-		nsigs++;
-	}
-	buf.free();
-
-	// go expunge all references to remaining signatures:
-	for (i = 0; i < (int)nentries; i++)
-	{
-		entry &e = entries[i];
-		for (int j = 0; j < e.nrefs; j++)
-		{
-			entry *&e2 = e.refs[j];
-			if (e2 != nullptr && e2->tag == CONSTANT_Signature)
-				e2 = e2->refs[0];
-		}
-	}
-}
-
-void constant_pool::initMemberIndexes()
-{
-	// This function does NOT refer to any class schema.
-	// It is totally internal to the cpool.
-	int i, j;
-
-	// Get the pre-existing indexes:
-	int nclasses = tag_count[CONSTANT_Class];
-	// entry *classes = tag_base[CONSTANT_Class] + entries; // UNUSED
-	int nfields = tag_count[CONSTANT_Fieldref];
-	entry *fields = tag_base[CONSTANT_Fieldref] + entries;
-	int nmethods = tag_count[CONSTANT_Methodref];
-	entry *methods = tag_base[CONSTANT_Methodref] + entries;
-
-	int *field_counts = T_NEW(int, nclasses);
-	int *method_counts = T_NEW(int, nclasses);
-	cpindex *all_indexes = U_NEW(cpindex, nclasses * 2);
-	entry **field_ix = U_NEW(entry *, add_size(nfields, nclasses));
-	entry **method_ix = U_NEW(entry *, add_size(nmethods, nclasses));
-
-	for (j = 0; j < nfields; j++)
-	{
-		entry &f = fields[j];
-		i = f.memberClass()->inord;
-		assert(i < nclasses);
-		field_counts[i]++;
-	}
-	for (j = 0; j < nmethods; j++)
-	{
-		entry &m = methods[j];
-		i = m.memberClass()->inord;
-		assert(i < nclasses);
-		method_counts[i]++;
-	}
-
-	int fbase = 0, mbase = 0;
-	for (i = 0; i < nclasses; i++)
-	{
-		int fc = field_counts[i];
-		int mc = method_counts[i];
-		all_indexes[i * 2 + 0].init(fc, field_ix + fbase, CONSTANT_Fieldref + SUBINDEX_BIT);
-		all_indexes[i * 2 + 1].init(mc, method_ix + mbase, CONSTANT_Methodref + SUBINDEX_BIT);
-		// reuse field_counts and member_counts as fill pointers:
-		field_counts[i] = fbase;
-		method_counts[i] = mbase;
-		fbase += fc + 1;
-		mbase += mc + 1;
-		// (the +1 leaves a space between every subarray)
-	}
-	assert(fbase == nfields + nclasses);
-	assert(mbase == nmethods + nclasses);
-
-	for (j = 0; j < nfields; j++)
-	{
-		entry &f = fields[j];
-		i = f.memberClass()->inord;
-		field_ix[field_counts[i]++] = &f;
-	}
-	for (j = 0; j < nmethods; j++)
-	{
-		entry &m = methods[j];
-		i = m.memberClass()->inord;
-		method_ix[method_counts[i]++] = &m;
-	}
-
-	member_indexes = all_indexes;
-
-	// Free intermediate buffers.
-	u->free_temps();
-}
-
-void entry::requestOutputIndex(constant_pool &cp, int req)
-{
-	assert(outputIndex <= NOT_REQUESTED); // must not have assigned indexes yet
-	if (tag == CONSTANT_Signature)
-	{
-		ref(0)->requestOutputIndex(cp, req);
-		return;
-	}
-	assert(req == REQUESTED || req == REQUESTED_LDC);
-	if (outputIndex != NOT_REQUESTED)
-	{
-		if (req == REQUESTED_LDC)
-			outputIndex = req; // this kind has precedence
-		return;
-	}
-	outputIndex = req;
-	// assert(!cp.outputEntries.contains(this));
-	assert(tag != CONSTANT_Signature);
-	cp.outputEntries.add(this);
-	for (int j = 0; j < nrefs; j++)
-	{
-		ref(j)->requestOutputIndex(cp);
-	}
-}
-
-void constant_pool::resetOutputIndexes()
-{
-	int i;
-	int noes = outputEntries.length();
-	entry **oes = (entry **)outputEntries.base();
-	for (i = 0; i < noes; i++)
-	{
-		entry &e = *oes[i];
-		e.outputIndex = NOT_REQUESTED;
-	}
-	outputIndexLimit = 0;
-	outputEntries.empty();
-}
-
-static const byte TAG_ORDER[CONSTANT_Limit] = {0, 1, 0, 2, 3, 4, 5, 7, 6, 10, 11, 12, 9, 8};
-
-extern "C" int outputEntry_cmp(const void *e1p, const void *e2p)
-{
-	// Sort entries according to the Pack200 rules for deterministic
-	// constant pool ordering.
-	//
-	// The four sort keys as follows, in order of decreasing importance:
-	//   1. ldc first, then non-ldc guys
-	//   2. normal cp_All entries by input order (i.e., address order)
-	//   3. after that, extra entries by lexical order (as in tag_extras[*])
-	entry &e1 = *(entry *)*(void **)e1p;
-	entry &e2 = *(entry *)*(void **)e2p;
-	int oi1 = e1.outputIndex;
-	int oi2 = e2.outputIndex;
-	assert(oi1 == REQUESTED || oi1 == REQUESTED_LDC);
-	assert(oi2 == REQUESTED || oi2 == REQUESTED_LDC);
-	if (oi1 != oi2)
-	{
-		if (oi1 == REQUESTED_LDC)
-			return 0 - 1;
-		if (oi2 == REQUESTED_LDC)
-			return 1 - 0;
-		// Else fall through; neither is an ldc request.
-	}
-	if (e1.inord != NO_INORD || e2.inord != NO_INORD)
-	{
-		// One or both is normal.  Use input order.
-		if (&e1 > &e2)
-			return 1 - 0;
-		if (&e1 < &e2)
-			return 0 - 1;
-		return 0; // equal pointers
-	}
-	// Both are extras.  Sort by tag and then by value.
-	if (e1.tag != e2.tag)
-	{
-		return TAG_ORDER[e1.tag] - TAG_ORDER[e2.tag];
-	}
-	// If the tags are the same, use string comparison.
-	return compare_Utf8_chars(e1.value.b, e2.value.b);
-}
-
-void constant_pool::computeOutputIndexes()
-{
-	int i;
-
-	int noes = outputEntries.length();
-	entry **oes = (entry **)outputEntries.base();
-
-	// Sort the output constant pool into the order required by Pack200.
-	PTRLIST_QSORT(outputEntries, outputEntry_cmp);
-
-	// Allocate a new index for each entry that needs one.
-	// We do this in two passes, one for LDC entries and one for the rest.
-	int nextIndex = 1; // always skip index #0 in output cpool
-	for (i = 0; i < noes; i++)
-	{
-		entry &e = *oes[i];
-		assert(e.outputIndex == REQUESTED || e.outputIndex == REQUESTED_LDC);
-		e.outputIndex = nextIndex++;
-		if (e.isDoubleWord())
-			nextIndex++; // do not use the next index
-	}
-	outputIndexLimit = nextIndex;
-}
-
-// Unpacker Start
-// Deallocate all internal storage and reset to a clean state.
-// Do not disturb any input or output connections, including
-// infileptr, inbytes, read_input_fn, jarout, or errstrm.
-// Do not reset any unpack options.
-void unpacker::reset()
-{
-	bytes_read_before_reset += bytes_read;
-	bytes_written_before_reset += bytes_written;
-	files_written_before_reset += files_written;
-	classes_written_before_reset += classes_written;
-	segments_read_before_reset += 1;
-	if (verbose >= 2)
-	{
-		fprintf(stderr, "After segment %d, " LONG_LONG_FORMAT
-						" bytes read and " LONG_LONG_FORMAT " bytes written.\n",
-				segments_read_before_reset - 1, bytes_read_before_reset,
-				bytes_written_before_reset);
-		fprintf(stderr,
-				"After segment %d, %d files (of which %d are classes) written to output.\n",
-				segments_read_before_reset - 1, files_written_before_reset,
-				classes_written_before_reset);
-		if (archive_next_count != 0)
-		{
-			fprintf(stderr, "After segment %d, %d segment%s remaining (estimated).\n",
-					segments_read_before_reset - 1, archive_next_count,
-					archive_next_count == 1 ? "" : "s");
-		}
-	}
-
-	unpacker save_u = (*this); // save bytewise image
-	infileptr = nullptr;	   // make asserts happy
-	jarout = nullptr;		  // do not close the output jar
-	gzin = nullptr;			// do not close the input gzip stream
-	this->free();
-	this->init(read_input_fn);
-
-	// restore selected interface state:
-	infileptr = save_u.infileptr;
-	inbytes = save_u.inbytes;
-	jarout = save_u.jarout;
-	gzin = save_u.gzin;
-	verbose = save_u.verbose;
-	deflate_hint_or_zero = save_u.deflate_hint_or_zero;
-	modification_time_or_zero = save_u.modification_time_or_zero;
-	bytes_read_before_reset = save_u.bytes_read_before_reset;
-	bytes_written_before_reset = save_u.bytes_written_before_reset;
-	files_written_before_reset = save_u.files_written_before_reset;
-	classes_written_before_reset = save_u.classes_written_before_reset;
-	segments_read_before_reset = save_u.segments_read_before_reset;
-	// Note:  If we use strip_names, watch out:  They get nuked here.
-}
-
-void unpacker::init(read_input_fn_t input_fn)
-{
-	int i;
-	BYTES_OF(*this).clear();
-	this->u = this; // self-reference for U_NEW macro
-	read_input_fn = input_fn;
-	all_bands = band::makeBands(this);
-	// Make a default jar buffer; caller may safely overwrite it.
-	jarout = U_NEW(jar, 1);
-	jarout->init(this);
-	for (i = 0; i < ATTR_CONTEXT_LIMIT; i++)
-		attr_defs[i].u = u; // set up outer ptr
-}
-
-// Usage: unpack a byte buffer
-// packptr is a reference to byte buffer containing a
-// packed file and len is the length of the buffer.
-// If nullptr, the callback is used to fill an internal buffer.
-void unpacker::start(void *packptr, size_t len)
-{
-	if (packptr != nullptr && len != 0)
-	{
-		inbytes.set((byte *)packptr, len);
-	}
-	read_bands();
-}
-
-void unpacker::check_options()
-{
-	if (deflate_hint_or_zero != 0)
-	{
-		bool force_deflate_hint = (deflate_hint_or_zero > 0);
-		if (force_deflate_hint)
-			default_file_options |= FO_DEFLATE_HINT;
-		else
-			default_file_options &= ~FO_DEFLATE_HINT;
-		// Turn off per-file deflate hint by force.
-		suppress_file_options |= FO_DEFLATE_HINT;
-	}
-	if (modification_time_or_zero != 0)
-	{
-		default_file_modtime = modification_time_or_zero;
-		// Turn off per-file modtime by force.
-		archive_options &= ~AO_HAVE_FILE_MODTIME;
-	}
-}
-
-// classfile writing
-
-void unpacker::reset_cur_classfile()
-{
-	// set defaults
-	cur_class_minver = default_class_minver;
-	cur_class_majver = default_class_majver;
-
-	// reset constant pool state
-	cp.resetOutputIndexes();
-
-	// reset fixups
-	class_fixup_type.empty();
-	class_fixup_offset.empty();
-	class_fixup_ref.empty();
-	requested_ics.empty();
-}
-
-cpindex *constant_pool::getKQIndex()
-{
-	char ch = '?';
-	if (u->cur_descr != nullptr)
-	{
-		entry *type = u->cur_descr->descrType();
-		ch = type->value.b.ptr[0];
-	}
-	byte tag = CONSTANT_Integer;
-	switch (ch)
-	{
-	case 'L':
-		tag = CONSTANT_String;
-		break;
-	case 'I':
-		tag = CONSTANT_Integer;
-		break;
-	case 'J':
-		tag = CONSTANT_Long;
-		break;
-	case 'F':
-		tag = CONSTANT_Float;
-		break;
-	case 'D':
-		tag = CONSTANT_Double;
-		break;
-	case 'B':
-	case 'S':
-	case 'C':
-	case 'Z':
-		tag = CONSTANT_Integer;
-		break;
-	default:
-		unpack_abort("bad KQ reference");
-		break;
-	}
-	return getIndex(tag);
-}
-
-uint32_t unpacker::to_bci(uint32_t bii)
-{
-	uint32_t len = bcimap.length();
-	uint32_t *map = (uint32_t *)bcimap.base();
-	assert(len > 0); // must be initialized before using to_bci
-	if (bii < len)
-		return map[bii];
-	// Else it's a fractional or out-of-range BCI.
-	uint32_t key = bii - len;
-	for (int i = len;; i--)
-	{
-		if (map[i - 1] - (i - 1) <= key)
-			break;
-		else
-			--bii;
-	}
-	return bii;
-}
-
-void unpacker::put_stackmap_type()
-{
-	int tag = code_StackMapTable_T.getByte();
-	putu1(tag);
-	switch (tag)
-	{
-	case 7: // (7) [RCH]
-		putref(code_StackMapTable_RC.getRef());
-		break;
-	case 8: // (8) [PH]
-		putu2(to_bci(code_StackMapTable_P.getInt()));
-		break;
-	}
-}
-
-// Functions for writing code.
-
-void unpacker::put_label(int curIP, int size)
-{
-	code_fixup_type.addByte(size);
-	code_fixup_offset.add((int)put_empty(size));
-	code_fixup_source.add(curIP);
-}
-
-inline // called exactly once => inline
-	void
-unpacker::write_bc_ops()
-{
-	bcimap.empty();
-	code_fixup_type.empty();
-	code_fixup_offset.empty();
-	code_fixup_source.empty();
-
-	band *bc_which;
-
-	byte *opptr = bc_codes.curRP();
-	// No need for oplimit, since the codes are pre-counted.
-
-	size_t codeBase = wpoffset();
-
-	bool isAload; // copy-out result
-	int origBC;
-
-	entry *thisClass = cur_class;
-	entry *superClass = cur_super;
-	entry *newClass = nullptr; // class of last _new opcode
-
-	// overwrite any prior index on these bands; it changes w/ current class:
-	bc_thisfield.setIndex(cp.getFieldIndex(thisClass));
-	bc_thismethod.setIndex(cp.getMethodIndex(thisClass));
-	if (superClass != nullptr)
-	{
-		bc_superfield.setIndex(cp.getFieldIndex(superClass));
-		bc_supermethod.setIndex(cp.getMethodIndex(superClass));
-	}
-
-	for (int curIP = 0;; curIP++)
-	{
-		int curPC = (int)(wpoffset() - codeBase);
-		bcimap.add(curPC);
-		ensure_put_space(10); // covers most instrs w/o further bounds check
-		int bc = *opptr++ & 0xFF;
-
-		putu1_fast(bc);
-		// Note:  See '--wp' below for pseudo-bytecodes like bc_end_marker.
-
-		bool isWide = false;
-		if (bc == bc_wide)
-		{
-			bc = *opptr++ & 0xFF;
-			putu1_fast(bc);
-			isWide = true;
-		}
-		switch (bc)
-		{
-		case bc_end_marker:
-			--wp; // not really part of the code
-			assert(opptr <= bc_codes.maxRP());
-			bc_codes.curRP() = opptr; // advance over this in bc_codes
-			goto doneScanningMethod;
-		case bc_tableswitch:  // apc:  (df, lo, hi, (hi-lo+1)*(label))
-		case bc_lookupswitch: // apc:  (df, nc, nc*(case, label))
-		{
-			int caseCount = bc_case_count.getInt();
-			while (((wpoffset() - codeBase) % 4) != 0)
-				putu1_fast(0);
-			ensure_put_space(30 + caseCount * 8);
-			put_label(curIP, 4); // int df = bc_label.getInt();
-			if (bc == bc_tableswitch)
-			{
-				int lo = bc_case_value.getInt();
-				int hi = lo + caseCount - 1;
-				putu4(lo);
-				putu4(hi);
-				for (int j = 0; j < caseCount; j++)
-				{
-					put_label(curIP, 4); // int lVal = bc_label.getInt();
-										 // int cVal = lo + j;
-				}
-			}
-			else
-			{
-				putu4(caseCount);
-				for (int j = 0; j < caseCount; j++)
-				{
-					int cVal = bc_case_value.getInt();
-					putu4(cVal);
-					put_label(curIP, 4); // int lVal = bc_label.getInt();
-				}
-			}
-			assert((int)to_bci(curIP) == curPC);
-			continue;
-		}
-		case bc_iinc:
-		{
-			int local = bc_local.getInt();
-			int delta = (isWide ? bc_short : bc_byte).getInt();
-			if (isWide)
-			{
-				putu2(local);
-				putu2(delta);
-			}
-			else
-			{
-				putu1_fast(local);
-				putu1_fast(delta);
-			}
-			continue;
-		}
-		case bc_sipush:
-		{
-			int val = bc_short.getInt();
-			putu2(val);
-			continue;
-		}
-		case bc_bipush:
-		case bc_newarray:
-		{
-			int val = bc_byte.getByte();
-			putu1_fast(val);
-			continue;
-		}
-		case bc_ref_escape:
-		{
-			// Note that insnMap has one entry for this.
-			--wp; // not really part of the code
-			int size = bc_escrefsize.getInt();
-			entry *ref = bc_escref.getRefN();
-			switch (size)
-			{
-			case 1:
-				putu1ref(ref);
-				break;
-			case 2:
-				putref(ref);
-				break;
-			default:
-				assert(false);
-			}
-			continue;
-		}
-		case bc_byte_escape:
-		{
-			// Note that insnMap has one entry for all these bytes.
-			--wp; // not really part of the code
-			int size = bc_escsize.getInt();
-			ensure_put_space(size);
-			for (int j = 0; j < size; j++)
-				putu1_fast(bc_escbyte.getByte());
-			continue;
-		}
-		default:
-			if (is_invoke_init_op(bc))
-			{
-				origBC = bc_invokespecial;
-				entry *classRef;
-				switch (bc - _invokeinit_op)
-				{
-				case _invokeinit_self_option:
-					classRef = thisClass;
-					break;
-				case _invokeinit_super_option:
-					classRef = superClass;
-					break;
-				default:
-					assert(bc == _invokeinit_op + _invokeinit_new_option);
-				case _invokeinit_new_option:
-					classRef = newClass;
-					break;
-				}
-				wp[-1] = origBC; // overwrite with origBC
-				int coding = bc_initref.getInt();
-				// Find the nth overloading of <init> in classRef.
-				entry *ref = nullptr;
-				cpindex *ix = (classRef == nullptr) ? nullptr : cp.getMethodIndex(classRef);
-				for (int j = 0, which_init = 0;; j++)
-				{
-					ref = (ix == nullptr) ? nullptr : ix->get(j);
-					if (ref == nullptr)
-						break; // oops, bad input
-					assert(ref->tag == CONSTANT_Methodref);
-					if (ref->memberDescr()->descrName() == cp.sym[constant_pool::s_lt_init_gt])
-					{
-						if (which_init++ == coding)
-							break;
-					}
-				}
-				putref(ref);
-				continue;
-			}
-			bc_which = ref_band_for_self_op(bc, isAload, origBC);
-			if (bc_which != nullptr)
-			{
-				if (!isAload)
-				{
-					wp[-1] = origBC; // overwrite with origBC
-				}
-				else
-				{
-					wp[-1] = bc_aload_0; // overwrite with _aload_0
-					// Note: insnMap keeps the _aload_0 separate.
-					bcimap.add(++curPC);
-					++curIP;
-					putu1_fast(origBC);
-				}
-				entry *ref = bc_which->getRef();
-				putref(ref);
-				continue;
-			}
-			if (is_branch_op(bc))
-			{
-				// int lVal = bc_label.getInt();
-				if (bc < bc_goto_w)
-				{
-					put_label(curIP, 2); // putu2(lVal & 0xFFFF);
-				}
-				else
-				{
-					assert(bc <= bc_jsr_w);
-					put_label(curIP, 4); // putu4(lVal);
-				}
-				assert((int)to_bci(curIP) == curPC);
-				continue;
-			}
-			bc_which = ref_band_for_op(bc);
-			if (bc_which != nullptr)
-			{
-				entry *ref = bc_which->getRefCommon(bc_which->ix, bc_which->nullOK);
-				if (ref == nullptr && bc_which == &bc_classref)
-				{
-					// Shorthand for class self-references.
-					ref = thisClass;
-				}
-				origBC = bc;
-				switch (bc)
-				{
-				case bc_ildc:
-				case bc_cldc:
-				case bc_fldc:
-				case bc_aldc:
-					origBC = bc_ldc;
-					break;
-				case bc_ildc_w:
-				case bc_cldc_w:
-				case bc_fldc_w:
-				case bc_aldc_w:
-					origBC = bc_ldc_w;
-					break;
-				case bc_lldc2_w:
-				case bc_dldc2_w:
-					origBC = bc_ldc2_w;
-					break;
-				case bc_new:
-					newClass = ref;
-					break;
-				}
-				wp[-1] = origBC; // overwrite with origBC
-				if (origBC == bc_ldc)
-				{
-					putu1ref(ref);
-				}
-				else
-				{
-					putref(ref);
-				}
-				if (origBC == bc_multianewarray)
-				{
-					// Copy the trailing byte also.
-					int val = bc_byte.getByte();
-					putu1_fast(val);
-				}
-				else if (origBC == bc_invokeinterface)
-				{
-					int argSize = ref->memberDescr()->descrType()->typeSize();
-					putu1_fast(1 + argSize);
-					putu1_fast(0);
-				}
-				continue;
-			}
-			if (is_local_slot_op(bc))
-			{
-				int local = bc_local.getInt();
-				if (isWide)
-				{
-					putu2(local);
-					if (bc == bc_iinc)
-					{
-						int iVal = bc_short.getInt();
-						putu2(iVal);
-					}
-				}
-				else
-				{
-					putu1_fast(local);
-					if (bc == bc_iinc)
-					{
-						int iVal = bc_byte.getByte();
-						putu1_fast(iVal);
-					}
-				}
-				continue;
-			}
-			// Random bytecode.  Just copy it.
-			assert(bc < bc_bytecode_limit);
-		}
-	}
-doneScanningMethod:
-{
-}
-	// bcimap.add(curPC);  // PC limit is already also in map, from bc_end_marker
-
-	// Armed with a bcimap, we can now fix up all the labels.
-	for (int i = 0; i < (int)code_fixup_type.size(); i++)
-	{
-		int type = code_fixup_type.getByte(i);
-		byte *bp = wp_at(code_fixup_offset.get(i));
-		int curIP = code_fixup_source.get(i);
-		int destIP = curIP + bc_label.getInt();
-		int span = to_bci(destIP) - to_bci(curIP);
-		switch (type)
-		{
-		case 2:
-			putu2_at(bp, (ushort)span);
-			break;
-		case 4:
-			putu4_at(bp, span);
-			break;
-		default:
-			assert(false);
-		}
-	}
-}
-
-inline // called exactly once => inline
-	void
-unpacker::write_code()
-{
-	int j;
-
-	int max_stack, max_locals, handler_count, cflags;
-	get_code_header(max_stack, max_locals, handler_count, cflags);
-
-	if (max_stack < 0)
-		max_stack = code_max_stack.getInt();
-	if (max_locals < 0)
-		max_locals = code_max_na_locals.getInt();
-	if (handler_count < 0)
-		handler_count = code_handler_count.getInt();
-
-	int siglen = cur_descr->descrType()->typeSize();
-	if ((cur_descr_flags & ACC_STATIC) == 0)
-		siglen++;
-	max_locals += siglen;
-
-	putu2(max_stack);
-	putu2(max_locals);
-	size_t bcbase = put_empty(4);
-
-	// Write the bytecodes themselves.
-	write_bc_ops();
-
-	byte *bcbasewp = wp_at(bcbase);
-	putu4_at(bcbasewp, (int)(wp - (bcbasewp + 4))); // size of code attr
-
-	putu2(handler_count);
-	for (j = 0; j < handler_count; j++)
-	{
-		int bii = code_handler_start_P.getInt();
-		putu2(to_bci(bii));
-		bii += code_handler_end_PO.getInt();
-		putu2(to_bci(bii));
-		bii += code_handler_catch_PO.getInt();
-		putu2(to_bci(bii));
-		putref(code_handler_class_RCN.getRefN());
-	}
-
-	uint64_t indexBits = cflags;
-	if (cflags < 0)
-	{
-		bool haveLongFlags = attr_defs[ATTR_CONTEXT_CODE].haveLongFlags();
-		indexBits = code_flags_hi.getLong(code_flags_lo, haveLongFlags);
-	}
-	write_attrs(ATTR_CONTEXT_CODE, indexBits);
-}
-
-int unpacker::write_attrs(int attrc, uint64_t indexBits)
-{
-	if (indexBits == 0)
-	{
-		// Quick short-circuit.
-		putu2(0);
-		return 0;
-	}
-
-	attr_definitions &ad = attr_defs[attrc];
-
-	int i, j, j2, idx, count;
-
-	int oiCount = 0;
-	if (ad.isPredefined(X_ATTR_OVERFLOW) && (indexBits & ((uint64_t)1 << X_ATTR_OVERFLOW)) != 0)
-	{
-		indexBits -= ((uint64_t)1 << X_ATTR_OVERFLOW);
-		oiCount = ad.xxx_attr_count().getInt();
-	}
-
-	int bitIndexes[X_ATTR_LIMIT_FLAGS_HI];
-	int biCount = 0;
-
-	// Fill bitIndexes with index bits, in order.
-	for (idx = 0; indexBits != 0; idx++, indexBits >>= 1)
-	{
-		if ((indexBits & 1) != 0)
-			bitIndexes[biCount++] = idx;
-	}
-	assert(biCount <= (int)lengthof(bitIndexes));
-
-	// Write a provisional attribute count, perhaps to be corrected later.
-	int naOffset = (int)wpoffset();
-	int na0 = biCount + oiCount;
-	putu2(na0);
-
-	int na = 0;
-	for (i = 0; i < na0; i++)
-	{
-		if (i < biCount)
-			idx = bitIndexes[i];
-		else
-			idx = ad.xxx_attr_indexes().getInt();
-		assert(ad.isIndex(idx));
-		entry *aname = nullptr;
-		entry *ref; // scratch
-		size_t abase = put_empty(2 + 4);
-		if (idx < (int)ad.flag_limit && ad.isPredefined(idx))
-		{
-			// Switch on the attrc and idx simultaneously.
-			switch (ADH_BYTE(attrc, idx))
-			{
-
-			case ADH_BYTE(ATTR_CONTEXT_CLASS, X_ATTR_OVERFLOW) :
-			case ADH_BYTE(ATTR_CONTEXT_FIELD, X_ATTR_OVERFLOW) :
-			case ADH_BYTE(ATTR_CONTEXT_METHOD, X_ATTR_OVERFLOW) :
-			case ADH_BYTE(ATTR_CONTEXT_CODE, X_ATTR_OVERFLOW) :
-				// no attribute at all, so back up on this one
-				wp = wp_at(abase);
-				continue;
-
-			case ADH_BYTE(ATTR_CONTEXT_CLASS, CLASS_ATTR_ClassFile_version) :
-				cur_class_minver = class_ClassFile_version_minor_H.getInt();
-				cur_class_majver = class_ClassFile_version_major_H.getInt();
-				// back up; not a real attribute
-				wp = wp_at(abase);
-				continue;
-
-			case ADH_BYTE(ATTR_CONTEXT_CLASS, CLASS_ATTR_InnerClasses) :
-				// note the existence of this attr, but save for later
-				if (cur_class_has_local_ics)
-					unpack_abort("too many InnerClasses attrs");
-				cur_class_has_local_ics = true;
-				wp = wp_at(abase);
-				continue;
-
-			case ADH_BYTE(ATTR_CONTEXT_CLASS, CLASS_ATTR_SourceFile) :
-				aname = cp.sym[constant_pool::s_SourceFile];
-				ref = class_SourceFile_RUN.getRefN();
-				if (ref == nullptr)
-				{
-					bytes &n = cur_class->ref(0)->value.b;
-					// parse n = (<pkg>/)*<outer>?($<id>)*
-					int pkglen = lastIndexOf(SLASH_MIN, SLASH_MAX, n, (int)n.len) + 1;
-					bytes prefix = n.slice(pkglen, n.len);
-					for (;;)
-					{
-						// Work backwards, finding all '$', '#', etc.
-						int dollar =
-							lastIndexOf(DOLLAR_MIN, DOLLAR_MAX, prefix, (int)prefix.len);
-						if (dollar < 0)
-							break;
-						prefix = prefix.slice(0, dollar);
-					}
-					const char *suffix = ".java";
-					int len = (int)(prefix.len + strlen(suffix));
-					bytes name;
-					name.set(T_NEW(byte, add_size(len, 1)), len);
-					name.strcat(prefix).strcat(suffix);
-					ref = cp.ensureUtf8(name);
-				}
-				putref(ref);
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_CLASS, CLASS_ATTR_EnclosingMethod) :
-				aname = cp.sym[constant_pool::s_EnclosingMethod];
-				putref(class_EnclosingMethod_RC.getRefN());
-				putref(class_EnclosingMethod_RDN.getRefN());
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_FIELD, FIELD_ATTR_ConstantValue) :
-				aname = cp.sym[constant_pool::s_ConstantValue];
-				putref(field_ConstantValue_KQ.getRefUsing(cp.getKQIndex()));
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_METHOD, METHOD_ATTR_Code) :
-				aname = cp.sym[constant_pool::s_Code];
-				write_code();
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_METHOD, METHOD_ATTR_Exceptions) :
-				aname = cp.sym[constant_pool::s_Exceptions];
-				putu2(count = method_Exceptions_N.getInt());
-				for (j = 0; j < count; j++)
-				{
-					putref(method_Exceptions_RC.getRefN());
-				}
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_CODE, CODE_ATTR_StackMapTable) :
-				aname = cp.sym[constant_pool::s_StackMapTable];
-				// (keep this code aligned with its brother in unpacker::read_attrs)
-				putu2(count = code_StackMapTable_N.getInt());
-				for (j = 0; j < count; j++)
-				{
-					int tag = code_StackMapTable_frame_T.getByte();
-					putu1(tag);
-					if (tag <= 127)
-					{
-						// (64-127)  [(2)]
-						if (tag >= 64)
-							put_stackmap_type();
-					}
-					else if (tag <= 251)
-					{
-						// (247)     [(1)(2)]
-						// (248-251) [(1)]
-						if (tag >= 247)
-							putu2(code_StackMapTable_offset.getInt());
-						if (tag == 247)
-							put_stackmap_type();
-					}
-					else if (tag <= 254)
-					{
-						// (252)     [(1)(2)]
-						// (253)     [(1)(2)(2)]
-						// (254)     [(1)(2)(2)(2)]
-						putu2(code_StackMapTable_offset.getInt());
-						for (int k = (tag - 251); k > 0; k--)
-						{
-							put_stackmap_type();
-						}
-					}
-					else
-					{
-						// (255)     [(1)NH[(2)]NH[(2)]]
-						putu2(code_StackMapTable_offset.getInt());
-						putu2(j2 = code_StackMapTable_local_N.getInt());
-						while (j2-- > 0)
-							put_stackmap_type();
-						putu2(j2 = code_StackMapTable_stack_N.getInt());
-						while (j2-- > 0)
-							put_stackmap_type();
-					}
-				}
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_CODE, CODE_ATTR_LineNumberTable) :
-				aname = cp.sym[constant_pool::s_LineNumberTable];
-				putu2(count = code_LineNumberTable_N.getInt());
-				for (j = 0; j < count; j++)
-				{
-					putu2(to_bci(code_LineNumberTable_bci_P.getInt()));
-					putu2(code_LineNumberTable_line.getInt());
-				}
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_CODE, CODE_ATTR_LocalVariableTable) :
-				aname = cp.sym[constant_pool::s_LocalVariableTable];
-				putu2(count = code_LocalVariableTable_N.getInt());
-				for (j = 0; j < count; j++)
-				{
-					int bii = code_LocalVariableTable_bci_P.getInt();
-					int bci = to_bci(bii);
-					putu2(bci);
-					bii += code_LocalVariableTable_span_O.getInt();
-					putu2(to_bci(bii) - bci);
-					putref(code_LocalVariableTable_name_RU.getRefN());
-					putref(code_LocalVariableTable_type_RS.getRefN());
-					putu2(code_LocalVariableTable_slot.getInt());
-				}
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_CODE, CODE_ATTR_LocalVariableTypeTable) :
-				aname = cp.sym[constant_pool::s_LocalVariableTypeTable];
-				putu2(count = code_LocalVariableTypeTable_N.getInt());
-				for (j = 0; j < count; j++)
-				{
-					int bii = code_LocalVariableTypeTable_bci_P.getInt();
-					int bci = to_bci(bii);
-					putu2(bci);
-					bii += code_LocalVariableTypeTable_span_O.getInt();
-					putu2(to_bci(bii) - bci);
-					putref(code_LocalVariableTypeTable_name_RU.getRefN());
-					putref(code_LocalVariableTypeTable_type_RS.getRefN());
-					putu2(code_LocalVariableTypeTable_slot.getInt());
-				}
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_CLASS, X_ATTR_Signature) :
-				aname = cp.sym[constant_pool::s_Signature];
-				putref(class_Signature_RS.getRefN());
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_FIELD, X_ATTR_Signature) :
-				aname = cp.sym[constant_pool::s_Signature];
-				putref(field_Signature_RS.getRefN());
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_METHOD, X_ATTR_Signature) :
-				aname = cp.sym[constant_pool::s_Signature];
-				putref(method_Signature_RS.getRefN());
-				break;
-
-			case ADH_BYTE(ATTR_CONTEXT_CLASS, X_ATTR_Deprecated) :
-			case ADH_BYTE(ATTR_CONTEXT_FIELD, X_ATTR_Deprecated) :
-			case ADH_BYTE(ATTR_CONTEXT_METHOD, X_ATTR_Deprecated) :
-				aname = cp.sym[constant_pool::s_Deprecated];
-				// no data
-				break;
-			}
-		}
-
-		if (aname == nullptr)
-		{
-			// Unparse a compressor-defined attribute.
-			layout_definition *lo = ad.getLayout(idx);
-			if (lo == nullptr)
-			{
-				unpack_abort("bad layout index");
-				break;
-			}
-			assert((int)lo->idx == idx);
-			aname = lo->nameEntry;
-			if (aname == nullptr)
-			{
-				bytes nameb;
-				nameb.set(lo->name);
-				aname = cp.ensureUtf8(nameb);
-				// Cache the name entry for next time.
-				lo->nameEntry = aname;
-			}
-			// Execute all the layout elements.
-			band **bands = lo->bands();
-			if (lo->hasCallables())
-			{
-				band &cble = *bands[0];
-				assert(cble.le_kind == EK_CBLE);
-				bands = cble.le_body;
-			}
-			putlayout(bands);
-		}
-
-		if (aname == nullptr)
-			unpack_abort("bad attribute index");
-
-		byte *wp1 = wp;
-		wp = wp_at(abase);
-
-		// DTRT if this attr is on the strip-list.
-		// (Note that we emptied the data out of the band first.)
-		if (ad.strip_names.contains(aname))
-		{
-			continue;
-		}
-
-		// patch the name and length
-		putref(aname);
-		putu4((int)(wp1 - (wp + 4))); // put the attr size
-		wp = wp1;
-		na++; // count the attrs actually written
-	}
-
-	if (na != na0)
-		// Refresh changed count.
-		putu2_at(wp_at(naOffset), na);
-	return na;
-}
-
-void unpacker::write_members(int num, int attrc)
-{
-	attr_definitions &ad = attr_defs[attrc];
-	band &member_flags_hi = ad.xxx_flags_hi();
-	band &member_flags_lo = ad.xxx_flags_lo();
-	band &member_descr = (&member_flags_hi)[e_field_descr - e_field_flags_hi];
-	bool haveLongFlags = ad.haveLongFlags();
-
-	putu2(num);
-	uint64_t indexMask = attr_defs[attrc].flagIndexMask();
-	for (int i = 0; i < num; i++)
-	{
-		uint64_t mflags = member_flags_hi.getLong(member_flags_lo, haveLongFlags);
-		entry *mdescr = member_descr.getRef();
-		cur_descr = mdescr;
-		putu2(cur_descr_flags = (ushort)(mflags & ~indexMask));
-		putref(mdescr->descrName());
-		putref(mdescr->descrType());
-		write_attrs(attrc, (mflags & indexMask));
-	}
-	cur_descr = nullptr;
-}
-
-extern "C" int raw_address_cmp(const void *p1p, const void *p2p)
-{
-	void *p1 = *(void **)p1p;
-	void *p2 = *(void **)p2p;
-	return (p1 > p2) ? 1 : (p1 < p2) ? -1 : 0;
-}
-
-void unpacker::write_classfile_tail()
-{
-	cur_classfile_tail.empty();
-	set_output(&cur_classfile_tail);
-
-	int i, num;
-
-	attr_definitions &ad = attr_defs[ATTR_CONTEXT_CLASS];
-
-	bool haveLongFlags = ad.haveLongFlags();
-	uint64_t kflags = class_flags_hi.getLong(class_flags_lo, haveLongFlags);
-	uint64_t indexMask = ad.flagIndexMask();
-
-	cur_class = class_this.getRef();
-	cur_super = class_super.getRef();
-
-	if (cur_super == cur_class)
-		cur_super = nullptr;
-	// special representation for java/lang/Object
-
-	putu2((ushort)(kflags & ~indexMask));
-	putref(cur_class);
-	putref(cur_super);
-
-	putu2(num = class_interface_count.getInt());
-	for (i = 0; i < num; i++)
-	{
-		putref(class_interface.getRef());
-	}
-
-	write_members(class_field_count.getInt(), ATTR_CONTEXT_FIELD);
-	write_members(class_method_count.getInt(), ATTR_CONTEXT_METHOD);
-
-	cur_class_has_local_ics = false; // may be set true by write_attrs
-
-	int naOffset = (int)wpoffset();
-	int na = write_attrs(ATTR_CONTEXT_CLASS, (kflags & indexMask));
-
-// at the very last, choose which inner classes (if any) pertain to k:
-#ifdef ASSERT
-	for (i = 0; i < ic_count; i++)
-	{
-		assert(!ics[i].requested);
-	}
-#endif
-	// First, consult the global table and the local constant pool,
-	// and decide on the globally implied inner classes.
-	// (Note that we read the cpool's outputIndex fields, but we
-	// do not yet write them, since the local IC attribute might
-	// reverse a global decision to declare an IC.)
-	assert(requested_ics.length() == 0); // must start out empty
-	// Always include all members of the current class.
-	for (inner_class *child = cp.getFirstChildIC(cur_class); child != nullptr;
-		 child = cp.getNextChildIC(child))
-	{
-		child->requested = true;
-		requested_ics.add(child);
-	}
-	// And, for each inner class mentioned in the constant pool,
-	// include it and all its outers.
-	int noes = cp.outputEntries.length();
-	entry **oes = (entry **)cp.outputEntries.base();
-	for (i = 0; i < noes; i++)
-	{
-		entry &e = *oes[i];
-		if (e.tag != CONSTANT_Class)
-			continue; // wrong sort
-		for (inner_class *ic = cp.getIC(&e); ic != nullptr; ic = cp.getIC(ic->outer))
-		{
-			if (ic->requested)
-				break; // already processed
-			ic->requested = true;
-			requested_ics.add(ic);
-		}
-	}
-	int local_ics = requested_ics.length();
-	// Second, consult a local attribute (if any) and adjust the global set.
-	inner_class *extra_ics = nullptr;
-	int num_extra_ics = 0;
-	if (cur_class_has_local_ics)
-	{
-		// adjust the set of ICs by symmetric set difference w/ the locals
-		num_extra_ics = class_InnerClasses_N.getInt();
-		if (num_extra_ics == 0)
-		{
-			// Explicit zero count has an irregular meaning:  It deletes the attr.
-			local_ics = 0; // (short-circuit all tests of requested bits)
-		}
-		else
-		{
-			extra_ics = T_NEW(inner_class, num_extra_ics);
-			// Note:  extra_ics will be freed up by next call to get_next_file().
-		}
-	}
-	for (i = 0; i < num_extra_ics; i++)
-	{
-		inner_class &extra_ic = extra_ics[i];
-		extra_ic.inner = class_InnerClasses_RC.getRef();
-		// Find the corresponding equivalent global IC:
-		inner_class *global_ic = cp.getIC(extra_ic.inner);
-		int flags = class_InnerClasses_F.getInt();
-		if (flags == 0)
-		{
-			// The extra IC is simply a copy of a global IC.
-			if (global_ic == nullptr)
-			{
-				unpack_abort("bad reference to inner class");
-				break;
-			}
-			extra_ic = (*global_ic); // fill in rest of fields
-		}
-		else
-		{
-			flags &= ~ACC_IC_LONG_FORM; // clear high bit if set to get clean zero
-			extra_ic.flags = flags;
-			extra_ic.outer = class_InnerClasses_outer_RCN.getRefN();
-			extra_ic.name = class_InnerClasses_name_RUN.getRefN();
-			// Detect if this is an exact copy of the global tuple.
-			if (global_ic != nullptr)
-			{
-				if (global_ic->flags != extra_ic.flags || global_ic->outer != extra_ic.outer ||
-					global_ic->name != extra_ic.name)
-				{
-					global_ic = nullptr; // not really the same, so break the link
-				}
-			}
-		}
-		if (global_ic != nullptr && global_ic->requested)
-		{
-			// This local repetition reverses the globally implied request.
-			global_ic->requested = false;
-			extra_ic.requested = false;
-			local_ics -= 1;
-		}
-		else
-		{
-			// The global either does not exist, or is not yet requested.
-			extra_ic.requested = true;
-			local_ics += 1;
-		}
-	}
-	// Finally, if there are any that survived, put them into an attribute.
-	// (Note that a zero-count attribute is always deleted.)
-	// The putref calls below will tell the constant pool to add any
-	// necessary local CP references to support the InnerClasses attribute.
-	// This step must be the last round of additions to the local CP.
-	if (local_ics > 0)
-	{
-		// append the new attribute:
-		putref(cp.sym[constant_pool::s_InnerClasses]);
-		putu4(2 + 2 * 4 * local_ics);
-		putu2(local_ics);
-		PTRLIST_QSORT(requested_ics, raw_address_cmp);
-		int num_global_ics = requested_ics.length();
-		for (i = -num_global_ics; i < num_extra_ics; i++)
-		{
-			inner_class *ic;
-			if (i < 0)
-				ic = (inner_class *)requested_ics.get(num_global_ics + i);
-			else
-				ic = &extra_ics[i];
-			if (ic->requested)
-			{
-				putref(ic->inner);
-				putref(ic->outer);
-				putref(ic->name);
-				putu2(ic->flags);
-			}
-		}
-		putu2_at(wp_at(naOffset), ++na); // increment class attr count
-	}
-
-	// Tidy up global 'requested' bits:
-	for (i = requested_ics.length(); --i >= 0;)
-	{
-		inner_class *ic = (inner_class *)requested_ics.get(i);
-		ic->requested = false;
-	}
-	requested_ics.empty();
-
-	close_output();
-
-	// rewrite CP references in the tail
-	cp.computeOutputIndexes();
-	int nextref = 0;
-	for (i = 0; i < (int)class_fixup_type.size(); i++)
-	{
-		int type = class_fixup_type.getByte(i);
-		byte *fixp = wp_at(class_fixup_offset.get(i));
-		entry *e = (entry *)class_fixup_ref.get(nextref++);
-		int idx = e->getOutputIndex();
-		switch (type)
-		{
-		case 1:
-			putu1_at(fixp, idx);
-			break;
-		case 2:
-			putu2_at(fixp, idx);
-			break;
-		default:
-			assert(false); // should not reach here
-		}
-	}
-}
-
-void unpacker::write_classfile_head()
-{
-	cur_classfile_head.empty();
-	set_output(&cur_classfile_head);
-
-	putu4(JAVA_MAGIC);
-	putu2(cur_class_minver);
-	putu2(cur_class_majver);
-	putu2(cp.outputIndexLimit);
-
-	int checkIndex = 1;
-	int noes = cp.outputEntries.length();
-	entry **oes = (entry **)cp.outputEntries.base();
-	for (int i = 0; i < noes; i++)
-	{
-		entry &e = *oes[i];
-		assert(e.getOutputIndex() == checkIndex++);
-		byte tag = e.tag;
-		assert(tag != CONSTANT_Signature);
-		putu1(tag);
-		switch (tag)
-		{
-		case CONSTANT_Utf8:
-			putu2((int)e.value.b.len);
-			put_bytes(e.value.b);
-			break;
-		case CONSTANT_Integer:
-		case CONSTANT_Float:
-			putu4(e.value.i);
-			break;
-		case CONSTANT_Long:
-		case CONSTANT_Double:
-			putu8(e.value.l);
-			assert(checkIndex++);
-			break;
-		case CONSTANT_Class:
-		case CONSTANT_String:
-			// just write the ref
-			putu2(e.refs[0]->getOutputIndex());
-			break;
-		case CONSTANT_Fieldref:
-		case CONSTANT_Methodref:
-		case CONSTANT_InterfaceMethodref:
-		case CONSTANT_NameandType:
-			putu2(e.refs[0]->getOutputIndex());
-			putu2(e.refs[1]->getOutputIndex());
-			break;
-		default:
-			unpack_abort(ERROR_INTERNAL);
-		}
-	}
-	close_output();
-}
-
-unpacker::file *unpacker::get_next_file()
-{
-	free_temps();
-	if (files_remaining == 0)
-	{
-		// Leave a clue that we're exhausted.
-		cur_file.name = nullptr;
-		cur_file.size = 0;
-		if (archive_size != 0)
-		{
-			uint64_t predicted_size = unsized_bytes_read + archive_size;
-			if (predicted_size != bytes_read)
-				unpack_abort("archive header had incorrect size");
-		}
-		return nullptr;
-	}
-	files_remaining -= 1;
-	assert(files_written < file_count || classes_written < class_count);
-	cur_file.name = "";
-	cur_file.size = 0;
-	cur_file.modtime = default_file_modtime;
-	cur_file.options = default_file_options;
-	cur_file.data[0].set(nullptr, 0);
-	cur_file.data[1].set(nullptr, 0);
-	if (files_written < file_count)
-	{
-		entry *e = file_name.getRef();
-		cur_file.name = e->utf8String();
-		bool haveLongSize = ((archive_options & AO_HAVE_FILE_SIZE_HI) != 0);
-		cur_file.size = file_size_hi.getLong(file_size_lo, haveLongSize);
-		if ((archive_options & AO_HAVE_FILE_MODTIME) != 0)
-			cur_file.modtime += file_modtime.getInt(); // relative to archive modtime
-		if ((archive_options & AO_HAVE_FILE_OPTIONS) != 0)
-			cur_file.options |= file_options.getInt() & ~suppress_file_options;
-	}
-	else if (classes_written < class_count)
-	{
-		// there is a class for a missing file record
-		cur_file.options |= FO_IS_CLASS_STUB;
-	}
-	if ((cur_file.options & FO_IS_CLASS_STUB) != 0)
-	{
-		assert(classes_written < class_count);
-		classes_written += 1;
-		if (cur_file.size != 0)
-		{
-			unpack_abort("class file size transmitted");
-		}
-		reset_cur_classfile();
-
-		// write the meat of the classfile:
-		write_classfile_tail();
-		cur_file.data[1] = cur_classfile_tail.b;
-
-		// write the CP of the classfile, second:
-		write_classfile_head();
-		cur_file.data[0] = cur_classfile_head.b;
-
-		cur_file.size += cur_file.data[0].len;
-		cur_file.size += cur_file.data[1].len;
-		if (cur_file.name[0] == '\0')
-		{
-			bytes &prefix = cur_class->ref(0)->value.b;
-			const char *suffix = ".class";
-			int len = (int)(prefix.len + strlen(suffix));
-			bytes name;
-			name.set(T_NEW(byte, add_size(len, 1)), len);
-			cur_file.name = name.strcat(prefix).strcat(suffix).strval();
-		}
-	}
-	else
-	{
-		// If there is buffered file data, produce a pointer to it.
-		if (cur_file.size != (size_t)cur_file.size)
-		{
-			// Silly size specified.
-			unpack_abort("resource file too large");
-		}
-		size_t rpleft = input_remaining();
-		if (rpleft > 0)
-		{
-			if (rpleft > cur_file.size)
-				rpleft = (size_t)cur_file.size;
-			cur_file.data[0].set(rp, rpleft);
-			rp += rpleft;
-		}
-		if (rpleft < cur_file.size)
-		{
-			// Caller must read the rest.
-			size_t fleft = (size_t)cur_file.size - rpleft;
-			bytes_read += fleft; // Credit it to the overall archive size.
-		}
-	}
-	bytes_written += cur_file.size;
-	files_written += 1;
-	return &cur_file;
-}
-
-// Write a file to jarout.
-void unpacker::write_file_to_jar(unpacker::file *f)
-{
-	size_t htsize = f->data[0].len + f->data[1].len;
-	uint64_t fsize = f->size;
-	if (htsize == fsize)
-	{
-		jarout->addJarEntry(f->name, f->deflate_hint(), f->modtime, f->data[0], f->data[1]);
-	}
-	else
-	{
-		assert(input_remaining() == 0);
-		bytes part1, part2;
-		part1.len = f->data[0].len;
-		part1.set(T_NEW(byte, part1.len), part1.len);
-		part1.copyFrom(f->data[0]);
-		assert(f->data[1].len == 0);
-		part2.set(nullptr, 0);
-		size_t fleft = (size_t)fsize - part1.len;
-		assert(bytes_read > fleft); // part2 already credited by get_next_file
-		bytes_read -= fleft;
-		if (fleft > 0)
-		{
-			// Must read some more.
-			if (live_input)
-			{
-				// Stop using the input buffer.  Make a new one:
-				if (free_input)
-					input.free();
-				input.init(fleft > (1 << 12) ? fleft : (1 << 12));
-				free_input = true;
-				live_input = false;
-			}
-			else
-			{
-				// Make it large enough.
-				assert(free_input); // must be reallocable
-				input.ensureSize(fleft);
-			}
-			rplimit = rp = input.base();
-			input.setLimit(rp + fleft);
-			if (!ensure_input(fleft))
-				unpack_abort("EOF reading resource file");
-			part2.ptr = input_scan();
-			part2.len = input_remaining();
-			rplimit = rp = input.base();
-		}
-		jarout->addJarEntry(f->name, f->deflate_hint(), f->modtime, part1, part2);
-	}
-	if (verbose >= 3)
-	{
-		fprintf(stderr, "Wrote " LONG_LONG_FORMAT " bytes to: %s\n", fsize, f->name);
-	}
-}
diff --git a/depends/pack200/src/unpack.h b/depends/pack200/src/unpack.h
deleted file mode 100644
index 0100700d..00000000
--- a/depends/pack200/src/unpack.h
+++ /dev/null
@@ -1,547 +0,0 @@
-/*
- * Copyright (c) 2002, 2008, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-// Global Structures
-struct jar;
-struct gunzip;
-struct band;
-struct constant_pool;
-struct entry;
-struct cpindex;
-struct inner_class;
-struct value_stream;
-
-struct cpindex
-{
-	uint32_t len;
-	entry *base1;  // base of primary index
-	entry **base2; // base of secondary index
-	byte ixTag;	// type of entries (!= CONSTANT_None), plus 64 if sub-index
-	enum
-	{
-		SUB_TAG = 64
-	};
-
-	entry *get(uint32_t i);
-
-	void init(int len_, entry *base1_, int ixTag_)
-	{
-		len = len_;
-		base1 = base1_;
-		base2 = nullptr;
-		ixTag = ixTag_;
-	}
-	void init(int len_, entry **base2_, int ixTag_)
-	{
-		len = len_;
-		base1 = nullptr;
-		base2 = base2_;
-		ixTag = ixTag_;
-	}
-};
-
-struct constant_pool
-{
-	uint32_t nentries;
-	entry *entries;
-	entry *first_extra_entry;
-	uint32_t maxentries; // total allocated size of entries
-
-	// Position and size of each homogeneous subrange:
-	int tag_count[CONSTANT_Limit];
-	int tag_base[CONSTANT_Limit];
-	cpindex tag_index[CONSTANT_Limit];
-	ptrlist tag_extras[CONSTANT_Limit];
-
-	cpindex *member_indexes; // indexed by 2*CONSTANT_Class.inord
-	cpindex *getFieldIndex(entry *classRef);
-	cpindex *getMethodIndex(entry *classRef);
-
-	inner_class **ic_index;
-	inner_class **ic_child_index;
-	inner_class *getIC(entry *inner);
-	inner_class *getFirstChildIC(entry *outer);
-	inner_class *getNextChildIC(inner_class *child);
-
-	int outputIndexLimit;  // index limit after renumbering
-	ptrlist outputEntries; // list of entry* needing output idx assigned
-
-	entry **hashTab;
-	uint32_t hashTabLength;
-	entry *&hashTabRef(byte tag, bytes &b);
-	entry *ensureUtf8(bytes &b);
-	entry *ensureClass(bytes &b);
-
-	// Well-known Utf8 symbols.
-	enum
-	{
-#define SNAME(n, s) s_##s,
-		ALL_ATTR_DO(SNAME)
-#undef SNAME
-		s_lt_init_gt, // <init>
-		s_LIMIT
-	};
-	entry *sym[s_LIMIT];
-
-	// read counts from hdr, allocate main arrays
-	enum
-	{
-		NUM_COUNTS = 12
-	};
-	void init(unpacker *u, int counts[NUM_COUNTS]);
-
-	// pointer to outer unpacker, for error checks etc.
-	unpacker *u;
-
-	int getCount(byte tag)
-	{
-		assert((uint32_t)tag < CONSTANT_Limit);
-		return tag_count[tag];
-	}
-	cpindex *getIndex(byte tag)
-	{
-		assert((uint32_t)tag < CONSTANT_Limit);
-		return &tag_index[tag];
-	}
-	cpindex *getKQIndex(); // uses cur_descr
-
-	void expandSignatures();
-	void initMemberIndexes();
-
-	void computeOutputOrder();
-	void computeOutputIndexes();
-	void resetOutputIndexes();
-};
-
-/*
- * The unpacker provides the entry points to the unpack engine,
- * as well as maintains the state of the engine.
- */
-struct unpacker
-{
-	// One element of the resulting JAR.
-	struct file
-	{
-		const char *name;
-		uint64_t size;
-		int modtime;
-		int options;
-		bytes data[2];
-		// Note:  If Sum(data[*].len) < size,
-		// remaining bytes must be read directly from the input stream.
-		bool deflate_hint()
-		{
-			return ((options & FO_DEFLATE_HINT) != 0);
-		}
-	};
-
-	// if running Unix-style, here are the inputs and outputs
-	FILE *infileptr; // buffered
-	bytes inbytes;   // direct
-	gunzip *gzin;	// gunzip filter, if any
-	jar *jarout;	 // output JAR file
-
-	// pointer to self, for U_NEW macro
-	unpacker *u;
-
-	ptrlist mallocs;	 // list of guys to free when we are all done
-	ptrlist tmallocs;	// list of guys to free on next client request
-	fillbytes smallbuf;  // supplies small alloc requests
-	fillbytes tsmallbuf; // supplies temporary small alloc requests
-
-	// option management members
-	int verbose;			  // verbose level, 0 means no output
-	int deflate_hint_or_zero; // ==0 means not set, otherwise -1 or 1
-	int modification_time_or_zero;
-
-	// input stream
-	fillbytes input; // the whole block (size is predicted, has slop too)
-	bool live_input; // is the data in this block live?
-	bool free_input; // must the input buffer be freed?
-	byte *rp;		// read pointer (< rplimit <= input.limit())
-	byte *rplimit;   // how much of the input block has been read?
-	uint64_t bytes_read;
-	int unsized_bytes_read;
-
-	// callback to read at least one byte, up to available input
-	typedef int64_t (*read_input_fn_t)(unpacker *self, void *buf, int64_t minlen,
-									   int64_t maxlen);
-	read_input_fn_t read_input_fn;
-
-	// archive header fields
-	int magic, minver, majver;
-	size_t archive_size;
-	int archive_next_count, archive_options, archive_modtime;
-	int band_headers_size;
-	int file_count, attr_definition_count, ic_count, class_count;
-	int default_class_minver, default_class_majver;
-	int default_file_options, suppress_file_options;   // not header fields
-	int default_archive_modtime, default_file_modtime; // not header fields
-	int code_count;									// not a header field
-	int files_remaining;							   // not a header field
-
-	// engine state
-	band *all_bands;  // indexed by band_number
-	byte *meta_rp;	// read-pointer into (copy of) band_headers
-	constant_pool cp; // all constant pool information
-	inner_class *ics; // InnerClasses
-
-	// output stream
-	bytes output;  // output block (either classfile head or tail)
-	byte *wp;	  // write pointer (< wplimit == output.limit())
-	byte *wpbase;  // write pointer starting address (<= wp)
-	byte *wplimit; // how much of the output block has been written?
-
-	// output state
-	file cur_file;
-	entry *cur_class;	// CONSTANT_Class entry
-	entry *cur_super;	// CONSTANT_Class entry or nullptr
-	entry *cur_descr;	// CONSTANT_NameandType entry
-	int cur_descr_flags; // flags corresponding to cur_descr
-	int cur_class_minver, cur_class_majver;
-	bool cur_class_has_local_ics;
-	fillbytes cur_classfile_head;
-	fillbytes cur_classfile_tail;
-	int files_written;   // also tells which file we're working on
-	int classes_written; // also tells which class we're working on
-	uint64_t bytes_written;
-	intlist bcimap;
-	fillbytes class_fixup_type;
-	intlist class_fixup_offset;
-	ptrlist class_fixup_ref;
-	fillbytes code_fixup_type; // which format of branch operand?
-	intlist code_fixup_offset; // location of operand needing fixup
-	intlist code_fixup_source; // encoded ID of branch insn
-	ptrlist requested_ics;	 // which ics need output?
-
-	// stats pertaining to multiple segments (updated on reset)
-	uint64_t bytes_read_before_reset;
-	uint64_t bytes_written_before_reset;
-	int files_written_before_reset;
-	int classes_written_before_reset;
-	int segments_read_before_reset;
-
-	// attribute state
-	struct layout_definition
-	{
-		uint32_t idx;	 // index (0..31...) which identifies this layout
-		const char *name; // name of layout
-		entry *nameEntry;
-		const char *layout; // string of layout (not yet parsed)
-		band **elems;	   // array of top-level layout elems (or callables)
-
-		bool hasCallables()
-		{
-			return layout[0] == '[';
-		}
-		band **bands()
-		{
-			assert(elems != nullptr);
-			return elems;
-		}
-	};
-	struct attr_definitions
-	{
-		unpacker *u;		 // pointer to self, for U_NEW macro
-		int xxx_flags_hi_bn; // locator for flags, count, indexes, calls bands
-		int attrc;		   // ATTR_CONTEXT_CLASS, etc.
-		uint32_t flag_limit; // 32 or 63, depending on archive_options bit
-		uint64_t predef;	 // mask of built-in definitions
-		uint64_t redef;	  // mask of local flag definitions or redefinitions
-		ptrlist layouts;	 // local (compressor-defined) defs, in index order
-		int flag_count[X_ATTR_LIMIT_FLAGS_HI];
-		intlist overflow_count;
-		ptrlist strip_names;   // what attribute names are being stripped?
-		ptrlist band_stack;	// Temp., used during layout parsing.
-		ptrlist calls_to_link; //  (ditto)
-		int bands_made;		//  (ditto)
-
-		void free()
-		{
-			layouts.free();
-			overflow_count.free();
-			strip_names.free();
-			band_stack.free();
-			calls_to_link.free();
-		}
-
-		// Locate the five fixed bands.
-		band &xxx_flags_hi();
-		band &xxx_flags_lo();
-		band &xxx_attr_count();
-		band &xxx_attr_indexes();
-		band &xxx_attr_calls();
-		band &fixed_band(int e_class_xxx);
-
-		// Register a new layout, and make bands for it.
-		layout_definition *defineLayout(int idx, const char *name, const char *layout);
-		layout_definition *defineLayout(int idx, entry *nameEntry, const char *layout);
-		band **buildBands(layout_definition *lo);
-
-		// Parse a layout string or part of one, recursively if necessary.
-		const char *parseLayout(const char *lp, band **&res, int curCble);
-		const char *parseNumeral(const char *lp, int &res);
-		const char *parseIntLayout(const char *lp, band *&res, byte le_kind,
-								   bool can_be_signed = false);
-		band **popBody(int band_stack_base); // pops a body off band_stack
-
-		// Read data into the bands of the idx-th layout.
-		void readBandData(int idx);					 // parse layout, make bands, read data
-		void readBandData(band **body, uint32_t count); // recursive helper
-
-		layout_definition *getLayout(uint32_t idx)
-		{
-			if (idx >= (uint32_t)layouts.length())
-				return nullptr;
-			return (layout_definition *)layouts.get(idx);
-		}
-
-		void setHaveLongFlags(bool z)
-		{
-			assert(flag_limit == 0); // not set up yet
-			flag_limit = (z ? X_ATTR_LIMIT_FLAGS_HI : X_ATTR_LIMIT_NO_FLAGS_HI);
-		}
-		bool haveLongFlags()
-		{
-			assert(flag_limit == X_ATTR_LIMIT_NO_FLAGS_HI ||
-				   flag_limit == X_ATTR_LIMIT_FLAGS_HI);
-			return flag_limit == X_ATTR_LIMIT_FLAGS_HI;
-		}
-
-		// Return flag_count if idx is predef and not redef, else zero.
-		int predefCount(uint32_t idx);
-
-		bool isRedefined(uint32_t idx)
-		{
-			if (idx >= flag_limit)
-				return false;
-			return (bool)((redef >> idx) & 1);
-		}
-		bool isPredefined(uint32_t idx)
-		{
-			if (idx >= flag_limit)
-				return false;
-			return (bool)(((predef & ~redef) >> idx) & 1);
-		}
-		uint64_t flagIndexMask()
-		{
-			return (predef | redef);
-		}
-		bool isIndex(uint32_t idx)
-		{
-			assert(flag_limit != 0); // must be set up already
-			if (idx < flag_limit)
-				return (bool)(((predef | redef) >> idx) & 1);
-			else
-				return (idx - flag_limit < (uint32_t)overflow_count.length());
-		}
-		int &getCount(uint32_t idx)
-		{
-			assert(isIndex(idx));
-			if (idx < flag_limit)
-				return flag_count[idx];
-			else
-				return overflow_count.get(idx - flag_limit);
-		}
-	};
-
-	attr_definitions attr_defs[ATTR_CONTEXT_LIMIT];
-
-	// Initialization
-	void init(read_input_fn_t input_fn = nullptr);
-	// Resets to a known sane state
-	void reset();
-	// Deallocates all storage.
-	void free();
-	// Deallocates temporary storage (volatile after next client call).
-	void free_temps()
-	{
-		tsmallbuf.init();
-		tmallocs.freeAll();
-	}
-
-	// Option management methods
-	bool set_option(const char *option, const char *value);
-	const char *get_option(const char *option);
-
-	// Fetching input.
-	bool ensure_input(int64_t more);
-	byte *input_scan()
-	{
-		return rp;
-	}
-	size_t input_remaining()
-	{
-		return rplimit - rp;
-	}
-	size_t input_consumed()
-	{
-		return rp - input.base();
-	}
-
-	// Entry points to the unpack engine
-	static int run(int argc, char **argv); // Unix-style entry point.
-	void check_options();
-	void start(void *packptr = nullptr, size_t len = 0);
-	void write_file_to_jar(file *f);
-	void finish();
-
-	// Public post unpack methods
-	int get_files_remaining()
-	{
-		return files_remaining;
-	}
-	int get_segments_remaining()
-	{
-		return archive_next_count;
-	}
-	file *get_next_file(); // returns nullptr on last file
-
-	// General purpose methods
-	void *alloc(size_t size)
-	{
-		return alloc_heap(size, true);
-	}
-	void *temp_alloc(size_t size)
-	{
-		return alloc_heap(size, true, true);
-	}
-	void *alloc_heap(size_t size, bool smallOK = false, bool temp = false);
-	void saveTo(bytes &b, const char *str)
-	{
-		saveTo(b, (byte *)str, strlen(str));
-	}
-	void saveTo(bytes &b, bytes &data)
-	{
-		saveTo(b, data.ptr, data.len);
-	}
-	void saveTo(bytes &b, byte *ptr, size_t len); //{ b.ptr = U_NEW...}
-	const char *saveStr(const char *str)
-	{
-		bytes buf;
-		saveTo(buf, str);
-		return buf.strval();
-	}
-	const char *saveIntStr(int num)
-	{
-		char buf[30];
-		sprintf(buf, "%d", num);
-		return saveStr(buf);
-	}
-	static unpacker *current(); // find current instance
-
-	// Output management
-	void set_output(fillbytes *which)
-	{
-		assert(wp == nullptr);
-		which->ensureSize(1 << 12); // covers the average classfile
-		wpbase = which->base();
-		wp = which->limit();
-		wplimit = which->end();
-	}
-	fillbytes *close_output(fillbytes *which = nullptr); // inverse of set_output
-
-	// These take an implicit parameter of wp/wplimit, and resize as necessary:
-	byte *put_space(size_t len); // allocates space at wp, returns pointer
-	size_t put_empty(size_t s)
-	{
-		byte *p = put_space(s);
-		return p - wpbase;
-	}
-	void ensure_put_space(size_t len);
-	void put_bytes(bytes &b)
-	{
-		b.writeTo(put_space(b.len));
-	}
-	void putu1(int n)
-	{
-		putu1_at(put_space(1), n);
-	}
-	void putu1_fast(int n)
-	{
-		putu1_at(wp++, n);
-	}
-	void putu2(int n);					// { putu2_at(put_space(2), n); }
-	void putu4(int n);					// { putu4_at(put_space(4), n); }
-	void putu8(int64_t n);				// { putu8_at(put_space(8), n); }
-	void putref(entry *e);				// { putu2_at(put_space(2), putref_index(e, 2)); }
-	void putu1ref(entry *e);			  // { putu1_at(put_space(1), putref_index(e, 1)); }
-	int putref_index(entry *e, int size); // size in [1..2]
-	void put_label(int curIP, int size);  // size in {2,4}
-	void putlayout(band **body);
-	void put_stackmap_type();
-
-	size_t wpoffset()
-	{
-		return (size_t)(wp - wpbase);
-	} // (unvariant across overflow)
-	byte *wp_at(size_t offset)
-	{
-		return wpbase + offset;
-	}
-	uint32_t to_bci(uint32_t bii);
-	void get_code_header(int &max_stack, int &max_na_locals, int &handler_count, int &cflags);
-	band *ref_band_for_self_op(int bc, bool &isAloadVar, int &origBCVar);
-	band *ref_band_for_op(int bc);
-
-	// Definitions of standard classfile int formats:
-	static void putu1_at(byte *wp, int n)
-	{
-		assert(n == (n & 0xFF));
-		wp[0] = n;
-	}
-	static void putu2_at(byte *wp, int n);
-	static void putu4_at(byte *wp, int n);
-	static void putu8_at(byte *wp, int64_t n);
-
-	// Private stuff
-	void reset_cur_classfile();
-	void write_classfile_tail();
-	void write_classfile_head();
-	void write_code();
-	void write_bc_ops();
-	void write_members(int num, int attrc); // attrc=ATTR_CONTEXT_FIELD/METHOD
-	int write_attrs(int attrc, uint64_t indexBits);
-
-	// The readers
-	void read_bands();
-	void read_file_header();
-	void read_cp();
-	void read_cp_counts(value_stream &hdr);
-	void read_attr_defs();
-	void read_ics();
-	void read_attrs(int attrc, int obj_count);
-	void read_classes();
-	void read_code_headers();
-	void read_bcs();
-	void read_bc_ops();
-	void read_files();
-	void read_Utf8_values(entry *cpMap, int len);
-	void read_single_words(band &cp_band, entry *cpMap, int len);
-	void read_double_words(band &cp_bands, entry *cpMap, int len);
-	void read_single_refs(band &cp_band, byte refTag, entry *cpMap, int len);
-	void read_double_refs(band &cp_band, byte ref1Tag, byte ref2Tag, entry *cpMap, int len);
-	void read_signature_values(entry *cpMap, int len);
-};
diff --git a/depends/pack200/src/unpack200.cpp b/depends/pack200/src/unpack200.cpp
deleted file mode 100644
index 22b7f3b0..00000000
--- a/depends/pack200/src/unpack200.cpp
+++ /dev/null
@@ -1,162 +0,0 @@
-/*
- * Copyright (c) 2003, 2008, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-#include <sys/types.h>
-#include <stdio.h>
-#include <string.h>
-#include <stdlib.h>
-#include <stdarg.h>
-#include <errno.h>
-#include <assert.h>
-#include <limits.h>
-#include <time.h>
-#include <stdint.h>
-
-#include "constants.h"
-#include "utils.h"
-#include "defines.h"
-#include "bytes.h"
-#include "coding.h"
-#include "unpack200.h"
-#include "unpack.h"
-#include "zip.h"
-
-// Callback for fetching data, Unix style.
-static int64_t read_input_via_stdio(unpacker *u, void *buf, int64_t minlen, int64_t maxlen)
-{
-	assert(u->infileptr != nullptr);
-	assert(minlen <= maxlen); // don't talk nonsense
-	int64_t numread = 0;
-	char *bufptr = (char *)buf;
-	while (numread < minlen)
-	{
-		// read available input, up to buf.length or maxlen
-		int readlen = (1 << 16);
-		if (readlen > (maxlen - numread))
-			readlen = (int)(maxlen - numread);
-		int nr = 0;
-
-		nr = (int)fread(bufptr, 1, readlen, u->infileptr);
-		if (nr <= 0)
-		{
-			if (errno != EINTR)
-				break;
-			nr = 0;
-		}
-		numread += nr;
-		bufptr += nr;
-		assert(numread <= maxlen);
-	}
-	return numread;
-}
-
-enum
-{
-	EOF_MAGIC = 0,
-	BAD_MAGIC = -1
-};
-
-static int read_magic(unpacker *u, char peek[], int peeklen)
-{
-	assert(peeklen == 4); // magic numbers are always 4 bytes
-	int64_t nr = (u->read_input_fn)(u, peek, peeklen, peeklen);
-	if (nr != peeklen)
-	{
-		return (nr == 0) ? EOF_MAGIC : BAD_MAGIC;
-	}
-	int magic = 0;
-	for (int i = 0; i < peeklen; i++)
-	{
-		magic <<= 8;
-		magic += peek[i] & 0xFF;
-	}
-	return magic;
-}
-
-void unpack_200(FILE *input, FILE *output)
-{
-	unpacker u;
-	u.init(read_input_via_stdio);
-
-	// initialize jar output
-	// the output takes ownership of the file handle
-	jar jarout;
-	jarout.init(&u);
-	jarout.jarfp = output;
-
-	// the input doesn't
-	u.infileptr = input;
-
-	// read the magic!
-	char peek[4];
-	int magic;
-	magic = read_magic(&u, peek, (int)sizeof(peek));
-
-	// if it is a gzip encoded file, we need an extra gzip input filter
-	if ((magic & GZIP_MAGIC_MASK) == GZIP_MAGIC)
-	{
-		gunzip *gzin = NEW(gunzip, 1);
-		gzin->init(&u);
-		// FIXME: why the side effects? WHY?
-		u.gzin->start(magic);
-		u.start();
-	}
-	else
-	{
-		// otherwise, feed the bytes to the unpacker directly
-		u.start(peek, sizeof(peek));
-	}
-
-	// Note:  The checks to u.aborting() are necessary to gracefully
-	// terminate processing when the first segment throws an error.
-	for (;;)
-	{
-		// Each trip through this loop unpacks one segment
-		// and then resets the unpacker.
-		for (unpacker::file *filep; (filep = u.get_next_file()) != nullptr;)
-		{
-			u.write_file_to_jar(filep);
-		}
-
-		// Peek ahead for more data.
-		magic = read_magic(&u, peek, (int)sizeof(peek));
-		if (magic != (int)JAVA_PACKAGE_MAGIC)
-		{
-			// we do not feel strongly about this kind of thing...
-			/*
-			if (magic != EOF_MAGIC)
-				unpack_abort("garbage after end of pack archive");
-			*/
-			break; // all done
-		}
-
-		// Release all storage from parsing the old segment.
-		u.reset();
-		// Restart, beginning with the peek-ahead.
-		u.start(peek, sizeof(peek));
-	}
-	u.finish();
-	u.free(); // tidy up malloc blocks
-	fclose(input);
-}
diff --git a/depends/pack200/src/utils.cpp b/depends/pack200/src/utils.cpp
deleted file mode 100644
index 0b7d91ca..00000000
--- a/depends/pack200/src/utils.cpp
+++ /dev/null
@@ -1,71 +0,0 @@
-/*
- * Copyright (c) 2001, 2008, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-#include <stdarg.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <limits.h>
-#include <assert.h>
-#include <stdint.h>
-
-#include <sys/stat.h>
-
-#ifdef _MSC_VER
-#include <direct.h>
-#include <io.h>
-#include <process.h>
-#else
-#include <unistd.h>
-#endif
-
-#include "constants.h"
-#include "defines.h"
-#include "bytes.h"
-#include "utils.h"
-
-#include "unpack.h"
-
-void *must_malloc(size_t size)
-{
-	size_t msize = size;
-	void *ptr = (msize > PSIZE_MAX) ? nullptr : malloc(msize);
-	if (ptr != nullptr)
-	{
-		memset(ptr, 0, size);
-	}
-	else
-	{
-		throw std::runtime_error(ERROR_ENOMEM);
-	}
-	return ptr;
-}
-
-void unpack_abort(const char *msg)
-{
-	if (msg == nullptr)
-		msg = "corrupt pack file or internal error";
-	throw std::runtime_error(msg);
-}
diff --git a/depends/pack200/src/utils.h b/depends/pack200/src/utils.h
deleted file mode 100644
index 5a3dc8f6..00000000
--- a/depends/pack200/src/utils.h
+++ /dev/null
@@ -1,53 +0,0 @@
-/*
- * Copyright (c) 2001, 2008, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-// Definitions of our util functions
-
-#include <stdexcept>
-
-void *must_malloc(size_t size);
-
-// overflow management
-#define OVERFLOW ((size_t) - 1)
-#define PSIZE_MAX (OVERFLOW / 2) /* normal size limit */
-
-inline size_t scale_size(size_t size, size_t scale)
-{
-	return (size > PSIZE_MAX / scale) ? OVERFLOW : size * scale;
-}
-
-inline size_t add_size(size_t size1, size_t size2)
-{
-	return ((size1 | size2 | (size1 + size2)) > PSIZE_MAX) ? OVERFLOW : size1 + size2;
-}
-
-inline size_t add_size(size_t size1, size_t size2, int size3)
-{
-	return add_size(add_size(size1, size2), size3);
-}
-
-struct unpacker;
-/// This throws an exception!
-extern void unpack_abort(const char *msg = nullptr);
diff --git a/depends/pack200/src/zip.cpp b/depends/pack200/src/zip.cpp
deleted file mode 100644
index 32e8bd50..00000000
--- a/depends/pack200/src/zip.cpp
+++ /dev/null
@@ -1,589 +0,0 @@
-/*
- * Copyright (c) 2001, 2008, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-
-/**
- * Note: Lifted from uncrunch.c from jdk sources
- */
-#include <stdio.h>
-#include <string.h>
-#include <errno.h>
-#include <time.h>
-#include <stdint.h>
-
-#include <stdlib.h>
-#include <assert.h>
-
-#ifndef _MSC_VER
-#include <strings.h>
-#endif
-
-#include "defines.h"
-#include "bytes.h"
-#include "utils.h"
-
-#include "constants.h"
-#include "unpack.h"
-
-#include "zip.h"
-
-#include "zlib.h"
-
-inline uint32_t jar::get_crc32(uint32_t c, uchar *ptr, uint32_t len)
-{
-	return crc32(c, ptr, len);
-}
-
-// FIXME: this is bullshit. Do real endianness detection.
-#ifdef sparc
-#define SWAP_BYTES(a) ((((a) << 8) & 0xff00) | 0x00ff) & (((a) >> 8) | 0xff00)
-#else
-#define SWAP_BYTES(a) (a)
-#endif
-
-#define GET_INT_LO(a) SWAP_BYTES(a & 0xFFFF)
-
-#define GET_INT_HI(a) SWAP_BYTES((a >> 16) & 0xFFFF);
-
-void jar::init(unpacker *u_)
-{
-	BYTES_OF(*this).clear();
-	u = u_;
-	u->jarout = this;
-}
-
-// Write data to the ZIP output stream.
-void jar::write_data(void *buff, int len)
-{
-	while (len > 0)
-	{
-		int rc = (int)fwrite(buff, 1, len, jarfp);
-		if (rc <= 0)
-		{
-			fprintf(stderr, "Error: write on output file failed err=%d\n", errno);
-			exit(1); // Called only from the native standalone unpacker
-		}
-		output_file_offset += rc;
-		buff = ((char *)buff) + rc;
-		len -= rc;
-	}
-}
-
-void jar::add_to_jar_directory(const char *fname, bool store, int modtime, int len, int clen,
-							   uint32_t crc)
-{
-	uint32_t fname_length = (uint32_t)strlen(fname);
-	ushort header[23];
-	if (modtime == 0)
-		modtime = default_modtime;
-	uint32_t dostime = get_dostime(modtime);
-
-	header[0] = (ushort)SWAP_BYTES(0x4B50);
-	header[1] = (ushort)SWAP_BYTES(0x0201);
-	header[2] = (ushort)SWAP_BYTES(0xA);
-
-	// required version
-	header[3] = (ushort)SWAP_BYTES(0xA);
-
-	// flags 02 = maximum  sub-compression flag
-	header[4] = (store) ? 0x0 : SWAP_BYTES(0x2);
-
-	// Compression method 8=deflate.
-	header[5] = (store) ? 0x0 : SWAP_BYTES(0x08);
-
-	// Last modified date and time.
-	header[6] = (ushort)GET_INT_LO(dostime);
-	header[7] = (ushort)GET_INT_HI(dostime);
-
-	// CRC
-	header[8] = (ushort)GET_INT_LO(crc);
-	header[9] = (ushort)GET_INT_HI(crc);
-
-	// Compressed length:
-	header[10] = (ushort)GET_INT_LO(clen);
-	header[11] = (ushort)GET_INT_HI(clen);
-
-	// Uncompressed length.
-	header[12] = (ushort)GET_INT_LO(len);
-	header[13] = (ushort)GET_INT_HI(len);
-
-	// Filename length
-	header[14] = (ushort)SWAP_BYTES(fname_length);
-	// So called "extra field" length.
-	header[15] = 0;
-	// So called "comment" length.
-	header[16] = 0;
-	// Disk number start
-	header[17] = 0;
-	// File flags => binary
-	header[18] = 0;
-	// More file flags
-	header[19] = 0;
-	header[20] = 0;
-	// Offset within ZIP file.
-	header[21] = (ushort)GET_INT_LO(output_file_offset);
-	header[22] = (ushort)GET_INT_HI(output_file_offset);
-
-	// Copy the whole thing into the central directory.
-	central_directory.append(header, sizeof(header));
-
-	// Copy the fname to the header.
-	central_directory.append(fname, fname_length);
-
-	central_directory_count++;
-}
-
-void jar::write_jar_header(const char *fname, bool store, int modtime, int len, int clen,
-						   uint32_t crc)
-{
-	uint32_t fname_length = (uint32_t)strlen(fname);
-	ushort header[15];
-	if (modtime == 0)
-		modtime = default_modtime;
-	uint32_t dostime = get_dostime(modtime);
-
-	// ZIP LOC magic.
-	header[0] = (ushort)SWAP_BYTES(0x4B50);
-	header[1] = (ushort)SWAP_BYTES(0x0403);
-
-	// Version
-	header[2] = (ushort)SWAP_BYTES(0xA);
-
-	// flags 02 = maximum  sub-compression flag
-	header[3] = (store) ? 0x0 : SWAP_BYTES(0x2);
-
-	// Compression method = deflate
-	header[4] = (store) ? 0x0 : SWAP_BYTES(0x08);
-
-	// Last modified date and time.
-	header[5] = (ushort)GET_INT_LO(dostime);
-	header[6] = (ushort)GET_INT_HI(dostime);
-
-	// CRC
-	header[7] = (ushort)GET_INT_LO(crc);
-	header[8] = (ushort)GET_INT_HI(crc);
-
-	// Compressed length:
-	header[9] = (ushort)GET_INT_LO(clen);
-	header[10] = (ushort)GET_INT_HI(clen);
-
-	// Uncompressed length.
-	header[11] = (ushort)GET_INT_LO(len);
-	header[12] = (ushort)GET_INT_HI(len);
-
-	// Filename length
-	header[13] = (ushort)SWAP_BYTES(fname_length);
-	// So called "extra field" length.
-	header[14] = 0;
-
-	// Write the LOC header to the output file.
-	write_data(header, (int)sizeof(header));
-
-	// Copy the fname to the header.
-	write_data((char *)fname, (int)fname_length);
-}
-
-void jar::write_central_directory()
-{
-	bytes mc;
-	mc.set("PACK200");
-
-	ushort header[11];
-
-	// Create the End of Central Directory structure.
-	header[0] = (ushort)SWAP_BYTES(0x4B50);
-	header[1] = (ushort)SWAP_BYTES(0x0605);
-	// disk numbers
-	header[2] = 0;
-	header[3] = 0;
-	// Number of entries in central directory.
-	header[4] = (ushort)SWAP_BYTES(central_directory_count);
-	header[5] = (ushort)SWAP_BYTES(central_directory_count);
-	// Size of the central directory}
-	header[6] = (ushort)GET_INT_LO((int)central_directory.size());
-	header[7] = (ushort)GET_INT_HI((int)central_directory.size());
-	// Offset of central directory within disk.
-	header[8] = (ushort)GET_INT_LO(output_file_offset);
-	header[9] = (ushort)GET_INT_HI(output_file_offset);
-	// zipfile comment length;
-	header[10] = (ushort)SWAP_BYTES((int)mc.len);
-
-	// Write the central directory.
-	write_data(central_directory.b);
-
-	// Write the End of Central Directory structure.
-	write_data(header, (int)sizeof(header));
-
-	// Write the comment.
-	write_data(mc);
-}
-
-// Public API
-
-// Open a Jar file and initialize.
-void jar::openJarFile(const char *fname)
-{
-	if (!jarfp)
-	{
-		jarfp = fopen(fname, "wb");
-		if (!jarfp)
-		{
-			fprintf(stderr, "Error: Could not open jar file: %s\n", fname);
-			exit(3); // Called only from the native standalone unpacker
-		}
-	}
-}
-
-// Add a ZIP entry and copy the file data
-void jar::addJarEntry(const char *fname, bool deflate_hint, int modtime, bytes &head,
-					  bytes &tail)
-{
-	int len = (int)(head.len + tail.len);
-	int clen = 0;
-
-	uint32_t crc = get_crc32(0, Z_NULL, 0);
-	if (head.len != 0)
-		crc = get_crc32(crc, (uchar *)head.ptr, (uint32_t)head.len);
-	if (tail.len != 0)
-		crc = get_crc32(crc, (uchar *)tail.ptr, (uint32_t)tail.len);
-
-	bool deflate = (deflate_hint && len > 0);
-
-	if (deflate)
-	{
-		if (deflate_bytes(head, tail) == false)
-		{
-			deflate = false;
-		}
-	}
-	clen = (int)((deflate) ? deflated.size() : len);
-	add_to_jar_directory(fname, !deflate, modtime, len, clen, crc);
-	write_jar_header(fname, !deflate, modtime, len, clen, crc);
-
-	if (deflate)
-	{
-		write_data(deflated.b);
-	}
-	else
-	{
-		write_data(head);
-		write_data(tail);
-	}
-}
-
-// Add a ZIP entry for a directory name no data
-void jar::addDirectoryToJarFile(const char *dir_name)
-{
-	bool store = true;
-	add_to_jar_directory((const char *)dir_name, store, default_modtime, 0, 0, 0);
-	write_jar_header((const char *)dir_name, store, default_modtime, 0, 0, 0);
-}
-
-// Write out the central directory and close the jar file.
-void jar::closeJarFile(bool central)
-{
-	if (jarfp)
-	{
-		fflush(jarfp);
-		if (central)
-			write_central_directory();
-		fflush(jarfp);
-		fclose(jarfp);
-	}
-	reset();
-}
-
-/* Convert the date y/n/d and time h:m:s to a four byte DOS date and
- *  time (date in high two bytes, time in low two bytes allowing magnitude
- *  comparison).
- */
-inline uint32_t jar::dostime(int y, int n, int d, int h, int m, int s)
-{
-	return y < 1980 ? dostime(1980, 1, 1, 0, 0, 0)
-					: (((uint32_t)y - 1980) << 25) | ((uint32_t)n << 21) | ((uint32_t)d << 16) |
-						  ((uint32_t)h << 11) | ((uint32_t)m << 5) | ((uint32_t)s >> 1);
-}
-/*
-#ifdef _REENTRANT // solaris
-extern "C" struct tm *gmtime_r(const time_t *, struct tm *);
-#else
-#define gmtime_r(t, s) gmtime(t)
-#endif
-*/
-/*
- * Return the Unix time in DOS format
- */
-uint32_t jar::get_dostime(int modtime)
-{
-	// see defines.h
-	if (modtime != 0 && modtime == modtime_cache)
-		return dostime_cache;
-	if (modtime != 0 && default_modtime == 0)
-		default_modtime = modtime; // catch a reasonable default
-	time_t t = modtime;
-	struct tm sbuf;
-	(void)memset((void *)&sbuf, 0, sizeof(sbuf));
-	struct tm *s = gmtime_r(&t, &sbuf);
-	modtime_cache = modtime;
-	dostime_cache =
-		dostime(s->tm_year + 1900, s->tm_mon + 1, s->tm_mday, s->tm_hour, s->tm_min, s->tm_sec);
-	// printf("modtime %d => %d\n", modtime_cache, dostime_cache);
-	return dostime_cache;
-}
-
-/* Returns true on success, and will set the clen to the compressed
-   length, the caller should verify if true and clen less than the
-   input data
-*/
-bool jar::deflate_bytes(bytes &head, bytes &tail)
-{
-	int len = (int)(head.len + tail.len);
-
-	z_stream zs;
-	BYTES_OF(zs).clear();
-
-	// NOTE: the window size should always be -MAX_WBITS normally -15.
-	// unzip/zipup.c and java/Deflater.c
-
-	int error =
-		deflateInit2(&zs, Z_BEST_COMPRESSION, Z_DEFLATED, -MAX_WBITS, 8, Z_DEFAULT_STRATEGY);
-	if (error != Z_OK)
-	{
-		/*
-		switch (error)
-		{
-		case Z_MEM_ERROR:
-			PRINTCR((2, "Error: deflate error : Out of memory \n"));
-			break;
-		case Z_STREAM_ERROR:
-			PRINTCR((2, "Error: deflate error : Invalid compression level \n"));
-			break;
-		case Z_VERSION_ERROR:
-			PRINTCR((2, "Error: deflate error : Invalid version\n"));
-			break;
-		default:
-			PRINTCR((2, "Error: Internal deflate error error = %d\n", error));
-		}
-		*/
-		return false;
-	}
-
-	deflated.empty();
-	zs.next_out = (uchar *)deflated.grow(len + (len / 2));
-	zs.avail_out = (int)deflated.size();
-
-	zs.next_in = (uchar *)head.ptr;
-	zs.avail_in = (int)head.len;
-
-	bytes *first = &head;
-	bytes *last = &tail;
-	if (last->len == 0)
-	{
-		first = nullptr;
-		last = &head;
-	}
-	else if (first->len == 0)
-	{
-		first = nullptr;
-	}
-
-	if (first != nullptr && error == Z_OK)
-	{
-		zs.next_in = (uchar *)first->ptr;
-		zs.avail_in = (int)first->len;
-		error = deflate(&zs, Z_NO_FLUSH);
-	}
-	if (error == Z_OK)
-	{
-		zs.next_in = (uchar *)last->ptr;
-		zs.avail_in = (int)last->len;
-		error = deflate(&zs, Z_FINISH);
-	}
-	if (error == Z_STREAM_END)
-	{
-		if (len > (int)zs.total_out)
-		{
-			deflated.b.len = zs.total_out;
-			deflateEnd(&zs);
-			return true;
-		}
-		deflateEnd(&zs);
-		return false;
-	}
-
-	deflateEnd(&zs);
-	return false;
-}
-
-// Callback for fetching data from a GZIP input stream
-static int64_t read_input_via_gzip(unpacker *u, void *buf, int64_t minlen, int64_t maxlen)
-{
-	assert(minlen <= maxlen); // don't talk nonsense
-	int64_t numread = 0;
-	char *bufptr = (char *)buf;
-	char *inbuf = u->gzin->inbuf;
-	size_t inbuflen = sizeof(u->gzin->inbuf);
-	unpacker::read_input_fn_t read_gzin_fn = (unpacker::read_input_fn_t)u->gzin->read_input_fn;
-	z_stream &zs = *(z_stream *)u->gzin->zstream;
-	while (numread < minlen)
-	{
-		int readlen = (1 << 16); // pretty arbitrary
-		if (readlen > (maxlen - numread))
-			readlen = (int)(maxlen - numread);
-		zs.next_out = (uchar *)bufptr;
-		zs.avail_out = readlen;
-		if (zs.avail_in == 0)
-		{
-			zs.avail_in = (int)read_gzin_fn(u, inbuf, 1, inbuflen);
-			zs.next_in = (uchar *)inbuf;
-		}
-		int error = inflate(&zs, Z_NO_FLUSH);
-		if (error != Z_OK && error != Z_STREAM_END)
-		{
-			unpack_abort("error inflating input");
-			break;
-		}
-		int nr = readlen - zs.avail_out;
-		numread += nr;
-		bufptr += nr;
-		assert(numread <= maxlen);
-		if (error == Z_STREAM_END)
-		{
-			enum
-			{
-				TRAILER_LEN = 8
-			};
-			// skip 8-byte trailer
-			if (zs.avail_in >= TRAILER_LEN)
-			{
-				zs.avail_in -= TRAILER_LEN;
-			}
-			else
-			{
-				// Bug: 5023768,we read past the TRAILER_LEN to see if there is
-				// any extraneous data, as we dont support concatenated .gz
-				// files just yet.
-				int extra = (int)read_gzin_fn(u, inbuf, 1, inbuflen);
-				zs.avail_in += extra - TRAILER_LEN;
-			}
-			// %%% should check final CRC and length here
-			// %%% should check for concatenated *.gz files here
-			if (zs.avail_in > 0)
-				unpack_abort("garbage after end of deflated input stream");
-			// pop this filter off:
-			u->gzin->free();
-			break;
-		}
-	}
-
-	// fprintf(u->errstrm, "readInputFn(%d,%d) => %d (gunzip)\n",
-	//        (int)minlen, (int)maxlen, (int)numread);
-	return numread;
-}
-
-void gunzip::init(unpacker *u_)
-{
-	BYTES_OF(*this).clear();
-	u = u_;
-	assert(u->gzin == nullptr); // once only, please
-	read_input_fn = (void *)u->read_input_fn;
-	zstream = NEW(z_stream, 1);
-	u->gzin = this;
-	u->read_input_fn = read_input_via_gzip;
-}
-
-void gunzip::start(int magic)
-{
-	assert((magic & GZIP_MAGIC_MASK) == GZIP_MAGIC);
-	int gz_flg = (magic & 0xFF); // keep "flg", discard other 3 bytes
-	enum
-	{
-		FHCRC = (1 << 1),
-		FEXTRA = (1 << 2),
-		FNAME = (1 << 3),
-		FCOMMENT = (1 << 4)
-	};
-	char gz_mtime[4];
-	char gz_xfl[1];
-	char gz_os[1];
-	char gz_extra_len[2];
-	char gz_hcrc[2];
-	char gz_ignore;
-	// do not save extra, name, comment
-	read_fixed_field(gz_mtime, sizeof(gz_mtime));
-	read_fixed_field(gz_xfl, sizeof(gz_xfl));
-	read_fixed_field(gz_os, sizeof(gz_os));
-	if (gz_flg & FEXTRA)
-	{
-		read_fixed_field(gz_extra_len, sizeof(gz_extra_len));
-		int extra_len = gz_extra_len[0] & 0xFF;
-		extra_len += (gz_extra_len[1] & 0xFF) << 8;
-		for (; extra_len > 0; extra_len--)
-		{
-			read_fixed_field(&gz_ignore, 1);
-		}
-	}
-	int null_terms = 0;
-	if (gz_flg & FNAME)
-		null_terms++;
-	if (gz_flg & FCOMMENT)
-		null_terms++;
-	for (; null_terms; null_terms--)
-	{
-		for (;;)
-		{
-			gz_ignore = 0;
-			read_fixed_field(&gz_ignore, 1);
-			if (gz_ignore == 0)
-				break;
-		}
-	}
-	if (gz_flg & FHCRC)
-		read_fixed_field(gz_hcrc, sizeof(gz_hcrc));
-
-	// now the input stream is ready to read into the inflater
-	int error = inflateInit2((z_stream *)zstream, -MAX_WBITS);
-	if (error != Z_OK)
-	{
-		unpack_abort("cannot create input");
-	}
-}
-
-void gunzip::free()
-{
-	assert(u->gzin == this);
-	u->gzin = nullptr;
-	u->read_input_fn = (unpacker::read_input_fn_t) this->read_input_fn;
-	inflateEnd((z_stream *)zstream);
-	::free(zstream);
-	zstream = nullptr;
-	::free(this);
-}
-
-void gunzip::read_fixed_field(char *buf, size_t buflen)
-{
-	int64_t nr = ((unpacker::read_input_fn_t)read_input_fn)(u, buf, buflen, buflen);
-	if ((size_t)nr != buflen)
-		unpack_abort("short stream header");
-}
diff --git a/depends/pack200/src/zip.h b/depends/pack200/src/zip.h
deleted file mode 100644
index 67ec24da..00000000
--- a/depends/pack200/src/zip.h
+++ /dev/null
@@ -1,110 +0,0 @@
-/*
- * Copyright (c) 2001, 2008, Oracle and/or its affiliates. All rights reserved.
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
- *
- * This code is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License version 2 only, as
- * published by the Free Software Foundation.  Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the LICENSE file that accompanied this code.
- *
- * This code 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
- * version 2 for more details (a copy is included in the LICENSE file that
- * accompanied this code).
- *
- * You should have received a copy of the GNU General Public License version
- * 2 along with this work; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
- *
- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
- * or visit www.oracle.com if you need additional information or have any
- * questions.
- */
-#include <stdint.h>
-typedef unsigned short ushort;
-typedef unsigned int uint32_t;
-typedef unsigned char uchar;
-
-struct unpacker;
-
-struct jar
-{
-	// JAR file writer
-	FILE *jarfp;
-	int default_modtime;
-
-	// Used by unix2dostime:
-	int modtime_cache;
-	uint32_t dostime_cache;
-
-	// Private members
-	fillbytes central_directory;
-	ushort central_directory_count;
-	uint32_t output_file_offset;
-	fillbytes deflated; // temporary buffer
-
-	// pointer to outer unpacker, for error checks etc.
-	unpacker *u;
-
-	// Public Methods
-	void openJarFile(const char *fname);
-	void addJarEntry(const char *fname, bool deflate_hint, int modtime, bytes &head,
-					 bytes &tail);
-	void addDirectoryToJarFile(const char *dir_name);
-	void closeJarFile(bool central);
-
-	void init(unpacker *u_);
-
-	void free()
-	{
-		central_directory.free();
-		deflated.free();
-	}
-
-	void reset()
-	{
-		free();
-		init(u);
-	}
-
-	// Private Methods
-	void write_data(void *ptr, int len);
-	void write_data(bytes &b)
-	{
-		write_data(b.ptr, (int)b.len);
-	}
-	void add_to_jar_directory(const char *fname, bool store, int modtime, int len, int clen,
-							  uint32_t crc);
-	void write_jar_header(const char *fname, bool store, int modtime, int len, int clen,
-						  unsigned int crc);
-	void write_central_directory();
-	uint32_t dostime(int y, int n, int d, int h, int m, int s);
-	uint32_t get_dostime(int modtime);
-
-	// The definitions of these depend on the NO_ZLIB option:
-	bool deflate_bytes(bytes &head, bytes &tail);
-	static uint32_t get_crc32(uint32_t c, unsigned char *ptr, uint32_t len);
-};
-
-struct gunzip
-{
-	// optional gzip input stream control block
-
-	// pointer to outer unpacker, for error checks etc.
-	unpacker *u;
-
-	void *read_input_fn; // underlying \bchar\b stream
-	void *zstream;	   // inflater state
-	char inbuf[1 << 14]; // input buffer
-
-	void init(unpacker *u_); // pushes new value on u->read_input_fn
-
-	void free();
-
-	void start(int magic);
-
-	// private stuff
-	void read_fixed_field(char *buf, size_t buflen);
-};
diff --git a/depends/rainbow/CMakeLists.txt b/depends/rainbow/CMakeLists.txt
deleted file mode 100644
index 01342d1b..00000000
--- a/depends/rainbow/CMakeLists.txt
+++ /dev/null
@@ -1,15 +0,0 @@
-cmake_minimum_required(VERSION 3.1)
-project(rainbow)
-
-find_package(Qt5Core REQUIRED QUIET)
-find_package(Qt5Gui REQUIRED QUIET)
-
-set(RAINBOW_SOURCES
-src/rainbow.cpp
-)
-
-add_definitions(-DRAINBOW_LIBRARY)
-add_library(rainbow SHARED ${RAINBOW_SOURCES})
-target_include_directories(rainbow PUBLIC "${CMAKE_CURRENT_SOURCE_DIR}/include")
-
-qt5_use_modules(rainbow Core Gui)
diff --git a/depends/rainbow/COPYING.LIB b/depends/rainbow/COPYING.LIB
deleted file mode 100644
index e69de29b..00000000
--- a/depends/rainbow/COPYING.LIB
+++ /dev/null
diff --git a/depends/rainbow/include/rainbow.h b/depends/rainbow/include/rainbow.h
deleted file mode 100644
index b12052b1..00000000
--- a/depends/rainbow/include/rainbow.h
+++ /dev/null
@@ -1,160 +0,0 @@
-/* This was part of the KDE project - see KGuiAddons
- * Copyright (C) 2007 Matthew Woehlke <mw_triad@users.sourceforge.net>
- * Copyright (C) 2007 Olaf Schmidt <ojschmidt@kde.org>
- * Copyright (C) 2007 Thomas Zander <zander@kde.org>
- * Copyright (C) 2007 Zack Rusin <zack@kde.org>
- * Copyright (C) 2015 Petr Mrazek <peterix@gmail.com>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Library General Public
- * License as published by the Free Software Foundation; either
- * version 2 of the License, or (at your option) any later version.
- *
- * This library 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
- * Library General Public License for more details.
- *
- * You should have received a copy of the GNU Library General Public License
- * along with this library; see the file COPYING.LIB.  If not, write to
- * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
- * Boston, MA 02110-1301, USA.
- */
-
-#pragma once
-
-#include "rainbow_config.h"
-
-#include <QPainter>
-class QColor;
-
-/**
- * A set of methods used to work with colors.
- */
-namespace Rainbow
-{
-/**
- * Calculate the luma of a color. Luma is weighted sum of gamma-adjusted
- * R'G'B' components of a color. The result is similar to qGray. The range
- * is from 0.0 (black) to 1.0 (white).
- *
- * Rainbow::darken(), Rainbow::lighten() and Rainbow::shade()
- * operate on the luma of a color.
- *
- * @see http://en.wikipedia.org/wiki/Luma_(video)
- */
-RAINBOW_EXPORT qreal luma(const QColor &);
-
-/**
- * Calculate hue, chroma and luma of a color in one call.
- * @since 5.0
- */
-RAINBOW_EXPORT void getHcy(const QColor &, qreal *hue, qreal *chroma, qreal *luma,
-						   qreal *alpha = 0);
-
-/**
- * Calculate the contrast ratio between two colors, according to the
- * W3C/WCAG2.0 algorithm, (Lmax + 0.05)/(Lmin + 0.05), where Lmax and Lmin
- * are the luma values of the lighter color and the darker color,
- * respectively.
- *
- * A contrast ration of 5:1 (result == 5.0) is the minimum for "normal"
- * text to be considered readable (large text can go as low as 3:1). The
- * ratio ranges from 1:1 (result == 1.0) to 21:1 (result == 21.0).
- *
- * @see Rainbow::luma
- */
-RAINBOW_EXPORT qreal contrastRatio(const QColor &, const QColor &);
-
-/**
- * Adjust the luma of a color by changing its distance from white.
- *
- * @li amount == 1.0 gives white
- * @li amount == 0.5 results in a color whose luma is halfway between 1.0
- * and that of the original color
- * @li amount == 0.0 gives the original color
- * @li amount == -1.0 gives a color that is 'twice as far from white' as
- * the original color, that is luma(result) == 1.0 - 2*(1.0 - luma(color))
- *
- * @param amount factor by which to adjust the luma component of the color
- * @param chromaInverseGain (optional) factor by which to adjust the chroma
- * component of the color; 1.0 means no change, 0.0 maximizes chroma
- * @see Rainbow::shade
- */
-RAINBOW_EXPORT QColor
-lighten(const QColor &, qreal amount = 0.5, qreal chromaInverseGain = 1.0);
-
-/**
- * Adjust the luma of a color by changing its distance from black.
- *
- * @li amount == 1.0 gives black
- * @li amount == 0.5 results in a color whose luma is halfway between 0.0
- * and that of the original color
- * @li amount == 0.0 gives the original color
- * @li amount == -1.0 gives a color that is 'twice as far from black' as
- * the original color, that is luma(result) == 2*luma(color)
- *
- * @param amount factor by which to adjust the luma component of the color
- * @param chromaGain (optional) factor by which to adjust the chroma
- * component of the color; 1.0 means no change, 0.0 minimizes chroma
- * @see Rainbow::shade
- */
-RAINBOW_EXPORT QColor darken(const QColor &, qreal amount = 0.5, qreal chromaGain = 1.0);
-
-/**
- * Adjust the luma and chroma components of a color. The amount is added
- * to the corresponding component.
- *
- * @param lumaAmount amount by which to adjust the luma component of the
- * color; 0.0 results in no change, -1.0 turns anything black, 1.0 turns
- * anything white
- * @param chromaAmount (optional) amount by which to adjust the chroma
- * component of the color; 0.0 results in no change, -1.0 minimizes chroma,
- * 1.0 maximizes chroma
- * @see Rainbow::luma
- */
-RAINBOW_EXPORT QColor shade(const QColor &, qreal lumaAmount, qreal chromaAmount = 0.0);
-
-/**
- * Create a new color by tinting one color with another. This function is
- * meant for creating additional colors withings the same class (background,
- * foreground) from colors in a different class. Therefore when @p amount
- * is low, the luma of @p base is mostly preserved, while the hue and
- * chroma of @p color is mostly inherited.
- *
- * @param base color to be tinted
- * @param color color with which to tint
- * @param amount how strongly to tint the base; 0.0 gives @p base,
- * 1.0 gives @p color
- */
-RAINBOW_EXPORT QColor tint(const QColor &base, const QColor &color, qreal amount = 0.3);
-
-/**
- * Blend two colors into a new color by linear combination.
- * @code
-	QColor lighter = Rainbow::mix(myColor, Qt::white)
- * @endcode
- * @param c1 first color.
- * @param c2 second color.
- * @param bias weight to be used for the mix. @p bias <= 0 gives @p c1,
- * @p bias >= 1 gives @p c2. @p bias == 0.5 gives a 50% blend of @p c1
- * and @p c2.
- */
-RAINBOW_EXPORT QColor mix(const QColor &c1, const QColor &c2, qreal bias = 0.5);
-
-/**
- * Blend two colors into a new color by painting the second color over the
- * first using the specified composition mode.
- * @code
-	QColor white(Qt::white);
-	white.setAlphaF(0.5);
-	QColor lighter = Rainbow::overlayColors(myColor, white);
-   @endcode
- * @param base the base color (alpha channel is ignored).
- * @param paint the color to be overlayed onto the base color.
- * @param comp the CompositionMode used to do the blending.
- */
-RAINBOW_EXPORT QColor
-overlayColors(const QColor &base, const QColor &paint,
-			  QPainter::CompositionMode comp = QPainter::CompositionMode_SourceOver);
-}
diff --git a/depends/rainbow/include/rainbow_config.h b/depends/rainbow/include/rainbow_config.h
deleted file mode 100644
index ccd500ed..00000000
--- a/depends/rainbow/include/rainbow_config.h
+++ /dev/null
@@ -1,26 +0,0 @@
-/* Copyright 2013-2015 MultiMC Contributors
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-#include <QtCore/QtGlobal>
-
-#ifdef RAINBOW_STATIC
-	#define RAINBOW_EXPORT
-#else
-	#ifdef RAINBOW_LIBRARY
-		#define RAINBOW_EXPORT Q_DECL_EXPORT
-	#else
-		#define RAINBOW_EXPORT Q_DECL_IMPORT
-	#endif
-#endif
\ No newline at end of file
diff --git a/depends/rainbow/src/rainbow.cpp b/depends/rainbow/src/rainbow.cpp
deleted file mode 100644
index 8502fcd0..00000000
--- a/depends/rainbow/src/rainbow.cpp
+++ /dev/null
@@ -1,365 +0,0 @@
-/* This was part of the KDE project - see KGuiAddons
- * Copyright (C) 2007 Matthew Woehlke <mw_triad@users.sourceforge.net>
- * Copyright (C) 2007 Olaf Schmidt <ojschmidt@kde.org>
- * Copyright (C) 2007 Thomas Zander <zander@kde.org>
- * Copyright (C) 2007 Zack Rusin <zack@kde.org>
- * Copyright (C) 2015 Petr Mrazek <peterix@gmail.com>
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Library General Public
- * License as published by the Free Software Foundation; either
- * version 2 of the License, or (at your option) any later version.
- *
- * This library 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
- * Library General Public License for more details.
- *
- * You should have received a copy of the GNU Library General Public License
- * along with this library; see the file COPYING.LIB.  If not, write to
- * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
- * Boston, MA 02110-1301, USA.
- */
-
-#include "../include/rainbow.h"
-
-#include <QColor>
-#include <QImage>
-#include <QtNumeric> // qIsNaN
-
-#include <math.h>
-
-//BEGIN internal helper functions
-
-static inline qreal wrap(qreal a, qreal d = 1.0)
-{
-	qreal r = fmod(a, d);
-	return (r < 0.0 ? d + r : (r > 0.0 ? r : 0.0));
-}
-
-// normalize: like qBound(a, 0.0, 1.0) but without needing the args and with
-// "safer" behavior on NaN (isnan(a) -> return 0.0)
-static inline qreal normalize(qreal a)
-{
-    return (a < 1.0 ? (a > 0.0 ? a : 0.0) : 1.0);
-}
-
-
-///////////////////////////////////////////////////////////////////////////////
-// HCY color space
-
-#define HCY_REC 709 // use 709 for now
-#if HCY_REC == 601
-static const qreal yc[3] = {0.299, 0.587, 0.114};
-#elif HCY_REC == 709
-static const qreal yc[3] = {0.2126, 0.7152, 0.0722};
-#else // use Qt values
-static const qreal yc[3] = {0.34375, 0.5, 0.15625};
-#endif
-
-class KHCY
-{
-public:
-	explicit KHCY(const QColor &color)
-	{
-		qreal r = gamma(color.redF());
-		qreal g = gamma(color.greenF());
-		qreal b = gamma(color.blueF());
-		a = color.alphaF();
-
-		// luma component
-		y = lumag(r, g, b);
-
-		// hue component
-		qreal p = qMax(qMax(r, g), b);
-		qreal n = qMin(qMin(r, g), b);
-		qreal d = 6.0 * (p - n);
-		if (n == p)
-		{
-			h = 0.0;
-		}
-		else if (r == p)
-		{
-			h = ((g - b) / d);
-		}
-		else if (g == p)
-		{
-			h = ((b - r) / d) + (1.0 / 3.0);
-		}
-		else
-		{
-			h = ((r - g) / d) + (2.0 / 3.0);
-		}
-
-		// chroma component
-		if (r == g && g == b)
-		{
-			c = 0.0;
-		}
-		else
-		{
-			c = qMax((y - n) / y, (p - y) / (1 - y));
-		}
-	}
-	explicit KHCY(qreal h_, qreal c_, qreal y_, qreal a_ = 1.0)
-	{
-		h = h_;
-		c = c_;
-		y = y_;
-		a = a_;
-	}
-
-	QColor qColor() const
-	{
-		// start with sane component values
-		qreal _h = wrap(h);
-		qreal _c = normalize(c);
-		qreal _y = normalize(y);
-
-		// calculate some needed variables
-		qreal _hs = _h * 6.0, th, tm;
-		if (_hs < 1.0)
-		{
-			th = _hs;
-			tm = yc[0] + yc[1] * th;
-		}
-		else if (_hs < 2.0)
-		{
-			th = 2.0 - _hs;
-			tm = yc[1] + yc[0] * th;
-		}
-		else if (_hs < 3.0)
-		{
-			th = _hs - 2.0;
-			tm = yc[1] + yc[2] * th;
-		}
-		else if (_hs < 4.0)
-		{
-			th = 4.0 - _hs;
-			tm = yc[2] + yc[1] * th;
-		}
-		else if (_hs < 5.0)
-		{
-			th = _hs - 4.0;
-			tm = yc[2] + yc[0] * th;
-		}
-		else
-		{
-			th = 6.0 - _hs;
-			tm = yc[0] + yc[2] * th;
-		}
-
-		// calculate RGB channels in sorted order
-		qreal tn, to, tp;
-		if (tm >= _y)
-		{
-			tp = _y + _y * _c * (1.0 - tm) / tm;
-			to = _y + _y * _c * (th - tm) / tm;
-			tn = _y - (_y * _c);
-		}
-		else
-		{
-			tp = _y + (1.0 - _y) * _c;
-			to = _y + (1.0 - _y) * _c * (th - tm) / (1.0 - tm);
-			tn = _y - (1.0 - _y) * _c * tm / (1.0 - tm);
-		}
-
-		// return RGB channels in appropriate order
-		if (_hs < 1.0)
-		{
-			return QColor::fromRgbF(igamma(tp), igamma(to), igamma(tn), a);
-		}
-		else if (_hs < 2.0)
-		{
-			return QColor::fromRgbF(igamma(to), igamma(tp), igamma(tn), a);
-		}
-		else if (_hs < 3.0)
-		{
-			return QColor::fromRgbF(igamma(tn), igamma(tp), igamma(to), a);
-		}
-		else if (_hs < 4.0)
-		{
-			return QColor::fromRgbF(igamma(tn), igamma(to), igamma(tp), a);
-		}
-		else if (_hs < 5.0)
-		{
-			return QColor::fromRgbF(igamma(to), igamma(tn), igamma(tp), a);
-		}
-		else
-		{
-			return QColor::fromRgbF(igamma(tp), igamma(tn), igamma(to), a);
-		}
-	}
-
-	qreal h, c, y, a;
-	static qreal luma(const QColor &color)
-	{
-		return lumag(gamma(color.redF()), gamma(color.greenF()), gamma(color.blueF()));
-	}
-
-private:
-	static qreal gamma(qreal n)
-	{
-		return pow(normalize(n), 2.2);
-	}
-	static qreal igamma(qreal n)
-	{
-		return pow(normalize(n), 1.0 / 2.2);
-	}
-	static qreal lumag(qreal r, qreal g, qreal b)
-	{
-		return r * yc[0] + g * yc[1] + b * yc[2];
-	}
-};
-
-static inline qreal mixQreal(qreal a, qreal b, qreal bias)
-{
-	return a + (b - a) * bias;
-}
-//END internal helper functions
-
-qreal Rainbow::luma(const QColor &color)
-{
-	return KHCY::luma(color);
-}
-
-void Rainbow::getHcy(const QColor &color, qreal *h, qreal *c, qreal *y, qreal *a)
-{
-	if (!c || !h || !y)
-	{
-		return;
-	}
-	KHCY khcy(color);
-	*c = khcy.c;
-	*h = khcy.h;
-	*y = khcy.y;
-	if (a)
-	{
-		*a = khcy.a;
-	}
-}
-
-static qreal contrastRatioForLuma(qreal y1, qreal y2)
-{
-	if (y1 > y2)
-	{
-		return (y1 + 0.05) / (y2 + 0.05);
-	}
-	else
-	{
-		return (y2 + 0.05) / (y1 + 0.05);
-	}
-}
-
-qreal Rainbow::contrastRatio(const QColor &c1, const QColor &c2)
-{
-	return contrastRatioForLuma(luma(c1), luma(c2));
-}
-
-QColor Rainbow::lighten(const QColor &color, qreal ky, qreal kc)
-{
-	KHCY c(color);
-	c.y = 1.0 - normalize((1.0 - c.y) * (1.0 - ky));
-	c.c = 1.0 - normalize((1.0 - c.c) * kc);
-	return c.qColor();
-}
-
-QColor Rainbow::darken(const QColor &color, qreal ky, qreal kc)
-{
-	KHCY c(color);
-	c.y = normalize(c.y * (1.0 - ky));
-	c.c = normalize(c.c * kc);
-	return c.qColor();
-}
-
-QColor Rainbow::shade(const QColor &color, qreal ky, qreal kc)
-{
-	KHCY c(color);
-	c.y = normalize(c.y + ky);
-	c.c = normalize(c.c + kc);
-	return c.qColor();
-}
-
-static QColor tintHelper(const QColor &base, qreal baseLuma, const QColor &color, qreal amount)
-{
-	KHCY result(Rainbow::mix(base, color, pow(amount, 0.3)));
-	result.y = mixQreal(baseLuma, result.y, amount);
-
-	return result.qColor();
-}
-
-QColor Rainbow::tint(const QColor &base, const QColor &color, qreal amount)
-{
-	if (amount <= 0.0)
-	{
-		return base;
-	}
-	if (amount >= 1.0)
-	{
-		return color;
-	}
-	if (qIsNaN(amount))
-	{
-		return base;
-	}
-
-	qreal baseLuma = luma(base); // cache value because luma call is expensive
-	double ri = contrastRatioForLuma(baseLuma, luma(color));
-	double rg = 1.0 + ((ri + 1.0) * amount * amount * amount);
-	double u = 1.0, l = 0.0;
-	QColor result;
-	for (int i = 12; i; --i)
-	{
-		double a = 0.5 * (l + u);
-		result = tintHelper(base, baseLuma, color, a);
-		double ra = contrastRatioForLuma(baseLuma, luma(result));
-		if (ra > rg)
-		{
-			u = a;
-		}
-		else
-		{
-			l = a;
-		}
-	}
-	return result;
-}
-
-QColor Rainbow::mix(const QColor &c1, const QColor &c2, qreal bias)
-{
-	if (bias <= 0.0)
-	{
-		return c1;
-	}
-	if (bias >= 1.0)
-	{
-		return c2;
-	}
-	if (qIsNaN(bias))
-	{
-		return c1;
-	}
-
-	qreal r = mixQreal(c1.redF(), c2.redF(), bias);
-	qreal g = mixQreal(c1.greenF(), c2.greenF(), bias);
-	qreal b = mixQreal(c1.blueF(), c2.blueF(), bias);
-	qreal a = mixQreal(c1.alphaF(), c2.alphaF(), bias);
-
-	return QColor::fromRgbF(r, g, b, a);
-}
-
-QColor Rainbow::overlayColors(const QColor &base, const QColor &paint,
-							  QPainter::CompositionMode comp)
-{
-	// This isn't the fastest way, but should be "fast enough".
-	// It's also the only safe way to use QPainter::CompositionMode
-	QImage img(1, 1, QImage::Format_ARGB32_Premultiplied);
-	QPainter p(&img);
-	QColor start = base;
-	start.setAlpha(255); // opaque
-	p.fillRect(0, 0, 1, 1, start);
-	p.setCompositionMode(comp);
-	p.fillRect(0, 0, 1, 1, paint);
-	p.end();
-	return img.pixel(0, 0);
-}
diff --git a/depends/xz-embedded/CMakeLists.txt b/depends/xz-embedded/CMakeLists.txt
deleted file mode 100644
index 5f744671..00000000
--- a/depends/xz-embedded/CMakeLists.txt
+++ /dev/null
@@ -1,26 +0,0 @@
-cmake_minimum_required(VERSION 3.1)
-project(xz-embedded LANGUAGES C)
-
-option(XZ_BUILD_BCJ "Build xz-embedded with BCJ support (native binary optimization)" OFF)
-option(XZ_BUILD_CRC64 "Build xz-embedded with CRC64 checksum support" ON)
-option(XZ_BUILD_MINIDEC "Build a tiny utility that decompresses xz streams" OFF)
-
-# See include/xz.h for manual feature configuration
-# tweak this list and xz.h to fit your needs
-
-set(XZ_SOURCES
-	src/xz_crc32.c
-	src/xz_crc64.c
-	src/xz_dec_lzma2.c
-	src/xz_dec_stream.c
-#	src/xz_dec_bcj.c
-)
-add_library(xz-embedded STATIC ${XZ_SOURCES})
-target_include_directories(xz-embedded PUBLIC "${CMAKE_CURRENT_SOURCE_DIR}/include")
-set_property(TARGET xz-embedded PROPERTY C_STANDARD 99)
-
-if(${XZ_BUILD_MINIDEC})
-	add_executable(xzminidec xzminidec.c)
-	target_link_libraries(xzminidec xz-embedded)
-	set_property(TARGET xzminidec PROPERTY C_STANDARD 99)
-endif()
diff --git a/depends/xz-embedded/include/xz.h b/depends/xz-embedded/include/xz.h
deleted file mode 100644
index eef8ef69..00000000
--- a/depends/xz-embedded/include/xz.h
+++ /dev/null
@@ -1,321 +0,0 @@
-/*
- * XZ decompressor
- *
- * Authors: Lasse Collin <lasse.collin@tukaani.org>
- *          Igor Pavlov <http://7-zip.org/>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-#ifndef XZ_H
-#define XZ_H
-
-#ifdef __KERNEL__
-#include <linux/stddef.h>
-#include <linux/types.h>
-#else
-#include <stddef.h>
-#include <stdint.h>
-#endif
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/* Definitions that determine available features */
-#define XZ_DEC_ANY_CHECK 1
-#define XZ_USE_CRC64 1
-
-// native machine code compression stuff
-/*
-#define XZ_DEC_X86
-#define XZ_DEC_POWERPC
-#define XZ_DEC_IA64
-#define XZ_DEC_ARM
-#define XZ_DEC_ARMTHUMB
-#define XZ_DEC_SPARC
-*/
-
-/* In Linux, this is used to make extern functions static when needed. */
-#ifndef XZ_EXTERN
-#define XZ_EXTERN extern
-#endif
-
-/**
- * enum xz_mode - Operation mode
- *
- * @XZ_SINGLE:              Single-call mode. This uses less RAM than
- *                          than multi-call modes, because the LZMA2
- *                          dictionary doesn't need to be allocated as
- *                          part of the decoder state. All required data
- *                          structures are allocated at initialization,
- *                          so xz_dec_run() cannot return XZ_MEM_ERROR.
- * @XZ_PREALLOC:            Multi-call mode with preallocated LZMA2
- *                          dictionary buffer. All data structures are
- *                          allocated at initialization, so xz_dec_run()
- *                          cannot return XZ_MEM_ERROR.
- * @XZ_DYNALLOC:            Multi-call mode. The LZMA2 dictionary is
- *                          allocated once the required size has been
- *                          parsed from the stream headers. If the
- *                          allocation fails, xz_dec_run() will return
- *                          XZ_MEM_ERROR.
- *
- * It is possible to enable support only for a subset of the above
- * modes at compile time by defining XZ_DEC_SINGLE, XZ_DEC_PREALLOC,
- * or XZ_DEC_DYNALLOC. The xz_dec kernel module is always compiled
- * with support for all operation modes, but the preboot code may
- * be built with fewer features to minimize code size.
- */
-enum xz_mode
-{
-	XZ_SINGLE,
-	XZ_PREALLOC,
-	XZ_DYNALLOC
-};
-
-/**
- * enum xz_ret - Return codes
- * @XZ_OK:                  Everything is OK so far. More input or more
- *                          output space is required to continue. This
- *                          return code is possible only in multi-call mode
- *                          (XZ_PREALLOC or XZ_DYNALLOC).
- * @XZ_STREAM_END:          Operation finished successfully.
- * @XZ_UNSUPPORTED_CHECK:   Integrity check type is not supported. Decoding
- *                          is still possible in multi-call mode by simply
- *                          calling xz_dec_run() again.
- *                          Note that this return value is used only if
- *                          XZ_DEC_ANY_CHECK was defined at build time,
- *                          which is not used in the kernel. Unsupported
- *                          check types return XZ_OPTIONS_ERROR if
- *                          XZ_DEC_ANY_CHECK was not defined at build time.
- * @XZ_MEM_ERROR:           Allocating memory failed. This return code is
- *                          possible only if the decoder was initialized
- *                          with XZ_DYNALLOC. The amount of memory that was
- *                          tried to be allocated was no more than the
- *                          dict_max argument given to xz_dec_init().
- * @XZ_MEMLIMIT_ERROR:      A bigger LZMA2 dictionary would be needed than
- *                          allowed by the dict_max argument given to
- *                          xz_dec_init(). This return value is possible
- *                          only in multi-call mode (XZ_PREALLOC or
- *                          XZ_DYNALLOC); the single-call mode (XZ_SINGLE)
- *                          ignores the dict_max argument.
- * @XZ_FORMAT_ERROR:        File format was not recognized (wrong magic
- *                          bytes).
- * @XZ_OPTIONS_ERROR:       This implementation doesn't support the requested
- *                          compression options. In the decoder this means
- *                          that the header CRC32 matches, but the header
- *                          itself specifies something that we don't support.
- * @XZ_DATA_ERROR:          Compressed data is corrupt.
- * @XZ_BUF_ERROR:           Cannot make any progress. Details are slightly
- *                          different between multi-call and single-call
- *                          mode; more information below.
- *
- * In multi-call mode, XZ_BUF_ERROR is returned when two consecutive calls
- * to XZ code cannot consume any input and cannot produce any new output.
- * This happens when there is no new input available, or the output buffer
- * is full while at least one output byte is still pending. Assuming your
- * code is not buggy, you can get this error only when decoding a compressed
- * stream that is truncated or otherwise corrupt.
- *
- * In single-call mode, XZ_BUF_ERROR is returned only when the output buffer
- * is too small or the compressed input is corrupt in a way that makes the
- * decoder produce more output than the caller expected. When it is
- * (relatively) clear that the compressed input is truncated, XZ_DATA_ERROR
- * is used instead of XZ_BUF_ERROR.
- */
-enum xz_ret
-{
-	XZ_OK,
-	XZ_STREAM_END,
-	XZ_UNSUPPORTED_CHECK,
-	XZ_MEM_ERROR,
-	XZ_MEMLIMIT_ERROR,
-	XZ_FORMAT_ERROR,
-	XZ_OPTIONS_ERROR,
-	XZ_DATA_ERROR,
-	XZ_BUF_ERROR
-};
-
-/**
- * struct xz_buf - Passing input and output buffers to XZ code
- * @in:         Beginning of the input buffer. This may be NULL if and only
- *              if in_pos is equal to in_size.
- * @in_pos:     Current position in the input buffer. This must not exceed
- *              in_size.
- * @in_size:    Size of the input buffer
- * @out:        Beginning of the output buffer. This may be NULL if and only
- *              if out_pos is equal to out_size.
- * @out_pos:    Current position in the output buffer. This must not exceed
- *              out_size.
- * @out_size:   Size of the output buffer
- *
- * Only the contents of the output buffer from out[out_pos] onward, and
- * the variables in_pos and out_pos are modified by the XZ code.
- */
-struct xz_buf
-{
-	const uint8_t *in;
-	size_t in_pos;
-	size_t in_size;
-
-	uint8_t *out;
-	size_t out_pos;
-	size_t out_size;
-};
-
-/**
- * struct xz_dec - Opaque type to hold the XZ decoder state
- */
-struct xz_dec;
-
-/**
- * xz_dec_init() - Allocate and initialize a XZ decoder state
- * @mode:       Operation mode
- * @dict_max:   Maximum size of the LZMA2 dictionary (history buffer) for
- *              multi-call decoding. This is ignored in single-call mode
- *              (mode == XZ_SINGLE). LZMA2 dictionary is always 2^n bytes
- *              or 2^n + 2^(n-1) bytes (the latter sizes are less common
- *              in practice), so other values for dict_max don't make sense.
- *              In the kernel, dictionary sizes of 64 KiB, 128 KiB, 256 KiB,
- *              512 KiB, and 1 MiB are probably the only reasonable values,
- *              except for kernel and initramfs images where a bigger
- *              dictionary can be fine and useful.
- *
- * Single-call mode (XZ_SINGLE): xz_dec_run() decodes the whole stream at
- * once. The caller must provide enough output space or the decoding will
- * fail. The output space is used as the dictionary buffer, which is why
- * there is no need to allocate the dictionary as part of the decoder's
- * internal state.
- *
- * Because the output buffer is used as the workspace, streams encoded using
- * a big dictionary are not a problem in single-call mode. It is enough that
- * the output buffer is big enough to hold the actual uncompressed data; it
- * can be smaller than the dictionary size stored in the stream headers.
- *
- * Multi-call mode with preallocated dictionary (XZ_PREALLOC): dict_max bytes
- * of memory is preallocated for the LZMA2 dictionary. This way there is no
- * risk that xz_dec_run() could run out of memory, since xz_dec_run() will
- * never allocate any memory. Instead, if the preallocated dictionary is too
- * small for decoding the given input stream, xz_dec_run() will return
- * XZ_MEMLIMIT_ERROR. Thus, it is important to know what kind of data will be
- * decoded to avoid allocating excessive amount of memory for the dictionary.
- *
- * Multi-call mode with dynamically allocated dictionary (XZ_DYNALLOC):
- * dict_max specifies the maximum allowed dictionary size that xz_dec_run()
- * may allocate once it has parsed the dictionary size from the stream
- * headers. This way excessive allocations can be avoided while still
- * limiting the maximum memory usage to a sane value to prevent running the
- * system out of memory when decompressing streams from untrusted sources.
- *
- * On success, xz_dec_init() returns a pointer to struct xz_dec, which is
- * ready to be used with xz_dec_run(). If memory allocation fails,
- * xz_dec_init() returns NULL.
- */
-XZ_EXTERN struct xz_dec *xz_dec_init(enum xz_mode mode, uint32_t dict_max);
-
-/**
- * xz_dec_run() - Run the XZ decoder
- * @s:          Decoder state allocated using xz_dec_init()
- * @b:          Input and output buffers
- *
- * The possible return values depend on build options and operation mode.
- * See enum xz_ret for details.
- *
- * Note that if an error occurs in single-call mode (return value is not
- * XZ_STREAM_END), b->in_pos and b->out_pos are not modified and the
- * contents of the output buffer from b->out[b->out_pos] onward are
- * undefined. This is true even after XZ_BUF_ERROR, because with some filter
- * chains, there may be a second pass over the output buffer, and this pass
- * cannot be properly done if the output buffer is truncated. Thus, you
- * cannot give the single-call decoder a too small buffer and then expect to
- * get that amount valid data from the beginning of the stream. You must use
- * the multi-call decoder if you don't want to uncompress the whole stream.
- */
-XZ_EXTERN enum xz_ret xz_dec_run(struct xz_dec *s, struct xz_buf *b);
-
-/**
- * xz_dec_reset() - Reset an already allocated decoder state
- * @s:          Decoder state allocated using xz_dec_init()
- *
- * This function can be used to reset the multi-call decoder state without
- * freeing and reallocating memory with xz_dec_end() and xz_dec_init().
- *
- * In single-call mode, xz_dec_reset() is always called in the beginning of
- * xz_dec_run(). Thus, explicit call to xz_dec_reset() is useful only in
- * multi-call mode.
- */
-XZ_EXTERN void xz_dec_reset(struct xz_dec *s);
-
-/**
- * xz_dec_end() - Free the memory allocated for the decoder state
- * @s:          Decoder state allocated using xz_dec_init(). If s is NULL,
- *              this function does nothing.
- */
-XZ_EXTERN void xz_dec_end(struct xz_dec *s);
-
-/*
- * Standalone build (userspace build or in-kernel build for boot time use)
- * needs a CRC32 implementation. For normal in-kernel use, kernel's own
- * CRC32 module is used instead, and users of this module don't need to
- * care about the functions below.
- */
-#ifndef XZ_INTERNAL_CRC32
-#ifdef __KERNEL__
-#define XZ_INTERNAL_CRC32 0
-#else
-#define XZ_INTERNAL_CRC32 1
-#endif
-#endif
-
-/*
- * If CRC64 support has been enabled with XZ_USE_CRC64, a CRC64
- * implementation is needed too.
- */
-#ifndef XZ_USE_CRC64
-#undef XZ_INTERNAL_CRC64
-#define XZ_INTERNAL_CRC64 0
-#endif
-#ifndef XZ_INTERNAL_CRC64
-#ifdef __KERNEL__
-#error Using CRC64 in the kernel has not been implemented.
-#else
-#define XZ_INTERNAL_CRC64 1
-#endif
-#endif
-
-#if XZ_INTERNAL_CRC32
-/*
- * This must be called before any other xz_* function to initialize
- * the CRC32 lookup table.
- */
-XZ_EXTERN void xz_crc32_init(void);
-
-/*
- * Update CRC32 value using the polynomial from IEEE-802.3. To start a new
- * calculation, the third argument must be zero. To continue the calculation,
- * the previously returned value is passed as the third argument.
- */
-XZ_EXTERN uint32_t xz_crc32(const uint8_t *buf, size_t size, uint32_t crc);
-#endif
-
-#if XZ_INTERNAL_CRC64
-/*
- * This must be called before any other xz_* function (except xz_crc32_init())
- * to initialize the CRC64 lookup table.
- */
-XZ_EXTERN void xz_crc64_init(void);
-
-/*
- * Update CRC64 value using the polynomial from ECMA-182. To start a new
- * calculation, the third argument must be zero. To continue the calculation,
- * the previously returned value is passed as the third argument.
- */
-XZ_EXTERN uint64_t xz_crc64(const uint8_t *buf, size_t size, uint64_t crc);
-#endif
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/depends/xz-embedded/src/xz_config.h b/depends/xz-embedded/src/xz_config.h
deleted file mode 100644
index 40805b75..00000000
--- a/depends/xz-embedded/src/xz_config.h
+++ /dev/null
@@ -1,119 +0,0 @@
-/*
- * Private includes and definitions for userspace use of XZ Embedded
- *
- * Author: Lasse Collin <lasse.collin@tukaani.org>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-#ifndef XZ_CONFIG_H
-#define XZ_CONFIG_H
-
-/* Uncomment to enable CRC64 support. */
-/* #define XZ_USE_CRC64 */
-
-/* Uncomment as needed to enable BCJ filter decoders. */
-/* #define XZ_DEC_X86 */
-/* #define XZ_DEC_POWERPC */
-/* #define XZ_DEC_IA64 */
-/* #define XZ_DEC_ARM */
-/* #define XZ_DEC_ARMTHUMB */
-/* #define XZ_DEC_SPARC */
-
-/*
- * MSVC doesn't support modern C but XZ Embedded is mostly C89
- * so these are enough.
- */
-#ifdef _MSC_VER
-typedef unsigned char bool;
-#define true 1
-#define false 0
-#define inline __inline
-#else
-#include <stdbool.h>
-#endif
-
-#include <stdlib.h>
-#include <string.h>
-
-#include "xz.h"
-
-#define kmalloc(size, flags) malloc(size)
-#define kfree(ptr) free(ptr)
-#define vmalloc(size) malloc(size)
-#define vfree(ptr) free(ptr)
-
-#define memeq(a, b, size) (memcmp(a, b, size) == 0)
-#define memzero(buf, size) memset(buf, 0, size)
-
-#ifndef min
-#define min(x, y) ((x) < (y) ? (x) : (y))
-#endif
-#define min_t(type, x, y) min(x, y)
-
-/*
- * Some functions have been marked with __always_inline to keep the
- * performance reasonable even when the compiler is optimizing for
- * small code size. You may be able to save a few bytes by #defining
- * __always_inline to plain inline, but don't complain if the code
- * becomes slow.
- *
- * NOTE: System headers on GNU/Linux may #define this macro already,
- * so if you want to change it, you need to #undef it first.
- */
-#ifndef __always_inline
-#ifdef __GNUC__
-#define __always_inline inline __attribute__((__always_inline__))
-#else
-#define __always_inline inline
-#endif
-#endif
-
-/* Inline functions to access unaligned unsigned 32-bit integers */
-#ifndef get_unaligned_le32
-static inline uint32_t get_unaligned_le32(const uint8_t *buf)
-{
-	return (uint32_t)buf[0] | ((uint32_t)buf[1] << 8) | ((uint32_t)buf[2] << 16) |
-		   ((uint32_t)buf[3] << 24);
-}
-#endif
-
-#ifndef get_unaligned_be32
-static inline uint32_t get_unaligned_be32(const uint8_t *buf)
-{
-	return (uint32_t)(buf[0] << 24) | ((uint32_t)buf[1] << 16) | ((uint32_t)buf[2] << 8) |
-		   (uint32_t)buf[3];
-}
-#endif
-
-#ifndef put_unaligned_le32
-static inline void put_unaligned_le32(uint32_t val, uint8_t *buf)
-{
-	buf[0] = (uint8_t)val;
-	buf[1] = (uint8_t)(val >> 8);
-	buf[2] = (uint8_t)(val >> 16);
-	buf[3] = (uint8_t)(val >> 24);
-}
-#endif
-
-#ifndef put_unaligned_be32
-static inline void put_unaligned_be32(uint32_t val, uint8_t *buf)
-{
-	buf[0] = (uint8_t)(val >> 24);
-	buf[1] = (uint8_t)(val >> 16);
-	buf[2] = (uint8_t)(val >> 8);
-	buf[3] = (uint8_t)val;
-}
-#endif
-
-/*
- * Use get_unaligned_le32() also for aligned access for simplicity. On
- * little endian systems, #define get_le32(ptr) (*(const uint32_t *)(ptr))
- * could save a few bytes in code size.
- */
-#ifndef get_le32
-#define get_le32 get_unaligned_le32
-#endif
-
-#endif
diff --git a/depends/xz-embedded/src/xz_crc32.c b/depends/xz-embedded/src/xz_crc32.c
deleted file mode 100644
index c412662b..00000000
--- a/depends/xz-embedded/src/xz_crc32.c
+++ /dev/null
@@ -1,61 +0,0 @@
-/*
- * CRC32 using the polynomial from IEEE-802.3
- *
- * Authors: Lasse Collin <lasse.collin@tukaani.org>
- *          Igor Pavlov <http://7-zip.org/>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-/*
- * This is not the fastest implementation, but it is pretty compact.
- * The fastest versions of xz_crc32() on modern CPUs without hardware
- * accelerated CRC instruction are 3-5 times as fast as this version,
- * but they are bigger and use more memory for the lookup table.
- */
-
-#include "xz_private.h"
-
-/*
- * STATIC_RW_DATA is used in the pre-boot environment on some architectures.
- * See <linux/decompress/mm.h> for details.
- */
-#ifndef STATIC_RW_DATA
-#define STATIC_RW_DATA static
-#endif
-
-STATIC_RW_DATA uint32_t xz_crc32_table[256];
-
-XZ_EXTERN void xz_crc32_init(void)
-{
-	const uint32_t poly = 0xEDB88320;
-
-	uint32_t i;
-	uint32_t j;
-	uint32_t r;
-
-	for (i = 0; i < 256; ++i)
-	{
-		r = i;
-		for (j = 0; j < 8; ++j)
-			r = (r >> 1) ^ (poly & ~((r & 1) - 1));
-
-		xz_crc32_table[i] = r;
-	}
-
-	return;
-}
-
-XZ_EXTERN uint32_t xz_crc32(const uint8_t *buf, size_t size, uint32_t crc)
-{
-	crc = ~crc;
-
-	while (size != 0)
-	{
-		crc = xz_crc32_table[*buf++ ^ (crc & 0xFF)] ^ (crc >> 8);
-		--size;
-	}
-
-	return ~crc;
-}
diff --git a/depends/xz-embedded/src/xz_crc64.c b/depends/xz-embedded/src/xz_crc64.c
deleted file mode 100644
index 4794b9d3..00000000
--- a/depends/xz-embedded/src/xz_crc64.c
+++ /dev/null
@@ -1,52 +0,0 @@
-/*
- * CRC64 using the polynomial from ECMA-182
- *
- * This file is similar to xz_crc32.c. See the comments there.
- *
- * Authors: Lasse Collin <lasse.collin@tukaani.org>
- *          Igor Pavlov <http://7-zip.org/>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-#include "xz_private.h"
-
-#ifndef STATIC_RW_DATA
-#define STATIC_RW_DATA static
-#endif
-
-STATIC_RW_DATA uint64_t xz_crc64_table[256];
-
-XZ_EXTERN void xz_crc64_init(void)
-{
-	const uint64_t poly = 0xC96C5795D7870F42;
-
-	uint32_t i;
-	uint32_t j;
-	uint64_t r;
-
-	for (i = 0; i < 256; ++i)
-	{
-		r = i;
-		for (j = 0; j < 8; ++j)
-			r = (r >> 1) ^ (poly & ~((r & 1) - 1));
-
-		xz_crc64_table[i] = r;
-	}
-
-	return;
-}
-
-XZ_EXTERN uint64_t xz_crc64(const uint8_t *buf, size_t size, uint64_t crc)
-{
-	crc = ~crc;
-
-	while (size != 0)
-	{
-		crc = xz_crc64_table[*buf++ ^ (crc & 0xFF)] ^ (crc >> 8);
-		--size;
-	}
-
-	return ~crc;
-}
diff --git a/depends/xz-embedded/src/xz_dec_bcj.c b/depends/xz-embedded/src/xz_dec_bcj.c
deleted file mode 100644
index 9ffda3bd..00000000
--- a/depends/xz-embedded/src/xz_dec_bcj.c
+++ /dev/null
@@ -1,588 +0,0 @@
-/*
- * Branch/Call/Jump (BCJ) filter decoders
- *
- * Authors: Lasse Collin <lasse.collin@tukaani.org>
- *          Igor Pavlov <http://7-zip.org/>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-#include "xz_private.h"
-
-/*
- * The rest of the file is inside this ifdef. It makes things a little more
- * convenient when building without support for any BCJ filters.
- */
-#ifdef XZ_DEC_BCJ
-
-struct xz_dec_bcj
-{
-	/* Type of the BCJ filter being used */
-	enum
-	{
-		BCJ_X86 = 4,	  /* x86 or x86-64 */
-		BCJ_POWERPC = 5,  /* Big endian only */
-		BCJ_IA64 = 6,	 /* Big or little endian */
-		BCJ_ARM = 7,	  /* Little endian only */
-		BCJ_ARMTHUMB = 8, /* Little endian only */
-		BCJ_SPARC = 9	 /* Big or little endian */
-	} type;
-
-	/*
-	 * Return value of the next filter in the chain. We need to preserve
-	 * this information across calls, because we must not call the next
-	 * filter anymore once it has returned XZ_STREAM_END.
-	 */
-	enum xz_ret ret;
-
-	/* True if we are operating in single-call mode. */
-	bool single_call;
-
-	/*
-	 * Absolute position relative to the beginning of the uncompressed
-	 * data (in a single .xz Block). We care only about the lowest 32
-	 * bits so this doesn't need to be uint64_t even with big files.
-	 */
-	uint32_t pos;
-
-	/* x86 filter state */
-	uint32_t x86_prev_mask;
-
-	/* Temporary space to hold the variables from struct xz_buf */
-	uint8_t *out;
-	size_t out_pos;
-	size_t out_size;
-
-	struct
-	{
-		/* Amount of already filtered data in the beginning of buf */
-		size_t filtered;
-
-		/* Total amount of data currently stored in buf  */
-		size_t size;
-
-		/*
-		 * Buffer to hold a mix of filtered and unfiltered data. This
-		 * needs to be big enough to hold Alignment + 2 * Look-ahead:
-		 *
-		 * Type         Alignment   Look-ahead
-		 * x86              1           4
-		 * PowerPC          4           0
-		 * IA-64           16           0
-		 * ARM              4           0
-		 * ARM-Thumb        2           2
-		 * SPARC            4           0
-		 */
-		uint8_t buf[16];
-	} temp;
-};
-
-#ifdef XZ_DEC_X86
-/*
- * This is used to test the most significant byte of a memory address
- * in an x86 instruction.
- */
-static inline int bcj_x86_test_msbyte(uint8_t b)
-{
-	return b == 0x00 || b == 0xFF;
-}
-
-static size_t bcj_x86(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
-{
-	static const bool mask_to_allowed_status[8] = {true, true,  true,  false,
-												   true, false, false, false};
-
-	static const uint8_t mask_to_bit_num[8] = {0, 1, 2, 2, 3, 3, 3, 3};
-
-	size_t i;
-	size_t prev_pos = (size_t) - 1;
-	uint32_t prev_mask = s->x86_prev_mask;
-	uint32_t src;
-	uint32_t dest;
-	uint32_t j;
-	uint8_t b;
-
-	if (size <= 4)
-		return 0;
-
-	size -= 4;
-	for (i = 0; i < size; ++i)
-	{
-		if ((buf[i] & 0xFE) != 0xE8)
-			continue;
-
-		prev_pos = i - prev_pos;
-		if (prev_pos > 3)
-		{
-			prev_mask = 0;
-		}
-		else
-		{
-			prev_mask = (prev_mask << (prev_pos - 1)) & 7;
-			if (prev_mask != 0)
-			{
-				b = buf[i + 4 - mask_to_bit_num[prev_mask]];
-				if (!mask_to_allowed_status[prev_mask] || bcj_x86_test_msbyte(b))
-				{
-					prev_pos = i;
-					prev_mask = (prev_mask << 1) | 1;
-					continue;
-				}
-			}
-		}
-
-		prev_pos = i;
-
-		if (bcj_x86_test_msbyte(buf[i + 4]))
-		{
-			src = get_unaligned_le32(buf + i + 1);
-			while (true)
-			{
-				dest = src - (s->pos + (uint32_t)i + 5);
-				if (prev_mask == 0)
-					break;
-
-				j = mask_to_bit_num[prev_mask] * 8;
-				b = (uint8_t)(dest >> (24 - j));
-				if (!bcj_x86_test_msbyte(b))
-					break;
-
-				src = dest ^ (((uint32_t)1 << (32 - j)) - 1);
-			}
-
-			dest &= 0x01FFFFFF;
-			dest |= (uint32_t)0 - (dest & 0x01000000);
-			put_unaligned_le32(dest, buf + i + 1);
-			i += 4;
-		}
-		else
-		{
-			prev_mask = (prev_mask << 1) | 1;
-		}
-	}
-
-	prev_pos = i - prev_pos;
-	s->x86_prev_mask = prev_pos > 3 ? 0 : prev_mask << (prev_pos - 1);
-	return i;
-}
-#endif
-
-#ifdef XZ_DEC_POWERPC
-static size_t bcj_powerpc(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
-{
-	size_t i;
-	uint32_t instr;
-
-	for (i = 0; i + 4 <= size; i += 4)
-	{
-		instr = get_unaligned_be32(buf + i);
-		if ((instr & 0xFC000003) == 0x48000001)
-		{
-			instr &= 0x03FFFFFC;
-			instr -= s->pos + (uint32_t)i;
-			instr &= 0x03FFFFFC;
-			instr |= 0x48000001;
-			put_unaligned_be32(instr, buf + i);
-		}
-	}
-
-	return i;
-}
-#endif
-
-#ifdef XZ_DEC_IA64
-static size_t bcj_ia64(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
-{
-	static const uint8_t branch_table[32] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-											 4, 4, 6, 6, 0, 0, 7, 7, 4, 4, 0, 0, 4, 4, 0, 0};
-
-	/*
-	 * The local variables take a little bit stack space, but it's less
-	 * than what LZMA2 decoder takes, so it doesn't make sense to reduce
-	 * stack usage here without doing that for the LZMA2 decoder too.
-	 */
-
-	/* Loop counters */
-	size_t i;
-	size_t j;
-
-	/* Instruction slot (0, 1, or 2) in the 128-bit instruction word */
-	uint32_t slot;
-
-	/* Bitwise offset of the instruction indicated by slot */
-	uint32_t bit_pos;
-
-	/* bit_pos split into byte and bit parts */
-	uint32_t byte_pos;
-	uint32_t bit_res;
-
-	/* Address part of an instruction */
-	uint32_t addr;
-
-	/* Mask used to detect which instructions to convert */
-	uint32_t mask;
-
-	/* 41-bit instruction stored somewhere in the lowest 48 bits */
-	uint64_t instr;
-
-	/* Instruction normalized with bit_res for easier manipulation */
-	uint64_t norm;
-
-	for (i = 0; i + 16 <= size; i += 16)
-	{
-		mask = branch_table[buf[i] & 0x1F];
-		for (slot = 0, bit_pos = 5; slot < 3; ++slot, bit_pos += 41)
-		{
-			if (((mask >> slot) & 1) == 0)
-				continue;
-
-			byte_pos = bit_pos >> 3;
-			bit_res = bit_pos & 7;
-			instr = 0;
-			for (j = 0; j < 6; ++j)
-				instr |= (uint64_t)(buf[i + j + byte_pos]) << (8 * j);
-
-			norm = instr >> bit_res;
-
-			if (((norm >> 37) & 0x0F) == 0x05 && ((norm >> 9) & 0x07) == 0)
-			{
-				addr = (norm >> 13) & 0x0FFFFF;
-				addr |= ((uint32_t)(norm >> 36) & 1) << 20;
-				addr <<= 4;
-				addr -= s->pos + (uint32_t)i;
-				addr >>= 4;
-
-				norm &= ~((uint64_t)0x8FFFFF << 13);
-				norm |= (uint64_t)(addr & 0x0FFFFF) << 13;
-				norm |= (uint64_t)(addr & 0x100000) << (36 - 20);
-
-				instr &= (1 << bit_res) - 1;
-				instr |= norm << bit_res;
-
-				for (j = 0; j < 6; j++)
-					buf[i + j + byte_pos] = (uint8_t)(instr >> (8 * j));
-			}
-		}
-	}
-
-	return i;
-}
-#endif
-
-#ifdef XZ_DEC_ARM
-static size_t bcj_arm(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
-{
-	size_t i;
-	uint32_t addr;
-
-	for (i = 0; i + 4 <= size; i += 4)
-	{
-		if (buf[i + 3] == 0xEB)
-		{
-			addr =
-				(uint32_t)buf[i] | ((uint32_t)buf[i + 1] << 8) | ((uint32_t)buf[i + 2] << 16);
-			addr <<= 2;
-			addr -= s->pos + (uint32_t)i + 8;
-			addr >>= 2;
-			buf[i] = (uint8_t)addr;
-			buf[i + 1] = (uint8_t)(addr >> 8);
-			buf[i + 2] = (uint8_t)(addr >> 16);
-		}
-	}
-
-	return i;
-}
-#endif
-
-#ifdef XZ_DEC_ARMTHUMB
-static size_t bcj_armthumb(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
-{
-	size_t i;
-	uint32_t addr;
-
-	for (i = 0; i + 4 <= size; i += 2)
-	{
-		if ((buf[i + 1] & 0xF8) == 0xF0 && (buf[i + 3] & 0xF8) == 0xF8)
-		{
-			addr = (((uint32_t)buf[i + 1] & 0x07) << 19) | ((uint32_t)buf[i] << 11) |
-				   (((uint32_t)buf[i + 3] & 0x07) << 8) | (uint32_t)buf[i + 2];
-			addr <<= 1;
-			addr -= s->pos + (uint32_t)i + 4;
-			addr >>= 1;
-			buf[i + 1] = (uint8_t)(0xF0 | ((addr >> 19) & 0x07));
-			buf[i] = (uint8_t)(addr >> 11);
-			buf[i + 3] = (uint8_t)(0xF8 | ((addr >> 8) & 0x07));
-			buf[i + 2] = (uint8_t)addr;
-			i += 2;
-		}
-	}
-
-	return i;
-}
-#endif
-
-#ifdef XZ_DEC_SPARC
-static size_t bcj_sparc(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
-{
-	size_t i;
-	uint32_t instr;
-
-	for (i = 0; i + 4 <= size; i += 4)
-	{
-		instr = get_unaligned_be32(buf + i);
-		if ((instr >> 22) == 0x100 || (instr >> 22) == 0x1FF)
-		{
-			instr <<= 2;
-			instr -= s->pos + (uint32_t)i;
-			instr >>= 2;
-			instr =
-				((uint32_t)0x40000000 - (instr & 0x400000)) | 0x40000000 | (instr & 0x3FFFFF);
-			put_unaligned_be32(instr, buf + i);
-		}
-	}
-
-	return i;
-}
-#endif
-
-/*
- * Apply the selected BCJ filter. Update *pos and s->pos to match the amount
- * of data that got filtered.
- *
- * NOTE: This is implemented as a switch statement to avoid using function
- * pointers, which could be problematic in the kernel boot code, which must
- * avoid pointers to static data (at least on x86).
- */
-static void bcj_apply(struct xz_dec_bcj *s, uint8_t *buf, size_t *pos, size_t size)
-{
-	size_t filtered;
-
-	buf += *pos;
-	size -= *pos;
-
-	switch (s->type)
-	{
-#ifdef XZ_DEC_X86
-	case BCJ_X86:
-		filtered = bcj_x86(s, buf, size);
-		break;
-#endif
-#ifdef XZ_DEC_POWERPC
-	case BCJ_POWERPC:
-		filtered = bcj_powerpc(s, buf, size);
-		break;
-#endif
-#ifdef XZ_DEC_IA64
-	case BCJ_IA64:
-		filtered = bcj_ia64(s, buf, size);
-		break;
-#endif
-#ifdef XZ_DEC_ARM
-	case BCJ_ARM:
-		filtered = bcj_arm(s, buf, size);
-		break;
-#endif
-#ifdef XZ_DEC_ARMTHUMB
-	case BCJ_ARMTHUMB:
-		filtered = bcj_armthumb(s, buf, size);
-		break;
-#endif
-#ifdef XZ_DEC_SPARC
-	case BCJ_SPARC:
-		filtered = bcj_sparc(s, buf, size);
-		break;
-#endif
-	default:
-		/* Never reached but silence compiler warnings. */
-		filtered = 0;
-		break;
-	}
-
-	*pos += filtered;
-	s->pos += filtered;
-}
-
-/*
- * Flush pending filtered data from temp to the output buffer.
- * Move the remaining mixture of possibly filtered and unfiltered
- * data to the beginning of temp.
- */
-static void bcj_flush(struct xz_dec_bcj *s, struct xz_buf *b)
-{
-	size_t copy_size;
-
-	copy_size = min_t(size_t, s->temp.filtered, b->out_size - b->out_pos);
-	memcpy(b->out + b->out_pos, s->temp.buf, copy_size);
-	b->out_pos += copy_size;
-
-	s->temp.filtered -= copy_size;
-	s->temp.size -= copy_size;
-	memmove(s->temp.buf, s->temp.buf + copy_size, s->temp.size);
-}
-
-/*
- * The BCJ filter functions are primitive in sense that they process the
- * data in chunks of 1-16 bytes. To hide this issue, this function does
- * some buffering.
- */
-XZ_EXTERN enum xz_ret xz_dec_bcj_run(struct xz_dec_bcj *s, struct xz_dec_lzma2 *lzma2,
-									 struct xz_buf *b)
-{
-	size_t out_start;
-
-	/*
-	 * Flush pending already filtered data to the output buffer. Return
-	 * immediatelly if we couldn't flush everything, or if the next
-	 * filter in the chain had already returned XZ_STREAM_END.
-	 */
-	if (s->temp.filtered > 0)
-	{
-		bcj_flush(s, b);
-		if (s->temp.filtered > 0)
-			return XZ_OK;
-
-		if (s->ret == XZ_STREAM_END)
-			return XZ_STREAM_END;
-	}
-
-	/*
-	 * If we have more output space than what is currently pending in
-	 * temp, copy the unfiltered data from temp to the output buffer
-	 * and try to fill the output buffer by decoding more data from the
-	 * next filter in the chain. Apply the BCJ filter on the new data
-	 * in the output buffer. If everything cannot be filtered, copy it
-	 * to temp and rewind the output buffer position accordingly.
-	 *
-	 * This needs to be always run when temp.size == 0 to handle a special
-	 * case where the output buffer is full and the next filter has no
-	 * more output coming but hasn't returned XZ_STREAM_END yet.
-	 */
-	if (s->temp.size < b->out_size - b->out_pos || s->temp.size == 0)
-	{
-		out_start = b->out_pos;
-		memcpy(b->out + b->out_pos, s->temp.buf, s->temp.size);
-		b->out_pos += s->temp.size;
-
-		s->ret = xz_dec_lzma2_run(lzma2, b);
-		if (s->ret != XZ_STREAM_END && (s->ret != XZ_OK || s->single_call))
-			return s->ret;
-
-		bcj_apply(s, b->out, &out_start, b->out_pos);
-
-		/*
-		 * As an exception, if the next filter returned XZ_STREAM_END,
-		 * we can do that too, since the last few bytes that remain
-		 * unfiltered are meant to remain unfiltered.
-		 */
-		if (s->ret == XZ_STREAM_END)
-			return XZ_STREAM_END;
-
-		s->temp.size = b->out_pos - out_start;
-		b->out_pos -= s->temp.size;
-		memcpy(s->temp.buf, b->out + b->out_pos, s->temp.size);
-
-		/*
-		 * If there wasn't enough input to the next filter to fill
-		 * the output buffer with unfiltered data, there's no point
-		 * to try decoding more data to temp.
-		 */
-		if (b->out_pos + s->temp.size < b->out_size)
-			return XZ_OK;
-	}
-
-	/*
-	 * We have unfiltered data in temp. If the output buffer isn't full
-	 * yet, try to fill the temp buffer by decoding more data from the
-	 * next filter. Apply the BCJ filter on temp. Then we hopefully can
-	 * fill the actual output buffer by copying filtered data from temp.
-	 * A mix of filtered and unfiltered data may be left in temp; it will
-	 * be taken care on the next call to this function.
-	 */
-	if (b->out_pos < b->out_size)
-	{
-		/* Make b->out{,_pos,_size} temporarily point to s->temp. */
-		s->out = b->out;
-		s->out_pos = b->out_pos;
-		s->out_size = b->out_size;
-		b->out = s->temp.buf;
-		b->out_pos = s->temp.size;
-		b->out_size = sizeof(s->temp.buf);
-
-		s->ret = xz_dec_lzma2_run(lzma2, b);
-
-		s->temp.size = b->out_pos;
-		b->out = s->out;
-		b->out_pos = s->out_pos;
-		b->out_size = s->out_size;
-
-		if (s->ret != XZ_OK && s->ret != XZ_STREAM_END)
-			return s->ret;
-
-		bcj_apply(s, s->temp.buf, &s->temp.filtered, s->temp.size);
-
-		/*
-		 * If the next filter returned XZ_STREAM_END, we mark that
-		 * everything is filtered, since the last unfiltered bytes
-		 * of the stream are meant to be left as is.
-		 */
-		if (s->ret == XZ_STREAM_END)
-			s->temp.filtered = s->temp.size;
-
-		bcj_flush(s, b);
-		if (s->temp.filtered > 0)
-			return XZ_OK;
-	}
-
-	return s->ret;
-}
-
-XZ_EXTERN struct xz_dec_bcj *xz_dec_bcj_create(bool single_call)
-{
-	struct xz_dec_bcj *s = kmalloc(sizeof(*s), GFP_KERNEL);
-	if (s != NULL)
-		s->single_call = single_call;
-
-	return s;
-}
-
-XZ_EXTERN enum xz_ret xz_dec_bcj_reset(struct xz_dec_bcj *s, uint8_t id)
-{
-	switch (id)
-	{
-#ifdef XZ_DEC_X86
-	case BCJ_X86:
-#endif
-#ifdef XZ_DEC_POWERPC
-	case BCJ_POWERPC:
-#endif
-#ifdef XZ_DEC_IA64
-	case BCJ_IA64:
-#endif
-#ifdef XZ_DEC_ARM
-	case BCJ_ARM:
-#endif
-#ifdef XZ_DEC_ARMTHUMB
-	case BCJ_ARMTHUMB:
-#endif
-#ifdef XZ_DEC_SPARC
-	case BCJ_SPARC:
-#endif
-		break;
-
-	default:
-		/* Unsupported Filter ID */
-		return XZ_OPTIONS_ERROR;
-	}
-
-	s->type = id;
-	s->ret = XZ_OK;
-	s->pos = 0;
-	s->x86_prev_mask = 0;
-	s->temp.filtered = 0;
-	s->temp.size = 0;
-
-	return XZ_OK;
-}
-
-#endif
diff --git a/depends/xz-embedded/src/xz_dec_lzma2.c b/depends/xz-embedded/src/xz_dec_lzma2.c
deleted file mode 100644
index 3d7b9a2e..00000000
--- a/depends/xz-embedded/src/xz_dec_lzma2.c
+++ /dev/null
@@ -1,1231 +0,0 @@
-/*
- * LZMA2 decoder
- *
- * Authors: Lasse Collin <lasse.collin@tukaani.org>
- *          Igor Pavlov <http://7-zip.org/>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-#include "xz_private.h"
-#include "xz_lzma2.h"
-
-/*
- * Range decoder initialization eats the first five bytes of each LZMA chunk.
- */
-#define RC_INIT_BYTES 5
-
-/*
- * Minimum number of usable input buffer to safely decode one LZMA symbol.
- * The worst case is that we decode 22 bits using probabilities and 26
- * direct bits. This may decode at maximum of 20 bytes of input. However,
- * lzma_main() does an extra normalization before returning, thus we
- * need to put 21 here.
- */
-#define LZMA_IN_REQUIRED 21
-
-/*
- * Dictionary (history buffer)
- *
- * These are always true:
- *    start <= pos <= full <= end
- *    pos <= limit <= end
- *
- * In multi-call mode, also these are true:
- *    end == size
- *    size <= size_max
- *    allocated <= size
- *
- * Most of these variables are size_t to support single-call mode,
- * in which the dictionary variables address the actual output
- * buffer directly.
- */
-struct dictionary
-{
-	/* Beginning of the history buffer */
-	uint8_t *buf;
-
-	/* Old position in buf (before decoding more data) */
-	size_t start;
-
-	/* Position in buf */
-	size_t pos;
-
-	/*
-	 * How full dictionary is. This is used to detect corrupt input that
-	 * would read beyond the beginning of the uncompressed stream.
-	 */
-	size_t full;
-
-	/* Write limit; we don't write to buf[limit] or later bytes. */
-	size_t limit;
-
-	/*
-	 * End of the dictionary buffer. In multi-call mode, this is
-	 * the same as the dictionary size. In single-call mode, this
-	 * indicates the size of the output buffer.
-	 */
-	size_t end;
-
-	/*
-	 * Size of the dictionary as specified in Block Header. This is used
-	 * together with "full" to detect corrupt input that would make us
-	 * read beyond the beginning of the uncompressed stream.
-	 */
-	uint32_t size;
-
-	/*
-	 * Maximum allowed dictionary size in multi-call mode.
-	 * This is ignored in single-call mode.
-	 */
-	uint32_t size_max;
-
-	/*
-	 * Amount of memory currently allocated for the dictionary.
-	 * This is used only with XZ_DYNALLOC. (With XZ_PREALLOC,
-	 * size_max is always the same as the allocated size.)
-	 */
-	uint32_t allocated;
-
-	/* Operation mode */
-	enum xz_mode mode;
-};
-
-/* Range decoder */
-struct rc_dec
-{
-	uint32_t range;
-	uint32_t code;
-
-	/*
-	 * Number of initializing bytes remaining to be read
-	 * by rc_read_init().
-	 */
-	uint32_t init_bytes_left;
-
-	/*
-	 * Buffer from which we read our input. It can be either
-	 * temp.buf or the caller-provided input buffer.
-	 */
-	const uint8_t *in;
-	size_t in_pos;
-	size_t in_limit;
-};
-
-/* Probabilities for a length decoder. */
-struct lzma_len_dec
-{
-	/* Probability of match length being at least 10 */
-	uint16_t choice;
-
-	/* Probability of match length being at least 18 */
-	uint16_t choice2;
-
-	/* Probabilities for match lengths 2-9 */
-	uint16_t low[POS_STATES_MAX][LEN_LOW_SYMBOLS];
-
-	/* Probabilities for match lengths 10-17 */
-	uint16_t mid[POS_STATES_MAX][LEN_MID_SYMBOLS];
-
-	/* Probabilities for match lengths 18-273 */
-	uint16_t high[LEN_HIGH_SYMBOLS];
-};
-
-struct lzma_dec
-{
-	/* Distances of latest four matches */
-	uint32_t rep0;
-	uint32_t rep1;
-	uint32_t rep2;
-	uint32_t rep3;
-
-	/* Types of the most recently seen LZMA symbols */
-	enum lzma_state state;
-
-	/*
-	 * Length of a match. This is updated so that dict_repeat can
-	 * be called again to finish repeating the whole match.
-	 */
-	uint32_t len;
-
-	/*
-	 * LZMA properties or related bit masks (number of literal
-	 * context bits, a mask dervied from the number of literal
-	 * position bits, and a mask dervied from the number
-	 * position bits)
-	 */
-	uint32_t lc;
-	uint32_t literal_pos_mask; /* (1 << lp) - 1 */
-	uint32_t pos_mask;		 /* (1 << pb) - 1 */
-
-	/* If 1, it's a match. Otherwise it's a single 8-bit literal. */
-	uint16_t is_match[STATES][POS_STATES_MAX];
-
-	/* If 1, it's a repeated match. The distance is one of rep0 .. rep3. */
-	uint16_t is_rep[STATES];
-
-	/*
-	 * If 0, distance of a repeated match is rep0.
-	 * Otherwise check is_rep1.
-	 */
-	uint16_t is_rep0[STATES];
-
-	/*
-	 * If 0, distance of a repeated match is rep1.
-	 * Otherwise check is_rep2.
-	 */
-	uint16_t is_rep1[STATES];
-
-	/* If 0, distance of a repeated match is rep2. Otherwise it is rep3. */
-	uint16_t is_rep2[STATES];
-
-	/*
-	 * If 1, the repeated match has length of one byte. Otherwise
-	 * the length is decoded from rep_len_decoder.
-	 */
-	uint16_t is_rep0_long[STATES][POS_STATES_MAX];
-
-	/*
-	 * Probability tree for the highest two bits of the match
-	 * distance. There is a separate probability tree for match
-	 * lengths of 2 (i.e. MATCH_LEN_MIN), 3, 4, and [5, 273].
-	 */
-	uint16_t dist_slot[DIST_STATES][DIST_SLOTS];
-
-	/*
-	 * Probility trees for additional bits for match distance
-	 * when the distance is in the range [4, 127].
-	 */
-	uint16_t dist_special[FULL_DISTANCES - DIST_MODEL_END];
-
-	/*
-	 * Probability tree for the lowest four bits of a match
-	 * distance that is equal to or greater than 128.
-	 */
-	uint16_t dist_align[ALIGN_SIZE];
-
-	/* Length of a normal match */
-	struct lzma_len_dec match_len_dec;
-
-	/* Length of a repeated match */
-	struct lzma_len_dec rep_len_dec;
-
-	/* Probabilities of literals */
-	uint16_t literal[LITERAL_CODERS_MAX][LITERAL_CODER_SIZE];
-};
-
-struct lzma2_dec
-{
-	/* Position in xz_dec_lzma2_run(). */
-	enum lzma2_seq
-	{
-		SEQ_CONTROL,
-		SEQ_UNCOMPRESSED_1,
-		SEQ_UNCOMPRESSED_2,
-		SEQ_COMPRESSED_0,
-		SEQ_COMPRESSED_1,
-		SEQ_PROPERTIES,
-		SEQ_LZMA_PREPARE,
-		SEQ_LZMA_RUN,
-		SEQ_COPY
-	} sequence;
-
-	/* Next position after decoding the compressed size of the chunk. */
-	enum lzma2_seq next_sequence;
-
-	/* Uncompressed size of LZMA chunk (2 MiB at maximum) */
-	uint32_t uncompressed;
-
-	/*
-	 * Compressed size of LZMA chunk or compressed/uncompressed
-	 * size of uncompressed chunk (64 KiB at maximum)
-	 */
-	uint32_t compressed;
-
-	/*
-	 * True if dictionary reset is needed. This is false before
-	 * the first chunk (LZMA or uncompressed).
-	 */
-	bool need_dict_reset;
-
-	/*
-	 * True if new LZMA properties are needed. This is false
-	 * before the first LZMA chunk.
-	 */
-	bool need_props;
-};
-
-struct xz_dec_lzma2
-{
-	/*
-	 * The order below is important on x86 to reduce code size and
-	 * it shouldn't hurt on other platforms. Everything up to and
-	 * including lzma.pos_mask are in the first 128 bytes on x86-32,
-	 * which allows using smaller instructions to access those
-	 * variables. On x86-64, fewer variables fit into the first 128
-	 * bytes, but this is still the best order without sacrificing
-	 * the readability by splitting the structures.
-	 */
-	struct rc_dec rc;
-	struct dictionary dict;
-	struct lzma2_dec lzma2;
-	struct lzma_dec lzma;
-
-	/*
-	 * Temporary buffer which holds small number of input bytes between
-	 * decoder calls. See lzma2_lzma() for details.
-	 */
-	struct
-	{
-		uint32_t size;
-		uint8_t buf[3 * LZMA_IN_REQUIRED];
-	} temp;
-};
-
-/**************
- * Dictionary *
- **************/
-
-/*
- * Reset the dictionary state. When in single-call mode, set up the beginning
- * of the dictionary to point to the actual output buffer.
- */
-static void dict_reset(struct dictionary *dict, struct xz_buf *b)
-{
-	if (DEC_IS_SINGLE(dict->mode))
-	{
-		dict->buf = b->out + b->out_pos;
-		dict->end = b->out_size - b->out_pos;
-	}
-
-	dict->start = 0;
-	dict->pos = 0;
-	dict->limit = 0;
-	dict->full = 0;
-}
-
-/* Set dictionary write limit */
-static void dict_limit(struct dictionary *dict, size_t out_max)
-{
-	if (dict->end - dict->pos <= out_max)
-		dict->limit = dict->end;
-	else
-		dict->limit = dict->pos + out_max;
-}
-
-/* Return true if at least one byte can be written into the dictionary. */
-static inline bool dict_has_space(const struct dictionary *dict)
-{
-	return dict->pos < dict->limit;
-}
-
-/*
- * Get a byte from the dictionary at the given distance. The distance is
- * assumed to valid, or as a special case, zero when the dictionary is
- * still empty. This special case is needed for single-call decoding to
- * avoid writing a '\0' to the end of the destination buffer.
- */
-static inline uint32_t dict_get(const struct dictionary *dict, uint32_t dist)
-{
-	size_t offset = dict->pos - dist - 1;
-
-	if (dist >= dict->pos)
-		offset += dict->end;
-
-	return dict->full > 0 ? dict->buf[offset] : 0;
-}
-
-/*
- * Put one byte into the dictionary. It is assumed that there is space for it.
- */
-static inline void dict_put(struct dictionary *dict, uint8_t byte)
-{
-	dict->buf[dict->pos++] = byte;
-
-	if (dict->full < dict->pos)
-		dict->full = dict->pos;
-}
-
-/*
- * Repeat given number of bytes from the given distance. If the distance is
- * invalid, false is returned. On success, true is returned and *len is
- * updated to indicate how many bytes were left to be repeated.
- */
-static bool dict_repeat(struct dictionary *dict, uint32_t *len, uint32_t dist)
-{
-	size_t back;
-	uint32_t left;
-
-	if (dist >= dict->full || dist >= dict->size)
-		return false;
-
-	left = min_t(size_t, dict->limit - dict->pos, *len);
-	*len -= left;
-
-	back = dict->pos - dist - 1;
-	if (dist >= dict->pos)
-		back += dict->end;
-
-	do
-	{
-		dict->buf[dict->pos++] = dict->buf[back++];
-		if (back == dict->end)
-			back = 0;
-	} while (--left > 0);
-
-	if (dict->full < dict->pos)
-		dict->full = dict->pos;
-
-	return true;
-}
-
-/* Copy uncompressed data as is from input to dictionary and output buffers. */
-static void dict_uncompressed(struct dictionary *dict, struct xz_buf *b, uint32_t *left)
-{
-	size_t copy_size;
-
-	while (*left > 0 && b->in_pos < b->in_size && b->out_pos < b->out_size)
-	{
-		copy_size = min(b->in_size - b->in_pos, b->out_size - b->out_pos);
-		if (copy_size > dict->end - dict->pos)
-			copy_size = dict->end - dict->pos;
-		if (copy_size > *left)
-			copy_size = *left;
-
-		*left -= copy_size;
-
-		memcpy(dict->buf + dict->pos, b->in + b->in_pos, copy_size);
-		dict->pos += copy_size;
-
-		if (dict->full < dict->pos)
-			dict->full = dict->pos;
-
-		if (DEC_IS_MULTI(dict->mode))
-		{
-			if (dict->pos == dict->end)
-				dict->pos = 0;
-
-			memcpy(b->out + b->out_pos, b->in + b->in_pos, copy_size);
-		}
-
-		dict->start = dict->pos;
-
-		b->out_pos += copy_size;
-		b->in_pos += copy_size;
-	}
-}
-
-/*
- * Flush pending data from dictionary to b->out. It is assumed that there is
- * enough space in b->out. This is guaranteed because caller uses dict_limit()
- * before decoding data into the dictionary.
- */
-static uint32_t dict_flush(struct dictionary *dict, struct xz_buf *b)
-{
-	size_t copy_size = dict->pos - dict->start;
-
-	if (DEC_IS_MULTI(dict->mode))
-	{
-		if (dict->pos == dict->end)
-			dict->pos = 0;
-
-		memcpy(b->out + b->out_pos, dict->buf + dict->start, copy_size);
-	}
-
-	dict->start = dict->pos;
-	b->out_pos += copy_size;
-	return copy_size;
-}
-
-/*****************
- * Range decoder *
- *****************/
-
-/* Reset the range decoder. */
-static void rc_reset(struct rc_dec *rc)
-{
-	rc->range = (uint32_t) - 1;
-	rc->code = 0;
-	rc->init_bytes_left = RC_INIT_BYTES;
-}
-
-/*
- * Read the first five initial bytes into rc->code if they haven't been
- * read already. (Yes, the first byte gets completely ignored.)
- */
-static bool rc_read_init(struct rc_dec *rc, struct xz_buf *b)
-{
-	while (rc->init_bytes_left > 0)
-	{
-		if (b->in_pos == b->in_size)
-			return false;
-
-		rc->code = (rc->code << 8) + b->in[b->in_pos++];
-		--rc->init_bytes_left;
-	}
-
-	return true;
-}
-
-/* Return true if there may not be enough input for the next decoding loop. */
-static inline bool rc_limit_exceeded(const struct rc_dec *rc)
-{
-	return rc->in_pos > rc->in_limit;
-}
-
-/*
- * Return true if it is possible (from point of view of range decoder) that
- * we have reached the end of the LZMA chunk.
- */
-static inline bool rc_is_finished(const struct rc_dec *rc)
-{
-	return rc->code == 0;
-}
-
-/* Read the next input byte if needed. */
-static __always_inline void rc_normalize(struct rc_dec *rc)
-{
-	if (rc->range < RC_TOP_VALUE)
-	{
-		rc->range <<= RC_SHIFT_BITS;
-		rc->code = (rc->code << RC_SHIFT_BITS) + rc->in[rc->in_pos++];
-	}
-}
-
-/*
- * Decode one bit. In some versions, this function has been splitted in three
- * functions so that the compiler is supposed to be able to more easily avoid
- * an extra branch. In this particular version of the LZMA decoder, this
- * doesn't seem to be a good idea (tested with GCC 3.3.6, 3.4.6, and 4.3.3
- * on x86). Using a non-splitted version results in nicer looking code too.
- *
- * NOTE: This must return an int. Do not make it return a bool or the speed
- * of the code generated by GCC 3.x decreases 10-15 %. (GCC 4.3 doesn't care,
- * and it generates 10-20 % faster code than GCC 3.x from this file anyway.)
- */
-static __always_inline int rc_bit(struct rc_dec *rc, uint16_t *prob)
-{
-	uint32_t bound;
-	int bit;
-
-	rc_normalize(rc);
-	bound = (rc->range >> RC_BIT_MODEL_TOTAL_BITS) * *prob;
-	if (rc->code < bound)
-	{
-		rc->range = bound;
-		*prob += (RC_BIT_MODEL_TOTAL - *prob) >> RC_MOVE_BITS;
-		bit = 0;
-	}
-	else
-	{
-		rc->range -= bound;
-		rc->code -= bound;
-		*prob -= *prob >> RC_MOVE_BITS;
-		bit = 1;
-	}
-
-	return bit;
-}
-
-/* Decode a bittree starting from the most significant bit. */
-static __always_inline uint32_t rc_bittree(struct rc_dec *rc, uint16_t *probs, uint32_t limit)
-{
-	uint32_t symbol = 1;
-
-	do
-	{
-		if (rc_bit(rc, &probs[symbol]))
-			symbol = (symbol << 1) + 1;
-		else
-			symbol <<= 1;
-	} while (symbol < limit);
-
-	return symbol;
-}
-
-/* Decode a bittree starting from the least significant bit. */
-static __always_inline void rc_bittree_reverse(struct rc_dec *rc, uint16_t *probs,
-											   uint32_t *dest, uint32_t limit)
-{
-	uint32_t symbol = 1;
-	uint32_t i = 0;
-
-	do
-	{
-		if (rc_bit(rc, &probs[symbol]))
-		{
-			symbol = (symbol << 1) + 1;
-			*dest += 1 << i;
-		}
-		else
-		{
-			symbol <<= 1;
-		}
-	} while (++i < limit);
-}
-
-/* Decode direct bits (fixed fifty-fifty probability) */
-static inline void rc_direct(struct rc_dec *rc, uint32_t *dest, uint32_t limit)
-{
-	uint32_t mask;
-
-	do
-	{
-		rc_normalize(rc);
-		rc->range >>= 1;
-		rc->code -= rc->range;
-		mask = (uint32_t)0 - (rc->code >> 31);
-		rc->code += rc->range & mask;
-		*dest = (*dest << 1) + (mask + 1);
-	} while (--limit > 0);
-}
-
-/********
- * LZMA *
- ********/
-
-/* Get pointer to literal coder probability array. */
-static uint16_t *lzma_literal_probs(struct xz_dec_lzma2 *s)
-{
-	uint32_t prev_byte = dict_get(&s->dict, 0);
-	uint32_t low = prev_byte >> (8 - s->lzma.lc);
-	uint32_t high = (s->dict.pos & s->lzma.literal_pos_mask) << s->lzma.lc;
-	return s->lzma.literal[low + high];
-}
-
-/* Decode a literal (one 8-bit byte) */
-static void lzma_literal(struct xz_dec_lzma2 *s)
-{
-	uint16_t *probs;
-	uint32_t symbol;
-	uint32_t match_byte;
-	uint32_t match_bit;
-	uint32_t offset;
-	uint32_t i;
-
-	probs = lzma_literal_probs(s);
-
-	if (lzma_state_is_literal(s->lzma.state))
-	{
-		symbol = rc_bittree(&s->rc, probs, 0x100);
-	}
-	else
-	{
-		symbol = 1;
-		match_byte = dict_get(&s->dict, s->lzma.rep0) << 1;
-		offset = 0x100;
-
-		do
-		{
-			match_bit = match_byte & offset;
-			match_byte <<= 1;
-			i = offset + match_bit + symbol;
-
-			if (rc_bit(&s->rc, &probs[i]))
-			{
-				symbol = (symbol << 1) + 1;
-				offset &= match_bit;
-			}
-			else
-			{
-				symbol <<= 1;
-				offset &= ~match_bit;
-			}
-		} while (symbol < 0x100);
-	}
-
-	dict_put(&s->dict, (uint8_t)symbol);
-	lzma_state_literal(&s->lzma.state);
-}
-
-/* Decode the length of the match into s->lzma.len. */
-static void lzma_len(struct xz_dec_lzma2 *s, struct lzma_len_dec *l, uint32_t pos_state)
-{
-	uint16_t *probs;
-	uint32_t limit;
-
-	if (!rc_bit(&s->rc, &l->choice))
-	{
-		probs = l->low[pos_state];
-		limit = LEN_LOW_SYMBOLS;
-		s->lzma.len = MATCH_LEN_MIN;
-	}
-	else
-	{
-		if (!rc_bit(&s->rc, &l->choice2))
-		{
-			probs = l->mid[pos_state];
-			limit = LEN_MID_SYMBOLS;
-			s->lzma.len = MATCH_LEN_MIN + LEN_LOW_SYMBOLS;
-		}
-		else
-		{
-			probs = l->high;
-			limit = LEN_HIGH_SYMBOLS;
-			s->lzma.len = MATCH_LEN_MIN + LEN_LOW_SYMBOLS + LEN_MID_SYMBOLS;
-		}
-	}
-
-	s->lzma.len += rc_bittree(&s->rc, probs, limit) - limit;
-}
-
-/* Decode a match. The distance will be stored in s->lzma.rep0. */
-static void lzma_match(struct xz_dec_lzma2 *s, uint32_t pos_state)
-{
-	uint16_t *probs;
-	uint32_t dist_slot;
-	uint32_t limit;
-
-	lzma_state_match(&s->lzma.state);
-
-	s->lzma.rep3 = s->lzma.rep2;
-	s->lzma.rep2 = s->lzma.rep1;
-	s->lzma.rep1 = s->lzma.rep0;
-
-	lzma_len(s, &s->lzma.match_len_dec, pos_state);
-
-	probs = s->lzma.dist_slot[lzma_get_dist_state(s->lzma.len)];
-	dist_slot = rc_bittree(&s->rc, probs, DIST_SLOTS) - DIST_SLOTS;
-
-	if (dist_slot < DIST_MODEL_START)
-	{
-		s->lzma.rep0 = dist_slot;
-	}
-	else
-	{
-		limit = (dist_slot >> 1) - 1;
-		s->lzma.rep0 = 2 + (dist_slot & 1);
-
-		if (dist_slot < DIST_MODEL_END)
-		{
-			s->lzma.rep0 <<= limit;
-			probs = s->lzma.dist_special + s->lzma.rep0 - dist_slot - 1;
-			rc_bittree_reverse(&s->rc, probs, &s->lzma.rep0, limit);
-		}
-		else
-		{
-			rc_direct(&s->rc, &s->lzma.rep0, limit - ALIGN_BITS);
-			s->lzma.rep0 <<= ALIGN_BITS;
-			rc_bittree_reverse(&s->rc, s->lzma.dist_align, &s->lzma.rep0, ALIGN_BITS);
-		}
-	}
-}
-
-/*
- * Decode a repeated match. The distance is one of the four most recently
- * seen matches. The distance will be stored in s->lzma.rep0.
- */
-static void lzma_rep_match(struct xz_dec_lzma2 *s, uint32_t pos_state)
-{
-	uint32_t tmp;
-
-	if (!rc_bit(&s->rc, &s->lzma.is_rep0[s->lzma.state]))
-	{
-		if (!rc_bit(&s->rc, &s->lzma.is_rep0_long[s->lzma.state][pos_state]))
-		{
-			lzma_state_short_rep(&s->lzma.state);
-			s->lzma.len = 1;
-			return;
-		}
-	}
-	else
-	{
-		if (!rc_bit(&s->rc, &s->lzma.is_rep1[s->lzma.state]))
-		{
-			tmp = s->lzma.rep1;
-		}
-		else
-		{
-			if (!rc_bit(&s->rc, &s->lzma.is_rep2[s->lzma.state]))
-			{
-				tmp = s->lzma.rep2;
-			}
-			else
-			{
-				tmp = s->lzma.rep3;
-				s->lzma.rep3 = s->lzma.rep2;
-			}
-
-			s->lzma.rep2 = s->lzma.rep1;
-		}
-
-		s->lzma.rep1 = s->lzma.rep0;
-		s->lzma.rep0 = tmp;
-	}
-
-	lzma_state_long_rep(&s->lzma.state);
-	lzma_len(s, &s->lzma.rep_len_dec, pos_state);
-}
-
-/* LZMA decoder core */
-static bool lzma_main(struct xz_dec_lzma2 *s)
-{
-	uint32_t pos_state;
-
-	/*
-	 * If the dictionary was reached during the previous call, try to
-	 * finish the possibly pending repeat in the dictionary.
-	 */
-	if (dict_has_space(&s->dict) && s->lzma.len > 0)
-		dict_repeat(&s->dict, &s->lzma.len, s->lzma.rep0);
-
-	/*
-	 * Decode more LZMA symbols. One iteration may consume up to
-	 * LZMA_IN_REQUIRED - 1 bytes.
-	 */
-	while (dict_has_space(&s->dict) && !rc_limit_exceeded(&s->rc))
-	{
-		pos_state = s->dict.pos & s->lzma.pos_mask;
-
-		if (!rc_bit(&s->rc, &s->lzma.is_match[s->lzma.state][pos_state]))
-		{
-			lzma_literal(s);
-		}
-		else
-		{
-			if (rc_bit(&s->rc, &s->lzma.is_rep[s->lzma.state]))
-				lzma_rep_match(s, pos_state);
-			else
-				lzma_match(s, pos_state);
-
-			if (!dict_repeat(&s->dict, &s->lzma.len, s->lzma.rep0))
-				return false;
-		}
-	}
-
-	/*
-	 * Having the range decoder always normalized when we are outside
-	 * this function makes it easier to correctly handle end of the chunk.
-	 */
-	rc_normalize(&s->rc);
-
-	return true;
-}
-
-/*
- * Reset the LZMA decoder and range decoder state. Dictionary is nore reset
- * here, because LZMA state may be reset without resetting the dictionary.
- */
-static void lzma_reset(struct xz_dec_lzma2 *s)
-{
-	uint16_t *probs;
-	size_t i;
-
-	s->lzma.state = STATE_LIT_LIT;
-	s->lzma.rep0 = 0;
-	s->lzma.rep1 = 0;
-	s->lzma.rep2 = 0;
-	s->lzma.rep3 = 0;
-
-	/*
-	 * All probabilities are initialized to the same value. This hack
-	 * makes the code smaller by avoiding a separate loop for each
-	 * probability array.
-	 *
-	 * This could be optimized so that only that part of literal
-	 * probabilities that are actually required. In the common case
-	 * we would write 12 KiB less.
-	 */
-	probs = s->lzma.is_match[0];
-	for (i = 0; i < PROBS_TOTAL; ++i)
-		probs[i] = RC_BIT_MODEL_TOTAL / 2;
-
-	rc_reset(&s->rc);
-}
-
-/*
- * Decode and validate LZMA properties (lc/lp/pb) and calculate the bit masks
- * from the decoded lp and pb values. On success, the LZMA decoder state is
- * reset and true is returned.
- */
-static bool lzma_props(struct xz_dec_lzma2 *s, uint8_t props)
-{
-	if (props > (4 * 5 + 4) * 9 + 8)
-		return false;
-
-	s->lzma.pos_mask = 0;
-	while (props >= 9 * 5)
-	{
-		props -= 9 * 5;
-		++s->lzma.pos_mask;
-	}
-
-	s->lzma.pos_mask = (1 << s->lzma.pos_mask) - 1;
-
-	s->lzma.literal_pos_mask = 0;
-	while (props >= 9)
-	{
-		props -= 9;
-		++s->lzma.literal_pos_mask;
-	}
-
-	s->lzma.lc = props;
-
-	if (s->lzma.lc + s->lzma.literal_pos_mask > 4)
-		return false;
-
-	s->lzma.literal_pos_mask = (1 << s->lzma.literal_pos_mask) - 1;
-
-	lzma_reset(s);
-
-	return true;
-}
-
-/*********
- * LZMA2 *
- *********/
-
-/*
- * The LZMA decoder assumes that if the input limit (s->rc.in_limit) hasn't
- * been exceeded, it is safe to read up to LZMA_IN_REQUIRED bytes. This
- * wrapper function takes care of making the LZMA decoder's assumption safe.
- *
- * As long as there is plenty of input left to be decoded in the current LZMA
- * chunk, we decode directly from the caller-supplied input buffer until
- * there's LZMA_IN_REQUIRED bytes left. Those remaining bytes are copied into
- * s->temp.buf, which (hopefully) gets filled on the next call to this
- * function. We decode a few bytes from the temporary buffer so that we can
- * continue decoding from the caller-supplied input buffer again.
- */
-static bool lzma2_lzma(struct xz_dec_lzma2 *s, struct xz_buf *b)
-{
-	size_t in_avail;
-	uint32_t tmp;
-
-	in_avail = b->in_size - b->in_pos;
-	if (s->temp.size > 0 || s->lzma2.compressed == 0)
-	{
-		tmp = 2 * LZMA_IN_REQUIRED - s->temp.size;
-		if (tmp > s->lzma2.compressed - s->temp.size)
-			tmp = s->lzma2.compressed - s->temp.size;
-		if (tmp > in_avail)
-			tmp = in_avail;
-
-		memcpy(s->temp.buf + s->temp.size, b->in + b->in_pos, tmp);
-
-		if (s->temp.size + tmp == s->lzma2.compressed)
-		{
-			memzero(s->temp.buf + s->temp.size + tmp, sizeof(s->temp.buf) - s->temp.size - tmp);
-			s->rc.in_limit = s->temp.size + tmp;
-		}
-		else if (s->temp.size + tmp < LZMA_IN_REQUIRED)
-		{
-			s->temp.size += tmp;
-			b->in_pos += tmp;
-			return true;
-		}
-		else
-		{
-			s->rc.in_limit = s->temp.size + tmp - LZMA_IN_REQUIRED;
-		}
-
-		s->rc.in = s->temp.buf;
-		s->rc.in_pos = 0;
-
-		if (!lzma_main(s) || s->rc.in_pos > s->temp.size + tmp)
-			return false;
-
-		s->lzma2.compressed -= s->rc.in_pos;
-
-		if (s->rc.in_pos < s->temp.size)
-		{
-			s->temp.size -= s->rc.in_pos;
-			memmove(s->temp.buf, s->temp.buf + s->rc.in_pos, s->temp.size);
-			return true;
-		}
-
-		b->in_pos += s->rc.in_pos - s->temp.size;
-		s->temp.size = 0;
-	}
-
-	in_avail = b->in_size - b->in_pos;
-	if (in_avail >= LZMA_IN_REQUIRED)
-	{
-		s->rc.in = b->in;
-		s->rc.in_pos = b->in_pos;
-
-		if (in_avail >= s->lzma2.compressed + LZMA_IN_REQUIRED)
-			s->rc.in_limit = b->in_pos + s->lzma2.compressed;
-		else
-			s->rc.in_limit = b->in_size - LZMA_IN_REQUIRED;
-
-		if (!lzma_main(s))
-			return false;
-
-		in_avail = s->rc.in_pos - b->in_pos;
-		if (in_avail > s->lzma2.compressed)
-			return false;
-
-		s->lzma2.compressed -= in_avail;
-		b->in_pos = s->rc.in_pos;
-	}
-
-	in_avail = b->in_size - b->in_pos;
-	if (in_avail < LZMA_IN_REQUIRED)
-	{
-		if (in_avail > s->lzma2.compressed)
-			in_avail = s->lzma2.compressed;
-
-		memcpy(s->temp.buf, b->in + b->in_pos, in_avail);
-		s->temp.size = in_avail;
-		b->in_pos += in_avail;
-	}
-
-	return true;
-}
-
-/*
- * Take care of the LZMA2 control layer, and forward the job of actual LZMA
- * decoding or copying of uncompressed chunks to other functions.
- */
-XZ_EXTERN enum xz_ret xz_dec_lzma2_run(struct xz_dec_lzma2 *s, struct xz_buf *b)
-{
-	uint32_t tmp;
-
-	while (b->in_pos < b->in_size || s->lzma2.sequence == SEQ_LZMA_RUN)
-	{
-		switch (s->lzma2.sequence)
-		{
-		case SEQ_CONTROL:
-			/*
-			 * LZMA2 control byte
-			 *
-			 * Exact values:
-			 *   0x00   End marker
-			 *   0x01   Dictionary reset followed by
-			 *          an uncompressed chunk
-			 *   0x02   Uncompressed chunk (no dictionary reset)
-			 *
-			 * Highest three bits (s->control & 0xE0):
-			 *   0xE0   Dictionary reset, new properties and state
-			 *          reset, followed by LZMA compressed chunk
-			 *   0xC0   New properties and state reset, followed
-			 *          by LZMA compressed chunk (no dictionary
-			 *          reset)
-			 *   0xA0   State reset using old properties,
-			 *          followed by LZMA compressed chunk (no
-			 *          dictionary reset)
-			 *   0x80   LZMA chunk (no dictionary or state reset)
-			 *
-			 * For LZMA compressed chunks, the lowest five bits
-			 * (s->control & 1F) are the highest bits of the
-			 * uncompressed size (bits 16-20).
-			 *
-			 * A new LZMA2 stream must begin with a dictionary
-			 * reset. The first LZMA chunk must set new
-			 * properties and reset the LZMA state.
-			 *
-			 * Values that don't match anything described above
-			 * are invalid and we return XZ_DATA_ERROR.
-			 */
-			tmp = b->in[b->in_pos++];
-
-			if (tmp == 0x00)
-				return XZ_STREAM_END;
-
-			if (tmp >= 0xE0 || tmp == 0x01)
-			{
-				s->lzma2.need_props = true;
-				s->lzma2.need_dict_reset = false;
-				dict_reset(&s->dict, b);
-			}
-			else if (s->lzma2.need_dict_reset)
-			{
-				return XZ_DATA_ERROR;
-			}
-
-			if (tmp >= 0x80)
-			{
-				s->lzma2.uncompressed = (tmp & 0x1F) << 16;
-				s->lzma2.sequence = SEQ_UNCOMPRESSED_1;
-
-				if (tmp >= 0xC0)
-				{
-					/*
-					 * When there are new properties,
-					 * state reset is done at
-					 * SEQ_PROPERTIES.
-					 */
-					s->lzma2.need_props = false;
-					s->lzma2.next_sequence = SEQ_PROPERTIES;
-				}
-				else if (s->lzma2.need_props)
-				{
-					return XZ_DATA_ERROR;
-				}
-				else
-				{
-					s->lzma2.next_sequence = SEQ_LZMA_PREPARE;
-					if (tmp >= 0xA0)
-						lzma_reset(s);
-				}
-			}
-			else
-			{
-				if (tmp > 0x02)
-					return XZ_DATA_ERROR;
-
-				s->lzma2.sequence = SEQ_COMPRESSED_0;
-				s->lzma2.next_sequence = SEQ_COPY;
-			}
-
-			break;
-
-		case SEQ_UNCOMPRESSED_1:
-			s->lzma2.uncompressed += (uint32_t)b->in[b->in_pos++] << 8;
-			s->lzma2.sequence = SEQ_UNCOMPRESSED_2;
-			break;
-
-		case SEQ_UNCOMPRESSED_2:
-			s->lzma2.uncompressed += (uint32_t)b->in[b->in_pos++] + 1;
-			s->lzma2.sequence = SEQ_COMPRESSED_0;
-			break;
-
-		case SEQ_COMPRESSED_0:
-			s->lzma2.compressed = (uint32_t)b->in[b->in_pos++] << 8;
-			s->lzma2.sequence = SEQ_COMPRESSED_1;
-			break;
-
-		case SEQ_COMPRESSED_1:
-			s->lzma2.compressed += (uint32_t)b->in[b->in_pos++] + 1;
-			s->lzma2.sequence = s->lzma2.next_sequence;
-			break;
-
-		case SEQ_PROPERTIES:
-			if (!lzma_props(s, b->in[b->in_pos++]))
-				return XZ_DATA_ERROR;
-
-			s->lzma2.sequence = SEQ_LZMA_PREPARE;
-
-		case SEQ_LZMA_PREPARE:
-			if (s->lzma2.compressed < RC_INIT_BYTES)
-				return XZ_DATA_ERROR;
-
-			if (!rc_read_init(&s->rc, b))
-				return XZ_OK;
-
-			s->lzma2.compressed -= RC_INIT_BYTES;
-			s->lzma2.sequence = SEQ_LZMA_RUN;
-
-		case SEQ_LZMA_RUN:
-			/*
-			 * Set dictionary limit to indicate how much we want
-			 * to be encoded at maximum. Decode new data into the
-			 * dictionary. Flush the new data from dictionary to
-			 * b->out. Check if we finished decoding this chunk.
-			 * In case the dictionary got full but we didn't fill
-			 * the output buffer yet, we may run this loop
-			 * multiple times without changing s->lzma2.sequence.
-			 */
-			dict_limit(&s->dict,
-					   min_t(size_t, b->out_size - b->out_pos, s->lzma2.uncompressed));
-			if (!lzma2_lzma(s, b))
-				return XZ_DATA_ERROR;
-
-			s->lzma2.uncompressed -= dict_flush(&s->dict, b);
-
-			if (s->lzma2.uncompressed == 0)
-			{
-				if (s->lzma2.compressed > 0 || s->lzma.len > 0 || !rc_is_finished(&s->rc))
-					return XZ_DATA_ERROR;
-
-				rc_reset(&s->rc);
-				s->lzma2.sequence = SEQ_CONTROL;
-			}
-			else if (b->out_pos == b->out_size ||
-					 (b->in_pos == b->in_size && s->temp.size < s->lzma2.compressed))
-			{
-				return XZ_OK;
-			}
-
-			break;
-
-		case SEQ_COPY:
-			dict_uncompressed(&s->dict, b, &s->lzma2.compressed);
-			if (s->lzma2.compressed > 0)
-				return XZ_OK;
-
-			s->lzma2.sequence = SEQ_CONTROL;
-			break;
-		}
-	}
-
-	return XZ_OK;
-}
-
-XZ_EXTERN struct xz_dec_lzma2 *xz_dec_lzma2_create(enum xz_mode mode, uint32_t dict_max)
-{
-	struct xz_dec_lzma2 *s = kmalloc(sizeof(*s), GFP_KERNEL);
-	if (s == NULL)
-		return NULL;
-
-	s->dict.mode = mode;
-	s->dict.size_max = dict_max;
-
-	if (DEC_IS_PREALLOC(mode))
-	{
-		s->dict.buf = vmalloc(dict_max);
-		if (s->dict.buf == NULL)
-		{
-			kfree(s);
-			return NULL;
-		}
-	}
-	else if (DEC_IS_DYNALLOC(mode))
-	{
-		s->dict.buf = NULL;
-		s->dict.allocated = 0;
-	}
-
-	return s;
-}
-
-XZ_EXTERN enum xz_ret xz_dec_lzma2_reset(struct xz_dec_lzma2 *s, uint8_t props)
-{
-	/* This limits dictionary size to 3 GiB to keep parsing simpler. */
-	if (props > 39)
-		return XZ_OPTIONS_ERROR;
-
-	s->dict.size = 2 + (props & 1);
-	s->dict.size <<= (props >> 1) + 11;
-
-	if (DEC_IS_MULTI(s->dict.mode))
-	{
-		if (s->dict.size > s->dict.size_max)
-			return XZ_MEMLIMIT_ERROR;
-
-		s->dict.end = s->dict.size;
-
-		if (DEC_IS_DYNALLOC(s->dict.mode))
-		{
-			if (s->dict.allocated < s->dict.size)
-			{
-				vfree(s->dict.buf);
-				s->dict.buf = vmalloc(s->dict.size);
-				if (s->dict.buf == NULL)
-				{
-					s->dict.allocated = 0;
-					return XZ_MEM_ERROR;
-				}
-			}
-		}
-	}
-
-	s->lzma.len = 0;
-
-	s->lzma2.sequence = SEQ_CONTROL;
-	s->lzma2.need_dict_reset = true;
-
-	s->temp.size = 0;
-
-	return XZ_OK;
-}
-
-XZ_EXTERN void xz_dec_lzma2_end(struct xz_dec_lzma2 *s)
-{
-	if (DEC_IS_MULTI(s->dict.mode))
-		vfree(s->dict.buf);
-
-	kfree(s);
-}
diff --git a/depends/xz-embedded/src/xz_dec_stream.c b/depends/xz-embedded/src/xz_dec_stream.c
deleted file mode 100644
index 6e935ded..00000000
--- a/depends/xz-embedded/src/xz_dec_stream.c
+++ /dev/null
@@ -1,860 +0,0 @@
-/*
- * .xz Stream decoder
- *
- * Author: Lasse Collin <lasse.collin@tukaani.org>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-#include "xz_private.h"
-#include "xz_stream.h"
-
-#ifdef XZ_USE_CRC64
-#define IS_CRC64(check_type) ((check_type) == XZ_CHECK_CRC64)
-#else
-#define IS_CRC64(check_type) false
-#endif
-
-/* Hash used to validate the Index field */
-struct xz_dec_hash
-{
-	vli_type unpadded;
-	vli_type uncompressed;
-	uint32_t crc32;
-};
-
-struct xz_dec
-{
-	/* Position in dec_main() */
-	enum
-	{
-		SEQ_STREAM_HEADER,
-		SEQ_BLOCK_START,
-		SEQ_BLOCK_HEADER,
-		SEQ_BLOCK_UNCOMPRESS,
-		SEQ_BLOCK_PADDING,
-		SEQ_BLOCK_CHECK,
-		SEQ_INDEX,
-		SEQ_INDEX_PADDING,
-		SEQ_INDEX_CRC32,
-		SEQ_STREAM_FOOTER
-	} sequence;
-
-	/* Position in variable-length integers and Check fields */
-	uint32_t pos;
-
-	/* Variable-length integer decoded by dec_vli() */
-	vli_type vli;
-
-	/* Saved in_pos and out_pos */
-	size_t in_start;
-	size_t out_start;
-
-#ifdef XZ_USE_CRC64
-	/* CRC32 or CRC64 value in Block or CRC32 value in Index */
-	uint64_t crc;
-#else
-	/* CRC32 value in Block or Index */
-	uint32_t crc;
-#endif
-
-	/* Type of the integrity check calculated from uncompressed data */
-	enum xz_check check_type;
-
-	/* Operation mode */
-	enum xz_mode mode;
-
-	/*
-	 * True if the next call to xz_dec_run() is allowed to return
-	 * XZ_BUF_ERROR.
-	 */
-	bool allow_buf_error;
-
-	/* Information stored in Block Header */
-	struct
-	{
-		/*
-		 * Value stored in the Compressed Size field, or
-		 * VLI_UNKNOWN if Compressed Size is not present.
-		 */
-		vli_type compressed;
-
-		/*
-		 * Value stored in the Uncompressed Size field, or
-		 * VLI_UNKNOWN if Uncompressed Size is not present.
-		 */
-		vli_type uncompressed;
-
-		/* Size of the Block Header field */
-		uint32_t size;
-	} block_header;
-
-	/* Information collected when decoding Blocks */
-	struct
-	{
-		/* Observed compressed size of the current Block */
-		vli_type compressed;
-
-		/* Observed uncompressed size of the current Block */
-		vli_type uncompressed;
-
-		/* Number of Blocks decoded so far */
-		vli_type count;
-
-		/*
-		 * Hash calculated from the Block sizes. This is used to
-		 * validate the Index field.
-		 */
-		struct xz_dec_hash hash;
-	} block;
-
-	/* Variables needed when verifying the Index field */
-	struct
-	{
-		/* Position in dec_index() */
-		enum
-		{
-			SEQ_INDEX_COUNT,
-			SEQ_INDEX_UNPADDED,
-			SEQ_INDEX_UNCOMPRESSED
-		} sequence;
-
-		/* Size of the Index in bytes */
-		vli_type size;
-
-		/* Number of Records (matches block.count in valid files) */
-		vli_type count;
-
-		/*
-		 * Hash calculated from the Records (matches block.hash in
-		 * valid files).
-		 */
-		struct xz_dec_hash hash;
-	} index;
-
-	/*
-	 * Temporary buffer needed to hold Stream Header, Block Header,
-	 * and Stream Footer. The Block Header is the biggest (1 KiB)
-	 * so we reserve space according to that. buf[] has to be aligned
-	 * to a multiple of four bytes; the size_t variables before it
-	 * should guarantee this.
-	 */
-	struct
-	{
-		size_t pos;
-		size_t size;
-		uint8_t buf[1024];
-	} temp;
-
-	struct xz_dec_lzma2 *lzma2;
-
-#ifdef XZ_DEC_BCJ
-	struct xz_dec_bcj *bcj;
-	bool bcj_active;
-#endif
-};
-
-#ifdef XZ_DEC_ANY_CHECK
-/* Sizes of the Check field with different Check IDs */
-static const uint8_t check_sizes[16] = {0,  4,  4,  4,  8,  8,  8,  16,
-										16, 16, 32, 32, 32, 64, 64, 64};
-#endif
-
-/*
- * Fill s->temp by copying data starting from b->in[b->in_pos]. Caller
- * must have set s->temp.pos to indicate how much data we are supposed
- * to copy into s->temp.buf. Return true once s->temp.pos has reached
- * s->temp.size.
- */
-static bool fill_temp(struct xz_dec *s, struct xz_buf *b)
-{
-	size_t copy_size = min_t(size_t, b->in_size - b->in_pos, s->temp.size - s->temp.pos);
-
-	memcpy(s->temp.buf + s->temp.pos, b->in + b->in_pos, copy_size);
-	b->in_pos += copy_size;
-	s->temp.pos += copy_size;
-
-	if (s->temp.pos == s->temp.size)
-	{
-		s->temp.pos = 0;
-		return true;
-	}
-
-	return false;
-}
-
-/* Decode a variable-length integer (little-endian base-128 encoding) */
-static enum xz_ret dec_vli(struct xz_dec *s, const uint8_t *in, size_t *in_pos, size_t in_size)
-{
-	uint8_t byte;
-
-	if (s->pos == 0)
-		s->vli = 0;
-
-	while (*in_pos < in_size)
-	{
-		byte = in[*in_pos];
-		++*in_pos;
-
-		s->vli |= (vli_type)(byte & 0x7F) << s->pos;
-
-		if ((byte & 0x80) == 0)
-		{
-			/* Don't allow non-minimal encodings. */
-			if (byte == 0 && s->pos != 0)
-				return XZ_DATA_ERROR;
-
-			s->pos = 0;
-			return XZ_STREAM_END;
-		}
-
-		s->pos += 7;
-		if (s->pos == 7 * VLI_BYTES_MAX)
-			return XZ_DATA_ERROR;
-	}
-
-	return XZ_OK;
-}
-
-/*
- * Decode the Compressed Data field from a Block. Update and validate
- * the observed compressed and uncompressed sizes of the Block so that
- * they don't exceed the values possibly stored in the Block Header
- * (validation assumes that no integer overflow occurs, since vli_type
- * is normally uint64_t). Update the CRC32 or CRC64 value if presence of
- * the CRC32 or CRC64 field was indicated in Stream Header.
- *
- * Once the decoding is finished, validate that the observed sizes match
- * the sizes possibly stored in the Block Header. Update the hash and
- * Block count, which are later used to validate the Index field.
- */
-static enum xz_ret dec_block(struct xz_dec *s, struct xz_buf *b)
-{
-	enum xz_ret ret;
-
-	s->in_start = b->in_pos;
-	s->out_start = b->out_pos;
-
-#ifdef XZ_DEC_BCJ
-	if (s->bcj_active)
-		ret = xz_dec_bcj_run(s->bcj, s->lzma2, b);
-	else
-#endif
-		ret = xz_dec_lzma2_run(s->lzma2, b);
-
-	s->block.compressed += b->in_pos - s->in_start;
-	s->block.uncompressed += b->out_pos - s->out_start;
-
-	/*
-	 * There is no need to separately check for VLI_UNKNOWN, since
-	 * the observed sizes are always smaller than VLI_UNKNOWN.
-	 */
-	if (s->block.compressed > s->block_header.compressed ||
-		s->block.uncompressed > s->block_header.uncompressed)
-		return XZ_DATA_ERROR;
-
-	if (s->check_type == XZ_CHECK_CRC32)
-		s->crc = xz_crc32(b->out + s->out_start, b->out_pos - s->out_start, s->crc);
-#ifdef XZ_USE_CRC64
-	else if (s->check_type == XZ_CHECK_CRC64)
-		s->crc = xz_crc64(b->out + s->out_start, b->out_pos - s->out_start, s->crc);
-#endif
-
-	if (ret == XZ_STREAM_END)
-	{
-		if (s->block_header.compressed != VLI_UNKNOWN &&
-			s->block_header.compressed != s->block.compressed)
-			return XZ_DATA_ERROR;
-
-		if (s->block_header.uncompressed != VLI_UNKNOWN &&
-			s->block_header.uncompressed != s->block.uncompressed)
-			return XZ_DATA_ERROR;
-
-		s->block.hash.unpadded += s->block_header.size + s->block.compressed;
-
-#ifdef XZ_DEC_ANY_CHECK
-		s->block.hash.unpadded += check_sizes[s->check_type];
-#else
-		if (s->check_type == XZ_CHECK_CRC32)
-			s->block.hash.unpadded += 4;
-		else if (IS_CRC64(s->check_type))
-			s->block.hash.unpadded += 8;
-#endif
-
-		s->block.hash.uncompressed += s->block.uncompressed;
-		s->block.hash.crc32 = xz_crc32((const uint8_t *)&s->block.hash, sizeof(s->block.hash),
-									   s->block.hash.crc32);
-
-		++s->block.count;
-	}
-
-	return ret;
-}
-
-/* Update the Index size and the CRC32 value. */
-static void index_update(struct xz_dec *s, const struct xz_buf *b)
-{
-	size_t in_used = b->in_pos - s->in_start;
-	s->index.size += in_used;
-	s->crc = xz_crc32(b->in + s->in_start, in_used, s->crc);
-}
-
-/*
- * Decode the Number of Records, Unpadded Size, and Uncompressed Size
- * fields from the Index field. That is, Index Padding and CRC32 are not
- * decoded by this function.
- *
- * This can return XZ_OK (more input needed), XZ_STREAM_END (everything
- * successfully decoded), or XZ_DATA_ERROR (input is corrupt).
- */
-static enum xz_ret dec_index(struct xz_dec *s, struct xz_buf *b)
-{
-	enum xz_ret ret;
-
-	do
-	{
-		ret = dec_vli(s, b->in, &b->in_pos, b->in_size);
-		if (ret != XZ_STREAM_END)
-		{
-			index_update(s, b);
-			return ret;
-		}
-
-		switch (s->index.sequence)
-		{
-		case SEQ_INDEX_COUNT:
-			s->index.count = s->vli;
-
-			/*
-			 * Validate that the Number of Records field
-			 * indicates the same number of Records as
-			 * there were Blocks in the Stream.
-			 */
-			if (s->index.count != s->block.count)
-				return XZ_DATA_ERROR;
-
-			s->index.sequence = SEQ_INDEX_UNPADDED;
-			break;
-
-		case SEQ_INDEX_UNPADDED:
-			s->index.hash.unpadded += s->vli;
-			s->index.sequence = SEQ_INDEX_UNCOMPRESSED;
-			break;
-
-		case SEQ_INDEX_UNCOMPRESSED:
-			s->index.hash.uncompressed += s->vli;
-			s->index.hash.crc32 = xz_crc32((const uint8_t *)&s->index.hash,
-										   sizeof(s->index.hash), s->index.hash.crc32);
-			--s->index.count;
-			s->index.sequence = SEQ_INDEX_UNPADDED;
-			break;
-		}
-	} while (s->index.count > 0);
-
-	return XZ_STREAM_END;
-}
-
-/*
- * Validate that the next four or eight input bytes match the value
- * of s->crc. s->pos must be zero when starting to validate the first byte.
- * The "bits" argument allows using the same code for both CRC32 and CRC64.
- */
-static enum xz_ret crc_validate(struct xz_dec *s, struct xz_buf *b, uint32_t bits)
-{
-	do
-	{
-		if (b->in_pos == b->in_size)
-			return XZ_OK;
-
-		if (((s->crc >> s->pos) & 0xFF) != b->in[b->in_pos++])
-			return XZ_DATA_ERROR;
-
-		s->pos += 8;
-
-	} while (s->pos < bits);
-
-	s->crc = 0;
-	s->pos = 0;
-
-	return XZ_STREAM_END;
-}
-
-#ifdef XZ_DEC_ANY_CHECK
-/*
- * Skip over the Check field when the Check ID is not supported.
- * Returns true once the whole Check field has been skipped over.
- */
-static bool check_skip(struct xz_dec *s, struct xz_buf *b)
-{
-	while (s->pos < check_sizes[s->check_type])
-	{
-		if (b->in_pos == b->in_size)
-			return false;
-
-		++b->in_pos;
-		++s->pos;
-	}
-
-	s->pos = 0;
-
-	return true;
-}
-#endif
-
-/* Decode the Stream Header field (the first 12 bytes of the .xz Stream). */
-static enum xz_ret dec_stream_header(struct xz_dec *s)
-{
-	if (!memeq(s->temp.buf, HEADER_MAGIC, HEADER_MAGIC_SIZE))
-		return XZ_FORMAT_ERROR;
-
-	if (xz_crc32(s->temp.buf + HEADER_MAGIC_SIZE, 2, 0) !=
-		get_le32(s->temp.buf + HEADER_MAGIC_SIZE + 2))
-		return XZ_DATA_ERROR;
-
-	if (s->temp.buf[HEADER_MAGIC_SIZE] != 0)
-		return XZ_OPTIONS_ERROR;
-
-	/*
-	 * Of integrity checks, we support none (Check ID = 0),
-	 * CRC32 (Check ID = 1), and optionally CRC64 (Check ID = 4).
-	 * However, if XZ_DEC_ANY_CHECK is defined, we will accept other
-	 * check types too, but then the check won't be verified and
-	 * a warning (XZ_UNSUPPORTED_CHECK) will be given.
-	 */
-	s->check_type = s->temp.buf[HEADER_MAGIC_SIZE + 1];
-
-#ifdef XZ_DEC_ANY_CHECK
-	if (s->check_type > XZ_CHECK_MAX)
-		return XZ_OPTIONS_ERROR;
-
-	if (s->check_type > XZ_CHECK_CRC32 && !IS_CRC64(s->check_type))
-		return XZ_UNSUPPORTED_CHECK;
-#else
-	if (s->check_type > XZ_CHECK_CRC32 && !IS_CRC64(s->check_type))
-		return XZ_OPTIONS_ERROR;
-#endif
-
-	return XZ_OK;
-}
-
-/* Decode the Stream Footer field (the last 12 bytes of the .xz Stream) */
-static enum xz_ret dec_stream_footer(struct xz_dec *s)
-{
-	if (!memeq(s->temp.buf + 10, FOOTER_MAGIC, FOOTER_MAGIC_SIZE))
-		return XZ_DATA_ERROR;
-
-	if (xz_crc32(s->temp.buf + 4, 6, 0) != get_le32(s->temp.buf))
-		return XZ_DATA_ERROR;
-
-	/*
-	 * Validate Backward Size. Note that we never added the size of the
-	 * Index CRC32 field to s->index.size, thus we use s->index.size / 4
-	 * instead of s->index.size / 4 - 1.
-	 */
-	if ((s->index.size >> 2) != get_le32(s->temp.buf + 4))
-		return XZ_DATA_ERROR;
-
-	if (s->temp.buf[8] != 0 || s->temp.buf[9] != s->check_type)
-		return XZ_DATA_ERROR;
-
-	/*
-	 * Use XZ_STREAM_END instead of XZ_OK to be more convenient
-	 * for the caller.
-	 */
-	return XZ_STREAM_END;
-}
-
-/* Decode the Block Header and initialize the filter chain. */
-static enum xz_ret dec_block_header(struct xz_dec *s)
-{
-	enum xz_ret ret;
-
-	/*
-	 * Validate the CRC32. We know that the temp buffer is at least
-	 * eight bytes so this is safe.
-	 */
-	s->temp.size -= 4;
-	if (xz_crc32(s->temp.buf, s->temp.size, 0) != get_le32(s->temp.buf + s->temp.size))
-		return XZ_DATA_ERROR;
-
-	s->temp.pos = 2;
-
-/*
- * Catch unsupported Block Flags. We support only one or two filters
- * in the chain, so we catch that with the same test.
- */
-#ifdef XZ_DEC_BCJ
-	if (s->temp.buf[1] & 0x3E)
-#else
-		if (s->temp.buf[1] & 0x3F)
-#endif
-			return XZ_OPTIONS_ERROR;
-
-	/* Compressed Size */
-	if (s->temp.buf[1] & 0x40)
-	{
-		if (dec_vli(s, s->temp.buf, &s->temp.pos, s->temp.size) != XZ_STREAM_END)
-			return XZ_DATA_ERROR;
-
-		s->block_header.compressed = s->vli;
-	}
-	else
-	{
-		s->block_header.compressed = VLI_UNKNOWN;
-	}
-
-	/* Uncompressed Size */
-	if (s->temp.buf[1] & 0x80)
-	{
-		if (dec_vli(s, s->temp.buf, &s->temp.pos, s->temp.size) != XZ_STREAM_END)
-			return XZ_DATA_ERROR;
-
-		s->block_header.uncompressed = s->vli;
-	}
-	else
-	{
-		s->block_header.uncompressed = VLI_UNKNOWN;
-	}
-
-#ifdef XZ_DEC_BCJ
-	/* If there are two filters, the first one must be a BCJ filter. */
-	s->bcj_active = s->temp.buf[1] & 0x01;
-	if (s->bcj_active)
-	{
-		if (s->temp.size - s->temp.pos < 2)
-			return XZ_OPTIONS_ERROR;
-
-		ret = xz_dec_bcj_reset(s->bcj, s->temp.buf[s->temp.pos++]);
-		if (ret != XZ_OK)
-			return ret;
-
-		/*
-		 * We don't support custom start offset,
-		 * so Size of Properties must be zero.
-		 */
-		if (s->temp.buf[s->temp.pos++] != 0x00)
-			return XZ_OPTIONS_ERROR;
-	}
-#endif
-
-	/* Valid Filter Flags always take at least two bytes. */
-	if (s->temp.size - s->temp.pos < 2)
-		return XZ_DATA_ERROR;
-
-	/* Filter ID = LZMA2 */
-	if (s->temp.buf[s->temp.pos++] != 0x21)
-		return XZ_OPTIONS_ERROR;
-
-	/* Size of Properties = 1-byte Filter Properties */
-	if (s->temp.buf[s->temp.pos++] != 0x01)
-		return XZ_OPTIONS_ERROR;
-
-	/* Filter Properties contains LZMA2 dictionary size. */
-	if (s->temp.size - s->temp.pos < 1)
-		return XZ_DATA_ERROR;
-
-	ret = xz_dec_lzma2_reset(s->lzma2, s->temp.buf[s->temp.pos++]);
-	if (ret != XZ_OK)
-		return ret;
-
-	/* The rest must be Header Padding. */
-	while (s->temp.pos < s->temp.size)
-		if (s->temp.buf[s->temp.pos++] != 0x00)
-			return XZ_OPTIONS_ERROR;
-
-	s->temp.pos = 0;
-	s->block.compressed = 0;
-	s->block.uncompressed = 0;
-
-	return XZ_OK;
-}
-
-static enum xz_ret dec_main(struct xz_dec *s, struct xz_buf *b)
-{
-	enum xz_ret ret;
-
-	/*
-	 * Store the start position for the case when we are in the middle
-	 * of the Index field.
-	 */
-	s->in_start = b->in_pos;
-
-	while (true)
-	{
-		switch (s->sequence)
-		{
-		case SEQ_STREAM_HEADER:
-			/*
-			 * Stream Header is copied to s->temp, and then
-			 * decoded from there. This way if the caller
-			 * gives us only little input at a time, we can
-			 * still keep the Stream Header decoding code
-			 * simple. Similar approach is used in many places
-			 * in this file.
-			 */
-			if (!fill_temp(s, b))
-				return XZ_OK;
-
-			/*
-			 * If dec_stream_header() returns
-			 * XZ_UNSUPPORTED_CHECK, it is still possible
-			 * to continue decoding if working in multi-call
-			 * mode. Thus, update s->sequence before calling
-			 * dec_stream_header().
-			 */
-			s->sequence = SEQ_BLOCK_START;
-
-			ret = dec_stream_header(s);
-			if (ret != XZ_OK)
-				return ret;
-
-		case SEQ_BLOCK_START:
-			/* We need one byte of input to continue. */
-			if (b->in_pos == b->in_size)
-				return XZ_OK;
-
-			/* See if this is the beginning of the Index field. */
-			if (b->in[b->in_pos] == 0)
-			{
-				s->in_start = b->in_pos++;
-				s->sequence = SEQ_INDEX;
-				break;
-			}
-
-			/*
-			 * Calculate the size of the Block Header and
-			 * prepare to decode it.
-			 */
-			s->block_header.size = ((uint32_t)b->in[b->in_pos] + 1) * 4;
-
-			s->temp.size = s->block_header.size;
-			s->temp.pos = 0;
-			s->sequence = SEQ_BLOCK_HEADER;
-
-		case SEQ_BLOCK_HEADER:
-			if (!fill_temp(s, b))
-				return XZ_OK;
-
-			ret = dec_block_header(s);
-			if (ret != XZ_OK)
-				return ret;
-
-			s->sequence = SEQ_BLOCK_UNCOMPRESS;
-
-		case SEQ_BLOCK_UNCOMPRESS:
-			ret = dec_block(s, b);
-			if (ret != XZ_STREAM_END)
-				return ret;
-
-			s->sequence = SEQ_BLOCK_PADDING;
-
-		case SEQ_BLOCK_PADDING:
-			/*
-			 * Size of Compressed Data + Block Padding
-			 * must be a multiple of four. We don't need
-			 * s->block.compressed for anything else
-			 * anymore, so we use it here to test the size
-			 * of the Block Padding field.
-			 */
-			while (s->block.compressed & 3)
-			{
-				if (b->in_pos == b->in_size)
-					return XZ_OK;
-
-				if (b->in[b->in_pos++] != 0)
-					return XZ_DATA_ERROR;
-
-				++s->block.compressed;
-			}
-
-			s->sequence = SEQ_BLOCK_CHECK;
-
-		case SEQ_BLOCK_CHECK:
-			if (s->check_type == XZ_CHECK_CRC32)
-			{
-				ret = crc_validate(s, b, 32);
-				if (ret != XZ_STREAM_END)
-					return ret;
-			}
-			else if (IS_CRC64(s->check_type))
-			{
-				ret = crc_validate(s, b, 64);
-				if (ret != XZ_STREAM_END)
-					return ret;
-			}
-#ifdef XZ_DEC_ANY_CHECK
-			else if (!check_skip(s, b))
-			{
-				return XZ_OK;
-			}
-#endif
-
-			s->sequence = SEQ_BLOCK_START;
-			break;
-
-		case SEQ_INDEX:
-			ret = dec_index(s, b);
-			if (ret != XZ_STREAM_END)
-				return ret;
-
-			s->sequence = SEQ_INDEX_PADDING;
-
-		case SEQ_INDEX_PADDING:
-			while ((s->index.size + (b->in_pos - s->in_start)) & 3)
-			{
-				if (b->in_pos == b->in_size)
-				{
-					index_update(s, b);
-					return XZ_OK;
-				}
-
-				if (b->in[b->in_pos++] != 0)
-					return XZ_DATA_ERROR;
-			}
-
-			/* Finish the CRC32 value and Index size. */
-			index_update(s, b);
-
-			/* Compare the hashes to validate the Index field. */
-			if (!memeq(&s->block.hash, &s->index.hash, sizeof(s->block.hash)))
-				return XZ_DATA_ERROR;
-
-			s->sequence = SEQ_INDEX_CRC32;
-
-		case SEQ_INDEX_CRC32:
-			ret = crc_validate(s, b, 32);
-			if (ret != XZ_STREAM_END)
-				return ret;
-
-			s->temp.size = STREAM_HEADER_SIZE;
-			s->sequence = SEQ_STREAM_FOOTER;
-
-		case SEQ_STREAM_FOOTER:
-			if (!fill_temp(s, b))
-				return XZ_OK;
-
-			return dec_stream_footer(s);
-		}
-	}
-
-	/* Never reached */
-}
-
-/*
- * xz_dec_run() is a wrapper for dec_main() to handle some special cases in
- * multi-call and single-call decoding.
- *
- * In multi-call mode, we must return XZ_BUF_ERROR when it seems clear that we
- * are not going to make any progress anymore. This is to prevent the caller
- * from calling us infinitely when the input file is truncated or otherwise
- * corrupt. Since zlib-style API allows that the caller fills the input buffer
- * only when the decoder doesn't produce any new output, we have to be careful
- * to avoid returning XZ_BUF_ERROR too easily: XZ_BUF_ERROR is returned only
- * after the second consecutive call to xz_dec_run() that makes no progress.
- *
- * In single-call mode, if we couldn't decode everything and no error
- * occurred, either the input is truncated or the output buffer is too small.
- * Since we know that the last input byte never produces any output, we know
- * that if all the input was consumed and decoding wasn't finished, the file
- * must be corrupt. Otherwise the output buffer has to be too small or the
- * file is corrupt in a way that decoding it produces too big output.
- *
- * If single-call decoding fails, we reset b->in_pos and b->out_pos back to
- * their original values. This is because with some filter chains there won't
- * be any valid uncompressed data in the output buffer unless the decoding
- * actually succeeds (that's the price to pay of using the output buffer as
- * the workspace).
- */
-XZ_EXTERN enum xz_ret xz_dec_run(struct xz_dec *s, struct xz_buf *b)
-{
-	size_t in_start;
-	size_t out_start;
-	enum xz_ret ret;
-
-	if (DEC_IS_SINGLE(s->mode))
-		xz_dec_reset(s);
-
-	in_start = b->in_pos;
-	out_start = b->out_pos;
-	ret = dec_main(s, b);
-
-	if (DEC_IS_SINGLE(s->mode))
-	{
-		if (ret == XZ_OK)
-			ret = b->in_pos == b->in_size ? XZ_DATA_ERROR : XZ_BUF_ERROR;
-
-		if (ret != XZ_STREAM_END)
-		{
-			b->in_pos = in_start;
-			b->out_pos = out_start;
-		}
-	}
-	else if (ret == XZ_OK && in_start == b->in_pos && out_start == b->out_pos)
-	{
-		if (s->allow_buf_error)
-			ret = XZ_BUF_ERROR;
-
-		s->allow_buf_error = true;
-	}
-	else
-	{
-		s->allow_buf_error = false;
-	}
-
-	return ret;
-}
-
-XZ_EXTERN struct xz_dec *xz_dec_init(enum xz_mode mode, uint32_t dict_max)
-{
-	struct xz_dec *s = kmalloc(sizeof(*s), GFP_KERNEL);
-	if (s == NULL)
-		return NULL;
-
-	s->mode = mode;
-
-#ifdef XZ_DEC_BCJ
-	s->bcj = xz_dec_bcj_create(DEC_IS_SINGLE(mode));
-	if (s->bcj == NULL)
-		goto error_bcj;
-#endif
-
-	s->lzma2 = xz_dec_lzma2_create(mode, dict_max);
-	if (s->lzma2 == NULL)
-		goto error_lzma2;
-
-	xz_dec_reset(s);
-	return s;
-
-error_lzma2:
-#ifdef XZ_DEC_BCJ
-	xz_dec_bcj_end(s->bcj);
-error_bcj:
-#endif
-	kfree(s);
-	return NULL;
-}
-
-XZ_EXTERN void xz_dec_reset(struct xz_dec *s)
-{
-	s->sequence = SEQ_STREAM_HEADER;
-	s->allow_buf_error = false;
-	s->pos = 0;
-	s->crc = 0;
-	memzero(&s->block, sizeof(s->block));
-	memzero(&s->index, sizeof(s->index));
-	s->temp.pos = 0;
-	s->temp.size = STREAM_HEADER_SIZE;
-}
-
-XZ_EXTERN void xz_dec_end(struct xz_dec *s)
-{
-	if (s != NULL)
-	{
-		xz_dec_lzma2_end(s->lzma2);
-#ifdef XZ_DEC_BCJ
-		xz_dec_bcj_end(s->bcj);
-#endif
-		kfree(s);
-	}
-}
diff --git a/depends/xz-embedded/src/xz_lzma2.h b/depends/xz-embedded/src/xz_lzma2.h
deleted file mode 100644
index 3976033a..00000000
--- a/depends/xz-embedded/src/xz_lzma2.h
+++ /dev/null
@@ -1,204 +0,0 @@
-/*
- * LZMA2 definitions
- *
- * Authors: Lasse Collin <lasse.collin@tukaani.org>
- *          Igor Pavlov <http://7-zip.org/>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-#ifndef XZ_LZMA2_H
-#define XZ_LZMA2_H
-
-/* Range coder constants */
-#define RC_SHIFT_BITS 8
-#define RC_TOP_BITS 24
-#define RC_TOP_VALUE (1 << RC_TOP_BITS)
-#define RC_BIT_MODEL_TOTAL_BITS 11
-#define RC_BIT_MODEL_TOTAL (1 << RC_BIT_MODEL_TOTAL_BITS)
-#define RC_MOVE_BITS 5
-
-/*
- * Maximum number of position states. A position state is the lowest pb
- * number of bits of the current uncompressed offset. In some places there
- * are different sets of probabilities for different position states.
- */
-#define POS_STATES_MAX (1 << 4)
-
-/*
- * This enum is used to track which LZMA symbols have occurred most recently
- * and in which order. This information is used to predict the next symbol.
- *
- * Symbols:
- *  - Literal: One 8-bit byte
- *  - Match: Repeat a chunk of data at some distance
- *  - Long repeat: Multi-byte match at a recently seen distance
- *  - Short repeat: One-byte repeat at a recently seen distance
- *
- * The symbol names are in from STATE_oldest_older_previous. REP means
- * either short or long repeated match, and NONLIT means any non-literal.
- */
-enum lzma_state
-{
-	STATE_LIT_LIT,
-	STATE_MATCH_LIT_LIT,
-	STATE_REP_LIT_LIT,
-	STATE_SHORTREP_LIT_LIT,
-	STATE_MATCH_LIT,
-	STATE_REP_LIT,
-	STATE_SHORTREP_LIT,
-	STATE_LIT_MATCH,
-	STATE_LIT_LONGREP,
-	STATE_LIT_SHORTREP,
-	STATE_NONLIT_MATCH,
-	STATE_NONLIT_REP
-};
-
-/* Total number of states */
-#define STATES 12
-
-/* The lowest 7 states indicate that the previous state was a literal. */
-#define LIT_STATES 7
-
-/* Indicate that the latest symbol was a literal. */
-static inline void lzma_state_literal(enum lzma_state *state)
-{
-	if (*state <= STATE_SHORTREP_LIT_LIT)
-		*state = STATE_LIT_LIT;
-	else if (*state <= STATE_LIT_SHORTREP)
-		*state -= 3;
-	else
-		*state -= 6;
-}
-
-/* Indicate that the latest symbol was a match. */
-static inline void lzma_state_match(enum lzma_state *state)
-{
-	*state = *state < LIT_STATES ? STATE_LIT_MATCH : STATE_NONLIT_MATCH;
-}
-
-/* Indicate that the latest state was a long repeated match. */
-static inline void lzma_state_long_rep(enum lzma_state *state)
-{
-	*state = *state < LIT_STATES ? STATE_LIT_LONGREP : STATE_NONLIT_REP;
-}
-
-/* Indicate that the latest symbol was a short match. */
-static inline void lzma_state_short_rep(enum lzma_state *state)
-{
-	*state = *state < LIT_STATES ? STATE_LIT_SHORTREP : STATE_NONLIT_REP;
-}
-
-/* Test if the previous symbol was a literal. */
-static inline bool lzma_state_is_literal(enum lzma_state state)
-{
-	return state < LIT_STATES;
-}
-
-/* Each literal coder is divided in three sections:
- *   - 0x001-0x0FF: Without match byte
- *   - 0x101-0x1FF: With match byte; match bit is 0
- *   - 0x201-0x2FF: With match byte; match bit is 1
- *
- * Match byte is used when the previous LZMA symbol was something else than
- * a literal (that is, it was some kind of match).
- */
-#define LITERAL_CODER_SIZE 0x300
-
-/* Maximum number of literal coders */
-#define LITERAL_CODERS_MAX (1 << 4)
-
-/* Minimum length of a match is two bytes. */
-#define MATCH_LEN_MIN 2
-
-/* Match length is encoded with 4, 5, or 10 bits.
- *
- * Length   Bits
- *  2-9      4 = Choice=0 + 3 bits
- * 10-17     5 = Choice=1 + Choice2=0 + 3 bits
- * 18-273   10 = Choice=1 + Choice2=1 + 8 bits
- */
-#define LEN_LOW_BITS 3
-#define LEN_LOW_SYMBOLS (1 << LEN_LOW_BITS)
-#define LEN_MID_BITS 3
-#define LEN_MID_SYMBOLS (1 << LEN_MID_BITS)
-#define LEN_HIGH_BITS 8
-#define LEN_HIGH_SYMBOLS (1 << LEN_HIGH_BITS)
-#define LEN_SYMBOLS (LEN_LOW_SYMBOLS + LEN_MID_SYMBOLS + LEN_HIGH_SYMBOLS)
-
-/*
- * Maximum length of a match is 273 which is a result of the encoding
- * described above.
- */
-#define MATCH_LEN_MAX (MATCH_LEN_MIN + LEN_SYMBOLS - 1)
-
-/*
- * Different sets of probabilities are used for match distances that have
- * very short match length: Lengths of 2, 3, and 4 bytes have a separate
- * set of probabilities for each length. The matches with longer length
- * use a shared set of probabilities.
- */
-#define DIST_STATES 4
-
-/*
- * Get the index of the appropriate probability array for decoding
- * the distance slot.
- */
-static inline uint32_t lzma_get_dist_state(uint32_t len)
-{
-	return len < DIST_STATES + MATCH_LEN_MIN ? len - MATCH_LEN_MIN : DIST_STATES - 1;
-}
-
-/*
- * The highest two bits of a 32-bit match distance are encoded using six bits.
- * This six-bit value is called a distance slot. This way encoding a 32-bit
- * value takes 6-36 bits, larger values taking more bits.
- */
-#define DIST_SLOT_BITS 6
-#define DIST_SLOTS (1 << DIST_SLOT_BITS)
-
-/* Match distances up to 127 are fully encoded using probabilities. Since
- * the highest two bits (distance slot) are always encoded using six bits,
- * the distances 0-3 don't need any additional bits to encode, since the
- * distance slot itself is the same as the actual distance. DIST_MODEL_START
- * indicates the first distance slot where at least one additional bit is
- * needed.
- */
-#define DIST_MODEL_START 4
-
-/*
- * Match distances greater than 127 are encoded in three pieces:
- *   - distance slot: the highest two bits
- *   - direct bits: 2-26 bits below the highest two bits
- *   - alignment bits: four lowest bits
- *
- * Direct bits don't use any probabilities.
- *
- * The distance slot value of 14 is for distances 128-191.
- */
-#define DIST_MODEL_END 14
-
-/* Distance slots that indicate a distance <= 127. */
-#define FULL_DISTANCES_BITS (DIST_MODEL_END / 2)
-#define FULL_DISTANCES (1 << FULL_DISTANCES_BITS)
-
-/*
- * For match distances greater than 127, only the highest two bits and the
- * lowest four bits (alignment) is encoded using probabilities.
- */
-#define ALIGN_BITS 4
-#define ALIGN_SIZE (1 << ALIGN_BITS)
-#define ALIGN_MASK (ALIGN_SIZE - 1)
-
-/* Total number of all probability variables */
-#define PROBS_TOTAL (1846 + LITERAL_CODERS_MAX *LITERAL_CODER_SIZE)
-
-/*
- * LZMA remembers the four most recent match distances. Reusing these
- * distances tends to take less space than re-encoding the actual
- * distance value.
- */
-#define REPS 4
-
-#endif
diff --git a/depends/xz-embedded/src/xz_private.h b/depends/xz-embedded/src/xz_private.h
deleted file mode 100644
index 55a3af1c..00000000
--- a/depends/xz-embedded/src/xz_private.h
+++ /dev/null
@@ -1,150 +0,0 @@
-/*
- * Private includes and definitions
- *
- * Author: Lasse Collin <lasse.collin@tukaani.org>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-#ifndef XZ_PRIVATE_H
-#define XZ_PRIVATE_H
-
-#ifdef __KERNEL__
-#include <linux/xz.h>
-#include <linux/kernel.h>
-#include <asm/unaligned.h>
-/* XZ_PREBOOT may be defined only via decompress_unxz.c. */
-#ifndef XZ_PREBOOT
-#include <linux/slab.h>
-#include <linux/vmalloc.h>
-#include <linux/string.h>
-#ifdef CONFIG_XZ_DEC_X86
-#define XZ_DEC_X86
-#endif
-#ifdef CONFIG_XZ_DEC_POWERPC
-#define XZ_DEC_POWERPC
-#endif
-#ifdef CONFIG_XZ_DEC_IA64
-#define XZ_DEC_IA64
-#endif
-#ifdef CONFIG_XZ_DEC_ARM
-#define XZ_DEC_ARM
-#endif
-#ifdef CONFIG_XZ_DEC_ARMTHUMB
-#define XZ_DEC_ARMTHUMB
-#endif
-#ifdef CONFIG_XZ_DEC_SPARC
-#define XZ_DEC_SPARC
-#endif
-#define memeq(a, b, size) (memcmp(a, b, size) == 0)
-#define memzero(buf, size) memset(buf, 0, size)
-#endif
-#define get_le32(p) le32_to_cpup((const uint32_t *)(p))
-#else
-/*
- * For userspace builds, use a separate header to define the required
- * macros and functions. This makes it easier to adapt the code into
- * different environments and avoids clutter in the Linux kernel tree.
- */
-#include "xz_config.h"
-#endif
-
-/* If no specific decoding mode is requested, enable support for all modes. */
-#if !defined(XZ_DEC_SINGLE) && !defined(XZ_DEC_PREALLOC) && !defined(XZ_DEC_DYNALLOC)
-#define XZ_DEC_SINGLE
-#define XZ_DEC_PREALLOC
-#define XZ_DEC_DYNALLOC
-#endif
-
-/*
- * The DEC_IS_foo(mode) macros are used in "if" statements. If only some
- * of the supported modes are enabled, these macros will evaluate to true or
- * false at compile time and thus allow the compiler to omit unneeded code.
- */
-#ifdef XZ_DEC_SINGLE
-#define DEC_IS_SINGLE(mode) ((mode) == XZ_SINGLE)
-#else
-#define DEC_IS_SINGLE(mode) (false)
-#endif
-
-#ifdef XZ_DEC_PREALLOC
-#define DEC_IS_PREALLOC(mode) ((mode) == XZ_PREALLOC)
-#else
-#define DEC_IS_PREALLOC(mode) (false)
-#endif
-
-#ifdef XZ_DEC_DYNALLOC
-#define DEC_IS_DYNALLOC(mode) ((mode) == XZ_DYNALLOC)
-#else
-#define DEC_IS_DYNALLOC(mode) (false)
-#endif
-
-#if !defined(XZ_DEC_SINGLE)
-#define DEC_IS_MULTI(mode) (true)
-#elif defined(XZ_DEC_PREALLOC) || defined(XZ_DEC_DYNALLOC)
-#define DEC_IS_MULTI(mode) ((mode) != XZ_SINGLE)
-#else
-#define DEC_IS_MULTI(mode) (false)
-#endif
-
-/*
- * If any of the BCJ filter decoders are wanted, define XZ_DEC_BCJ.
- * XZ_DEC_BCJ is used to enable generic support for BCJ decoders.
- */
-#ifndef XZ_DEC_BCJ
-#if defined(XZ_DEC_X86) || defined(XZ_DEC_POWERPC) || defined(XZ_DEC_IA64) ||                  \
-	defined(XZ_DEC_ARM) || defined(XZ_DEC_ARM) || defined(XZ_DEC_ARMTHUMB) ||                  \
-	defined(XZ_DEC_SPARC)
-#define XZ_DEC_BCJ
-#endif
-#endif
-
-/*
- * Allocate memory for LZMA2 decoder. xz_dec_lzma2_reset() must be used
- * before calling xz_dec_lzma2_run().
- */
-XZ_EXTERN struct xz_dec_lzma2 *xz_dec_lzma2_create(enum xz_mode mode, uint32_t dict_max);
-
-/*
- * Decode the LZMA2 properties (one byte) and reset the decoder. Return
- * XZ_OK on success, XZ_MEMLIMIT_ERROR if the preallocated dictionary is not
- * big enough, and XZ_OPTIONS_ERROR if props indicates something that this
- * decoder doesn't support.
- */
-XZ_EXTERN enum xz_ret xz_dec_lzma2_reset(struct xz_dec_lzma2 *s, uint8_t props);
-
-/* Decode raw LZMA2 stream from b->in to b->out. */
-XZ_EXTERN enum xz_ret xz_dec_lzma2_run(struct xz_dec_lzma2 *s, struct xz_buf *b);
-
-/* Free the memory allocated for the LZMA2 decoder. */
-XZ_EXTERN void xz_dec_lzma2_end(struct xz_dec_lzma2 *s);
-
-#ifdef XZ_DEC_BCJ
-/*
- * Allocate memory for BCJ decoders. xz_dec_bcj_reset() must be used before
- * calling xz_dec_bcj_run().
- */
-XZ_EXTERN struct xz_dec_bcj *xz_dec_bcj_create(bool single_call);
-
-/*
- * Decode the Filter ID of a BCJ filter. This implementation doesn't
- * support custom start offsets, so no decoding of Filter Properties
- * is needed. Returns XZ_OK if the given Filter ID is supported.
- * Otherwise XZ_OPTIONS_ERROR is returned.
- */
-XZ_EXTERN enum xz_ret xz_dec_bcj_reset(struct xz_dec_bcj *s, uint8_t id);
-
-/*
- * Decode raw BCJ + LZMA2 stream. This must be used only if there actually is
- * a BCJ filter in the chain. If the chain has only LZMA2, xz_dec_lzma2_run()
- * must be called directly.
- */
-XZ_EXTERN enum xz_ret xz_dec_bcj_run(struct xz_dec_bcj *s, struct xz_dec_lzma2 *lzma2,
-									 struct xz_buf *b);
-
-/* Free the memory allocated for the BCJ filters. */
-#define xz_dec_bcj_end(s) kfree(s)
-#endif
-
-#endif
diff --git a/depends/xz-embedded/src/xz_stream.h b/depends/xz-embedded/src/xz_stream.h
deleted file mode 100644
index c0e191e6..00000000
--- a/depends/xz-embedded/src/xz_stream.h
+++ /dev/null
@@ -1,62 +0,0 @@
-/*
- * Definitions for handling the .xz file format
- *
- * Author: Lasse Collin <lasse.collin@tukaani.org>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-#ifndef XZ_STREAM_H
-#define XZ_STREAM_H
-
-#if defined(__KERNEL__) && !XZ_INTERNAL_CRC32
-#include <linux/crc32.h>
-#undef crc32
-#define xz_crc32(buf, size, crc) (~crc32_le(~(uint32_t)(crc), buf, size))
-#endif
-
-/*
- * See the .xz file format specification at
- * http://tukaani.org/xz/xz-file-format.txt
- * to understand the container format.
- */
-
-#define STREAM_HEADER_SIZE 12
-
-#define HEADER_MAGIC "\3757zXZ"
-#define HEADER_MAGIC_SIZE 6
-
-#define FOOTER_MAGIC "YZ"
-#define FOOTER_MAGIC_SIZE 2
-
-/*
- * Variable-length integer can hold a 63-bit unsigned integer or a special
- * value indicating that the value is unknown.
- *
- * Experimental: vli_type can be defined to uint32_t to save a few bytes
- * in code size (no effect on speed). Doing so limits the uncompressed and
- * compressed size of the file to less than 256 MiB and may also weaken
- * error detection slightly.
- */
-typedef uint64_t vli_type;
-
-#define VLI_MAX ((vli_type) - 1 / 2)
-#define VLI_UNKNOWN ((vli_type) - 1)
-
-/* Maximum encoded size of a VLI */
-#define VLI_BYTES_MAX (sizeof(vli_type) * 8 / 7)
-
-/* Integrity Check types */
-enum xz_check
-{
-	XZ_CHECK_NONE = 0,
-	XZ_CHECK_CRC32 = 1,
-	XZ_CHECK_CRC64 = 4,
-	XZ_CHECK_SHA256 = 10
-};
-
-/* Maximum possible Check ID */
-#define XZ_CHECK_MAX 15
-
-#endif
diff --git a/depends/xz-embedded/xzminidec.c b/depends/xz-embedded/xzminidec.c
deleted file mode 100644
index bb62c3ac..00000000
--- a/depends/xz-embedded/xzminidec.c
+++ /dev/null
@@ -1,144 +0,0 @@
-/*
- * Simple XZ decoder command line tool
- *
- * Author: Lasse Collin <lasse.collin@tukaani.org>
- *
- * This file has been put into the public domain.
- * You can do whatever you want with this file.
- */
-
-/*
- * This is really limited: Not all filters from .xz format are supported,
- * only CRC32 is supported as the integrity check, and decoding of
- * concatenated .xz streams is not supported. Thus, you may want to look
- * at xzdec from XZ Utils if a few KiB bigger tool is not a problem.
- */
-
-#include <stdbool.h>
-#include <stdio.h>
-#include <string.h>
-#include "xz.h"
-
-static uint8_t in[BUFSIZ];
-static uint8_t out[BUFSIZ];
-
-int main(int argc, char **argv)
-{
-	struct xz_buf b;
-	struct xz_dec *s;
-	enum xz_ret ret;
-	const char *msg;
-
-	if (argc >= 2 && strcmp(argv[1], "--help") == 0)
-	{
-		fputs("Uncompress a .xz file from stdin to stdout.\n"
-			  "Arguments other than `--help' are ignored.\n",
-			  stdout);
-		return 0;
-	}
-
-	xz_crc32_init();
-#ifdef XZ_USE_CRC64
-	xz_crc64_init();
-#endif
-
-	/*
-	 * Support up to 64 MiB dictionary. The actually needed memory
-	 * is allocated once the headers have been parsed.
-	 */
-	s = xz_dec_init(XZ_DYNALLOC, 1 << 26);
-	if (s == NULL)
-	{
-		msg = "Memory allocation failed\n";
-		goto error;
-	}
-
-	b.in = in;
-	b.in_pos = 0;
-	b.in_size = 0;
-	b.out = out;
-	b.out_pos = 0;
-	b.out_size = BUFSIZ;
-
-	while (true)
-	{
-		if (b.in_pos == b.in_size)
-		{
-			b.in_size = fread(in, 1, sizeof(in), stdin);
-			b.in_pos = 0;
-		}
-
-		ret = xz_dec_run(s, &b);
-
-		if (b.out_pos == sizeof(out))
-		{
-			if (fwrite(out, 1, b.out_pos, stdout) != b.out_pos)
-			{
-				msg = "Write error\n";
-				goto error;
-			}
-
-			b.out_pos = 0;
-		}
-
-		if (ret == XZ_OK)
-			continue;
-
-#ifdef XZ_DEC_ANY_CHECK
-		if (ret == XZ_UNSUPPORTED_CHECK)
-		{
-			fputs(argv[0], stderr);
-			fputs(": ", stderr);
-			fputs("Unsupported check; not verifying "
-				  "file integrity\n",
-				  stderr);
-			continue;
-		}
-#endif
-
-		if (fwrite(out, 1, b.out_pos, stdout) != b.out_pos || fclose(stdout))
-		{
-			msg = "Write error\n";
-			goto error;
-		}
-
-		switch (ret)
-		{
-		case XZ_STREAM_END:
-			xz_dec_end(s);
-			return 0;
-
-		case XZ_MEM_ERROR:
-			msg = "Memory allocation failed\n";
-			goto error;
-
-		case XZ_MEMLIMIT_ERROR:
-			msg = "Memory usage limit reached\n";
-			goto error;
-
-		case XZ_FORMAT_ERROR:
-			msg = "Not a .xz file\n";
-			goto error;
-
-		case XZ_OPTIONS_ERROR:
-			msg = "Unsupported options in the .xz headers\n";
-			goto error;
-
-		case XZ_DATA_ERROR:
-		case XZ_BUF_ERROR:
-			msg = "File is corrupt\n";
-			goto error;
-
-		default:
-			msg = "Bug!\n";
-			goto error;
-		}
-	}
-
-error:
-	xz_dec_end(s);
-	fputs(argv[0], stderr);
-	fputs(": ", stderr);
-	fputs(msg, stderr);
-	return 1;
-}