Reorg.

CMakeLists.txt

@@ -102,7 +102,6 @@ endif()
 add_subdirectory(node)
 add_subdirectory(controller)
 add_subdirectory(osdep)
-#add_subdirectory(root)
 add_subdirectory(go/native)
 
 #if(BUILD_CENTRAL_CONTROLLER)

attic/BP.hpp

@@ -1,176 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#ifndef ZT_BP_HPP
-#define ZT_BP_HPP
-
-#include "Constants.hpp"
-
-namespace ZeroTier {
-
-/**
- * A C-like pointer to a byte array with static bounds checking whenever possible.
- *
- * This fills the niche in between Buf and a naked C pointer and behaves like a C pointer
- * annotated with a length that is statically checked at compile time. It should have no
- * runtime overhead at all.
- *
- * - Explicit or implicit casts are supported to pointers to smaller but not larger arrays
- * - A templated slice() method (analogous to Go slices) allows getting subset arrays
- * - A templated at() method allows bounds checked access to indices known at compile time
- * - Copy and assignment from larger or equal sized arrays, but not smaller
- * - NULL pointers are explicitly not allowed, so a naked pointer must still be used in that case
- *
- * Note that the [] operator for dynamic access is NOT bounds checked as this would add
- * runtime overhead that is not desirable where this is used. The goal here is to keep
- * C performance while being safer to the extent that C++ allows.
- *
- * @tparam S Size of memory to which this pointer must point
- */
-template<unsigned int S>
-class BP
-{
-public:
-	typedef uint8_t * iterator;
-	typedef const uint8_t * const_iterator;
-
-	explicit ZT_INLINE BP(void *const bytes) : p(reinterpret_cast<uint8_t *>(bytes)) {}
-
-	template<unsigned int CS>
-	ZT_INLINE BP(BP<CS> &b) noexcept :
-		p(b.p)
-	{
-		static_assert(CS <= S,"attempt to copy byte pointer from one of smaller size");
-	}
-
-	template<unsigned int CS>
-	ZT_INLINE BP &operator=(BP<CS> &b)
-	{
-		static_assert(CS <= S,"attempt to assign byte pointer from one of smaller size");
-		p = b.p;
-		return *this;
-	}
-
-	template<unsigned int CS>
-	ZT_INLINE operator BP<CS>() noexcept // NOLINT(google-explicit-constructor,hicpp-explicit-conversions)
-	{
-		static_assert(CS <= S,"attempt to cast byte pointer to larger size");
-		return BP<CS>(p);
-	}
-
-	ZT_INLINE uint8_t &operator[](const unsigned int i) noexcept
-	{
-		return p[i];
-	}
-	ZT_INLINE uint8_t operator[](const unsigned int i) const noexcept
-	{
-		return p[i];
-	}
-	template<typename I>
-	ZT_INLINE uint8_t *operator+(const I i) noexcept
-	{
-		return p + i;
-	}
-	template<typename I>
-	ZT_INLINE const uint8_t *operator+(const I i) const noexcept
-	{
-		return p + i;
-	}
-
-	ZT_INLINE uint8_t &operator*() noexcept
-	{
-		static_assert(S > 0,"attempt to access empty array");
-		return *p;
-	}
-	ZT_INLINE uint8_t operator*() const noexcept
-	{
-		static_assert(S > 0,"attempt to access empty array");
-		return *p;
-	}
-
-	template<unsigned int I>
-	ZT_INLINE uint8_t &at() noexcept
-	{
-		static_assert(I < S,"static access beyond end of byte pointer");
-		return p[I];
-	}
-	template<unsigned int I>
-	ZT_INLINE uint8_t at() const noexcept
-	{
-		static_assert(I < S,"static access beyond end of byte pointer");
-		return p[I];
-	}
-
-	template<unsigned int RS,unsigned int RE>
-	ZT_INLINE BP<RE - RS> &slice() noexcept
-	{
-		static_assert(RE > RS,"slice must end after it begins");
-		static_assert(RE <= S,"slice ends after byte array end");
-		return reinterpret_cast< BP<RE - RS> >(*this);
-	}
-
-	template<unsigned int RS,unsigned int RE>
-	ZT_INLINE const BP<RE - RS> &slice() const noexcept
-	{
-		static_assert(RE > RS,"slice must end after it begins");
-		static_assert(RE <= S,"slice ends after byte array end");
-		return reinterpret_cast< BP<RE - RS> >(*this);
-	}
-
-	template<unsigned int F>
-	ZT_INLINE BP<S - F> &from() noexcept
-	{
-		static_assert(F < S,"attempt to get array from beyond bounds");
-		return reinterpret_cast< BP<S - F> >(*this);
-	}
-	template<unsigned int F>
-	ZT_INLINE const BP<S - F> &from() const noexcept
-	{
-		static_assert(F < S,"attempt to get array from beyond bounds");
-		return reinterpret_cast< BP<S - F> >(*this);
-	}
-
-	ZT_INLINE iterator begin() noexcept { return p; }
-	ZT_INLINE iterator end() noexcept { return p + S; }
-	ZT_INLINE const_iterator begin() const noexcept { return p; }
-	ZT_INLINE const_iterator end() const noexcept { return p + S; }
-
-	static constexpr unsigned int size() noexcept { return S; }
-
-	template<unsigned int CS>
-	ZT_INLINE bool operator==(const BP<CS> &b) const noexcept { return p == b.p; }
-	template<unsigned int CS>
-	ZT_INLINE bool operator!=(const BP<CS> &b) const noexcept { return p != b.p; }
-	template<unsigned int CS>
-	ZT_INLINE bool operator<(const BP<CS> &b) const noexcept { return p < b.p; }
-	template<unsigned int CS>
-	ZT_INLINE bool operator>(const BP<CS> &b) const noexcept { return p > b.p; }
-	template<unsigned int CS>
-	ZT_INLINE bool operator<=(const BP<CS> &b) const noexcept { return p <= b.p; }
-	template<unsigned int CS>
-	ZT_INLINE bool operator>=(const BP<CS> &b) const noexcept { return p >= b.p; }
-
-	ZT_INLINE bool operator==(const void *const b) const noexcept { return p == reinterpret_cast<const uint8_t *>(b); }
-	ZT_INLINE bool operator!=(const void *const b) const noexcept { return p != reinterpret_cast<const uint8_t *>(b); }
-	ZT_INLINE bool operator<(const void *const b) const noexcept { return p < reinterpret_cast<const uint8_t *>(b); }
-	ZT_INLINE bool operator>(const void *const b) const noexcept { return p > reinterpret_cast<const uint8_t *>(b); }
-	ZT_INLINE bool operator<=(const void *const b) const noexcept { return p <= reinterpret_cast<const uint8_t *>(b); }
-	ZT_INLINE bool operator>=(const void *const b) const noexcept { return p >= reinterpret_cast<const uint8_t *>(b); }
-
-private:
-	uint8_t *const p;
-};
-
-} // namespace ZeroTier
-
-#endif

attic/Hashtable.hpp

@@ -1,399 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#ifndef ZT_HASHTABLE_HPP
-#define ZT_HASHTABLE_HPP
-
-#include "Constants.hpp"
-#include "Utils.hpp"
-
-#include <cstdlib>
-#include <cstring>
-#include <stdexcept>
-#include <vector>
-
-namespace ZeroTier {
-
-/**
- * A minimal hash table implementation for the ZeroTier core
- *
- * This is optimized for smaller data sets.
- */
-template<typename K,typename V>
-class Hashtable
-{
-private:
-	struct _Bucket
-	{
-		ZT_INLINE _Bucket(const K &k,const V &v) : k(k),v(v) {}
-		explicit ZT_INLINE _Bucket(const K &k) : k(k),v() {}
-		ZT_INLINE _Bucket(const _Bucket &b) : k(b.k),v(b.v) {}
-		ZT_INLINE _Bucket &operator=(const _Bucket &b) { k = b.k; v = b.v; return *this; }
-		_Bucket *next; // must be set manually for each _Bucket
-		const K k;
-		V v;
-	};
-
-public:
-	/**
-	 * A simple forward iterator (different from STL)
-	 *
-	 * It's safe to erase the last key, but not others. Don't use set() since that
-	 * may rehash and invalidate the iterator. Note the erasing the key will destroy
-	 * the targets of the pointers returned by next().
-	 */
-	class Iterator
-	{
-	public:
-		/**
-		 * @param ht Hash table to iterate over
-		 */
-		explicit ZT_INLINE Iterator(Hashtable &ht) noexcept :
-			_idx(0),
-			_ht(&ht),
-			_b(ht._t[0])
-		{
-		}
-
-		/**
-		 * @param kptr Pointer to set to point to next key
-		 * @param vptr Pointer to set to point to next value
-		 * @return True if kptr and vptr are set, false if no more entries
-		 */
-		ZT_INLINE bool next(K *&kptr,V *&vptr)
-		{
-			for(;;) {
-				if (_b) {
-					kptr = (K *)(&(_b->k));
-					vptr = (V *)(&(_b->v));
-					_b = _b->next;
-					return true;
-				}
-				++_idx;
-				if (_idx >= _ht->_bc)
-					return false;
-				_b = _ht->_t[_idx];
-			}
-		}
-
-	private:
-		unsigned long _idx;
-		Hashtable *_ht;
-		_Bucket *_b;
-	};
-	//friend class Hashtable<K,V>::Iterator;
-
-	/**
-	 * @param bc Initial capacity in buckets (default: 32, must be nonzero)
-	 */
-	explicit ZT_INLINE Hashtable(unsigned int bc = 32) :
-		_t(reinterpret_cast<_Bucket **>(::malloc(sizeof(_Bucket *) * bc))),
-		_bc(bc),
-		_s(0)
-	{
-		if (!_t)
-			throw std::bad_alloc();
-		Utils::zero(_t,sizeof(uintptr_t) * bc);
-	}
-
-	ZT_INLINE Hashtable(const Hashtable<K,V> &ht) :
-		Hashtable()
-	{
-		*this = ht;
-	}
-
-	ZT_INLINE ~Hashtable()
-	{
-		this->clear();
-		::free(_t);
-	}
-
-	ZT_INLINE Hashtable &operator=(const Hashtable<K,V> &ht)
-	{
-		this->clear();
-		if (ht._s) {
-			for(unsigned long i=0;i<ht._bc;++i) {
-				const _Bucket *b = ht._t[i];
-				while (b) {
-					this->set(b->k,b->v);
-					b = b->next;
-				}
-			}
-		}
-		return *this;
-	}
-
-	/**
-	 * Erase all entries
-	 */
-	ZT_INLINE void clear()
-	{
-		if (_s) {
-			for(unsigned long i=0;i<_bc;++i) {
-				_Bucket *b = _t[i];
-				while (b) {
-					_Bucket *const nb = b->next;
-					delete b;
-					b = nb;
-				}
-				_t[i] = (_Bucket *)0;
-			}
-			_s = 0;
-		}
-	}
-
-	/**
-	 * @return Vector of all keys
-	 */
-	ZT_INLINE typename std::vector<K> keys() const
-	{
-		typename std::vector<K> k;
-		if (_s) {
-			k.reserve(_s);
-			for(unsigned long i=0;i<_bc;++i) {
-				_Bucket *b = _t[i];
-				while (b) {
-					k.push_back(b->k);
-					b = b->next;
-				}
-			}
-		}
-		return k;
-	}
-
-	/**
-	 * Append all keys (in unspecified order) to the supplied vector or list
-	 *
-	 * @param v Vector, list, or other compliant container
-	 * @tparam Type of V (generally inferred)
-	 */
-	template<typename C>
-	ZT_INLINE void appendKeys(C &v) const
-	{
-		if (_s) {
-			for(unsigned long i=0;i<_bc;++i) {
-				_Bucket *b = _t[i];
-				while (b) {
-					v.push_back(b->k);
-					b = b->next;
-				}
-			}
-		}
-	}
-
-	/**
-	 * @return Vector of all entries (pairs of K,V)
-	 */
-	ZT_INLINE typename std::vector< std::pair<K,V> > entries() const
-	{
-		typename std::vector< std::pair<K,V> > k;
-		if (_s) {
-			k.reserve(_s);
-			for(unsigned long i=0;i<_bc;++i) {
-				_Bucket *b = _t[i];
-				while (b) {
-					k.push_back(std::pair<K,V>(b->k,b->v));
-					b = b->next;
-				}
-			}
-		}
-		return k;
-	}
-
-	/**
-	 * @param k Key
-	 * @return Pointer to value or NULL if not found
-	 */
-	ZT_INLINE V *get(const K k)
-	{
-		_Bucket *b = _t[_hc(k) % _bc];
-		while (b) {
-			if (b->k == k)
-				return &(b->v);
-			b = b->next;
-		}
-		return (V *)0;
-	}
-	ZT_INLINE const V *get(const K k) const { return const_cast<Hashtable *>(this)->get(k); }
-
-	/**
-	 * @param k Key
-	 * @param v Value to fill with result
-	 * @return True if value was found and set (if false, v is not modified)
-	 */
-	ZT_INLINE bool get(const K &k,V &v) const
-	{
-		_Bucket *b = _t[_hc(k) % _bc];
-		while (b) {
-			if (b->k == k) {
-				v = b->v;
-				return true;
-			}
-			b = b->next;
-		}
-		return false;
-	}
-
-	/**
-	 * @param k Key to check
-	 * @return True if key is present
-	 */
-	ZT_INLINE bool contains(const K &k) const
-	{
-		_Bucket *b = _t[_hc(k) % _bc];
-		while (b) {
-			if (b->k == k)
-				return true;
-			b = b->next;
-		}
-		return false;
-	}
-
-	/**
-	 * @param k Key
-	 * @return True if value was present
-	 */
-	ZT_INLINE bool erase(const K &k)
-	{
-		const unsigned long bidx = _hc(k) % _bc;
-		_Bucket *lastb = (_Bucket *)0;
-		_Bucket *b = _t[bidx];
-		while (b) {
-			if (b->k == k) {
-				if (lastb)
-					lastb->next = b->next;
-				else _t[bidx] = b->next;
-				delete b;
-				--_s;
-				return true;
-			}
-			lastb = b;
-			b = b->next;
-		}
-		return false;
-	}
-
-	/**
-	 * @param k Key
-	 * @param v Value
-	 * @return Reference to value in table
-	 */
-	ZT_INLINE V &set(const K &k,const V &v)
-	{
-		const unsigned long h = _hc(k);
-		unsigned long bidx = h % _bc;
-
-		_Bucket *b = _t[bidx];
-		while (b) {
-			if (b->k == k) {
-				b->v = v;
-				return b->v;
-			}
-			b = b->next;
-		}
-
-		if (_s >= _bc) {
-			_grow();
-			bidx = h % _bc;
-		}
-
-		b = new _Bucket(k,v);
-		b->next = _t[bidx];
-		_t[bidx] = b;
-		++_s;
-		return b->v;
-	}
-
-	/**
-	 * @param k Key
-	 * @return Value, possibly newly created
-	 */
-	ZT_INLINE V &operator[](const K k)
-	{
-		const unsigned long h = _hc(k);
-		unsigned long bidx = h % _bc;
-
-		_Bucket *b = _t[bidx];
-		while (b) {
-			if (b->k == k)
-				return b->v;
-			b = b->next;
-		}
-
-		if (_s >= _bc) {
-			_grow();
-			bidx = h % _bc;
-		}
-
-		b = new _Bucket(k);
-		b->next = _t[bidx];
-		_t[bidx] = b;
-		++_s;
-		return b->v;
-	}
-
-	/**
-	 * @return Number of entries
-	 */
-	ZT_INLINE unsigned long size() const noexcept { return _s; }
-
-	/**
-	 * @return True if table is empty
-	 */
-	ZT_INLINE bool empty() const noexcept { return (_s == 0); }
-
-private:
-	template<typename O>
-	static ZT_INLINE unsigned long _hc(const O &obj) { return (unsigned long)obj.hashCode(); }
-	static ZT_INLINE unsigned long _hc(const uint64_t i) noexcept { return (unsigned long)(i + (i >> 32U)); }
-	static ZT_INLINE unsigned long _hc(const uint32_t i) noexcept { return ((unsigned long)i * (unsigned long)0x9e3779b1); }
-	static ZT_INLINE unsigned long _hc(const uint16_t i) noexcept { return ((unsigned long)i * (unsigned long)0x9e3779b1); }
-	static ZT_INLINE unsigned long _hc(const uint8_t i) noexcept { return ((unsigned long)i * (unsigned long)0x9e3779b1); }
-	static ZT_INLINE unsigned long _hc(const int64_t i) noexcept { return (unsigned long)((unsigned long long)i + ((unsigned long long)i >> 32U)); }
-	static ZT_INLINE unsigned long _hc(const int32_t i) noexcept { return ((unsigned long)i * (unsigned long)0x9e3779b1); }
-	static ZT_INLINE unsigned long _hc(const int16_t i) noexcept { return ((unsigned long)i * (unsigned long)0x9e3779b1); }
-	static ZT_INLINE unsigned long _hc(const int8_t i) noexcept { return ((unsigned long)i * (unsigned long)0x9e3779b1); }
-	static ZT_INLINE unsigned long _hc(void *p) noexcept { return ((unsigned long)((uintptr_t)p) * (unsigned long)0x9e3779b1); }
-	static ZT_INLINE unsigned long _hc(const void *p) noexcept { return ((unsigned long)((uintptr_t)p) * (unsigned long)0x9e3779b1); }
-
-	ZT_INLINE void _grow()
-	{
-		const unsigned long nc = _bc * 2;
-		_Bucket **nt = reinterpret_cast<_Bucket **>(::malloc(sizeof(_Bucket *) * nc));
-		if (nt) {
-			for(unsigned long i=0;i<nc;++i)
-				nt[i] = (_Bucket *)0;
-			for(unsigned long i=0;i<_bc;++i) {
-				_Bucket *b = _t[i];
-				while (b) {
-					_Bucket *const nb = b->next;
-					const unsigned long nidx = _hc(b->k) % nc;
-					b->next = nt[nidx];
-					nt[nidx] = b;
-					b = nb;
-				}
-			}
-			::free(_t);
-			_t = nt;
-			_bc = nc;
-		}
-	}
-
-	_Bucket **_t;
-	unsigned long _bc;
-	unsigned long _s;
-};
-
-} // namespace ZeroTier
-
-#endif

attic/IncomingPacket.cpp

@@ -1,970 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#include "Constants.hpp"
-#include "RuntimeEnvironment.hpp"
-#include "IncomingPacket.hpp"
-#include "Topology.hpp"
-#include "Switch.hpp"
-#include "Peer.hpp"
-#include "NetworkController.hpp"
-#include "SelfAwareness.hpp"
-#include "Salsa20.hpp"
-#include "Node.hpp"
-#include "CertificateOfMembership.hpp"
-#include "Capability.hpp"
-#include "Tag.hpp"
-#include "Revocation.hpp"
-#include "Trace.hpp"
-#include "Buf.hpp"
-
-#include <cstring>
-#include <cstdlib>
-
-// Macro to avoid calling hton() on values known at compile time.
-#if __BYTE_ORDER == __LITTLE_ENDIAN
-#define CONST_TO_BE_UINT16(x) ((uint16_t)((uint16_t)((uint16_t)(x) << 8U) | (uint16_t)((uint16_t)(x) >> 8U)))
-#else
-#define CONST_TO_BE_UINT16(x) ((uint16_t)(x))
-#endif
-
-namespace ZeroTier {
-
-namespace {
-
-volatile uint16_t junk = 0;
-
-void _sendErrorNeedCredentials(IncomingPacket &p,const RuntimeEnvironment *RR,void *tPtr,const SharedPtr<Peer> &peer,const uint64_t nwid)
-{
-	ZT_GET_NEW_BUF(outp,Protocol::ERROR::NEED_MEMBERSHIP_CERTIFICATE);
-
-	outp->data.fields.h.packetId = Protocol::getPacketId();
-	peer->address().copyTo(outp->data.fields.h.destination);
-	RR->identity.address().copyTo(outp->data.fields.h.source);
-	outp->data.fields.h.flags = 0;
-	outp->data.fields.h.verb = Protocol::VERB_ERROR;
-
-	outp->data.fields.eh.inRePacketId = p.idBE;
-	outp->data.fields.eh.inReVerb = p.pkt->data.fields.verb;
-	outp->data.fields.eh.error = Protocol::ERROR_NEED_MEMBERSHIP_CERTIFICATE;
-	outp->data.fields.networkId = nwid;
-
-	Protocol::armor(*outp,sizeof(Protocol::ERROR::NEED_MEMBERSHIP_CERTIFICATE),peer->key(),ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012);
-	p.path->send(RR,tPtr,outp->data.bytes,sizeof(Protocol::ERROR::NEED_MEMBERSHIP_CERTIFICATE),RR->node->now());
-}
-
-ZT_ALWAYS_INLINE bool _doHELLO(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const bool alreadyAuthenticated)
-{
-	if (p.size < sizeof(Protocol::HELLO)) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,Identity(),p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-		return true;
-	}
-	Buf< Protocol::HELLO > &pkt = reinterpret_cast<Buf< Protocol::HELLO > &>(*p.pkt);
-
-	Identity id;
-	int ptr = sizeof(Protocol::HELLO);
-	if (pkt.rO(ptr,id) < 0) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,Identity(),p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_INVALID_OBJECT);
-		return true;
-	}
-
-	if (pkt.data.fields.versionProtocol < ZT_PROTO_VERSION_MIN) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_PEER_TOO_OLD);
-		return true;
-	}
-	if (Address(pkt.data.fields.h.source) != id.address()) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-		return true;
-	}
-
-	const int64_t now = RR->node->now();
-
-	SharedPtr<Peer> peer(RR->topology->get(tPtr,id.address()));
-	if (peer) {
-		// We already have an identity with this address -- check for collisions
-		if (!alreadyAuthenticated) {
-			if (peer->identity() != id) {
-				// Identity is different from the one we already have -- address collision
-
-				// Check rate limits
-				if (!RR->node->rateGateIdentityVerification(now,p.path->address()))
-					return true;
-
-				uint8_t key[ZT_PEER_SECRET_KEY_LENGTH];
-				if (RR->identity.agree(id,key)) {
-					if (Protocol::dearmor(pkt,p.size,key) < 0) { // ensure packet is authentic, otherwise drop
-						RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_MAC_FAILED);
-						return true;
-					} else {
-						// TODO: we handle identity collisions differently now
-					}
-				} else {
-					RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_MAC_FAILED);
-					return true;
-				}
-
-				return true;
-			} else {
-				// Identity is the same as the one we already have -- check packet integrity
-
-				if (Protocol::dearmor(pkt,p.size,peer->key()) < 0) {
-					RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_MAC_FAILED);
-					return true;
-				}
-
-				// Continue at // VALID
-			}
-		} // else if alreadyAuthenticated then continue at // VALID
-	} else {
-		// We don't already have an identity with this address -- validate and learn it
-
-		// Sanity check: this basically can't happen
-		if (alreadyAuthenticated) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,Identity(),p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_UNSPECIFIED);
-			return true;
-		}
-
-		// Check rate limits
-		if (!RR->node->rateGateIdentityVerification(now,p.path->address())) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_RATE_LIMIT_EXCEEDED);
-			return true;
-		}
-
-		// Check packet integrity and MAC (this is faster than locallyValidate() so do it first to filter out total crap)
-		SharedPtr<Peer> newPeer(new Peer(RR));
-		if (!newPeer->init(RR->identity,id)) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_MAC_FAILED);
-			return true;
-		}
-		if (Protocol::dearmor(pkt,p.size,newPeer->key())) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_MAC_FAILED);
-			return true;
-		}
-
-		// Check that identity's address is valid as per the derivation function
-		if (!id.locallyValidate()) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_INVALID_OBJECT);
-			return true;
-		}
-
-		peer = RR->topology->add(tPtr,newPeer);
-
-		// Continue at // VALID
-	}
-
-	// VALID -- if we made it here, packet passed identity and authenticity checks!
-
-	// Get address to which this packet was sent to learn our external surface address if packet was direct.
-	InetAddress externalSurfaceAddress;
-	if (ptr < p.size) {
-		if (pkt.rO(ptr,externalSurfaceAddress) < 0) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,id,p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_INVALID_OBJECT);
-			return true;
-		}
-		if ((p.hops == 0)&&(externalSurfaceAddress))
-			RR->sa->iam(tPtr,id,p.path->localSocket(),p.path->address(),externalSurfaceAddress,RR->topology->isRoot(id),now);
-	}
-
-	// Send OK(HELLO) with an echo of the packet's timestamp and some of the same
-	// information about us: version, sent-to address, etc.
-
-	ZT_GET_NEW_BUF(outp,Protocol::OK::HELLO);
-
-	outp->data.fields.h.packetId = Protocol::getPacketId();
-	peer->address().copyTo(outp->data.fields.h.destination);
-	RR->identity.address().copyTo(outp->data.fields.h.source);
-	outp->data.fields.h.flags = 0;
-	outp->data.fields.h.verb = Protocol::VERB_OK;
-
-	outp->data.fields.oh.inReVerb = Protocol::VERB_HELLO;
-	outp->data.fields.oh.inRePacketId = p.idBE;
-
-	outp->data.fields.timestampEcho = pkt.data.fields.timestamp;
-	outp->data.fields.versionProtocol = ZT_PROTO_VERSION;
-	outp->data.fields.versionMajor = ZEROTIER_ONE_VERSION_MAJOR;
-	outp->data.fields.versionMinor = ZEROTIER_ONE_VERSION_MINOR;
-	outp->data.fields.versionRev = CONST_TO_BE_UINT16(ZEROTIER_ONE_VERSION_REVISION);
-
-	int outl = sizeof(Protocol::OK::HELLO);
-	outp->wO(outl,p.path->address());
-	if (!Buf<>::writeOverflow(outl)) {
-		Protocol::armor(*outp,outl,peer->key(),ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012);
-		p.path->send(RR,tPtr,outp->data.bytes,outl,RR->node->now());
-	}
-
-	peer->setRemoteVersion(pkt.data.fields.versionProtocol,pkt.data.fields.versionMajor,pkt.data.fields.versionMinor,Utils::ntoh(pkt.data.fields.versionRev));
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_HELLO,0,Protocol::VERB_NOP,0);
-
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doERROR(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	if (p.size < sizeof(Protocol::ERROR::Header)) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_ERROR,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-		return true;
-	}
-	Buf< Protocol::ERROR::Header > &pkt = reinterpret_cast<Buf< Protocol::ERROR::Header > &>(*p.pkt);
-
-	uint64_t networkId = 0;
-	int ptr = sizeof(Protocol::ERROR::Header);
-
-	/* Security note: we do not gate doERROR() with expectingReplyTo() to
-	 * avoid having to log every outgoing packet ID. Instead we put the
-	 * logic to determine whether we should consider an ERROR in each
-	 * error handler. In most cases these are only trusted in specific
-	 * circumstances. */
-
-	switch(pkt.data.fields.error) {
-
-		case Protocol::ERROR_OBJ_NOT_FOUND:
-			// Object not found, currently only meaningful from network controllers.
-			if (pkt.data.fields.inReVerb == Protocol::VERB_NETWORK_CONFIG_REQUEST) {
-				networkId = pkt.rI64(ptr);
-				const SharedPtr<Network> network(RR->node->network(networkId));
-				if ((network)&&(network->controller() == peer->address()))
-					network->setNotFound();
-			}
-			break;
-
-		case Protocol::ERROR_UNSUPPORTED_OPERATION:
-			// This can be sent in response to any operation, though right now we only
-			// consider it meaningful from network controllers. This would indicate
-			// that the queried node does not support acting as a controller.
-			if (pkt.data.fields.inReVerb == Protocol::VERB_NETWORK_CONFIG_REQUEST) {
-				networkId = pkt.rI64(ptr);
-				const SharedPtr<Network> network(RR->node->network(networkId));
-				if ((network)&&(network->controller() == peer->address()))
-					network->setNotFound();
-			}
-			break;
-
-		case Protocol::ERROR_NEED_MEMBERSHIP_CERTIFICATE: {
-			// Peers can send this to ask for a cert for a network.
-			networkId = pkt.rI64(ptr);
-			const SharedPtr<Network> network(RR->node->network(networkId));
-			const int64_t now = RR->node->now();
-			if ((network)&&(network->config().com))
-				network->pushCredentialsNow(tPtr,peer->address(),now);
-		}	break;
-
-		case Protocol::ERROR_NETWORK_ACCESS_DENIED_: {
-			// Network controller: network access denied.
-			networkId = pkt.rI64(ptr);
-			const SharedPtr<Network> network(RR->node->network(networkId));
-			if ((network)&&(network->controller() == peer->address()))
-				network->setAccessDenied();
-		}	break;
-
-		default: break;
-	}
-
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_ERROR,pkt.data.fields.inRePacketId,(Protocol::Verb)pkt.data.fields.inReVerb,networkId);
-
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doOK(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	if (p.size < sizeof(Protocol::OK::Header)) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_OK,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-		return true;
-	}
-	Buf< Protocol::OK::Header > &pkt = reinterpret_cast<Buf< Protocol::OK::Header > &>(*p.pkt);
-
-	uint64_t networkId = 0;
-	int ptr = sizeof(Protocol::OK::Header);
-
-	if (!RR->node->expectingReplyTo(p.idBE))
-		return true;
-
-	switch(pkt.data.fields.inReVerb) {
-
-		case Protocol::VERB_HELLO: {
-			if (p.size < sizeof(Protocol::OK::HELLO)) {
-				RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-				return true;
-			}
-			Buf< Protocol::OK::HELLO > &pkt2 = reinterpret_cast<Buf< Protocol::OK::HELLO > &>(pkt);
-
-			if (pkt2.data.fields.versionProtocol < ZT_PROTO_VERSION_MIN)
-				return true;
-			peer->updateLatency((unsigned int)(p.receiveTime - Utils::ntoh(pkt2.data.fields.timestampEcho)));
-			peer->setRemoteVersion(pkt2.data.fields.versionProtocol,pkt2.data.fields.versionMajor,pkt2.data.fields.versionMinor,Utils::ntoh(pkt2.data.fields.versionRev));
-
-			ptr = sizeof(Protocol::OK::HELLO);
-			if (ptr < p.size) {
-				InetAddress externalSurfaceAddress;
-				if (pkt2.rO(ptr,externalSurfaceAddress) < 0)
-					return true;
-				if ((externalSurfaceAddress)&&(p.hops == 0))
-					RR->sa->iam(tPtr,peer->identity(),p.path->localSocket(),p.path->address(),externalSurfaceAddress,RR->topology->isRoot(peer->identity()),RR->node->now());
-			}
-		}	break;
-
-		case Protocol::VERB_WHOIS:
-			if (RR->topology->isRoot(peer->identity())) {
-				while (ptr < p.size) {
-					Identity id;
-					if (pkt.rO(ptr,id) < 0)
-						break;
-					Locator loc;
-					if (ptr < p.size) { // older nodes did not send the locator
-						if (pkt.rO(ptr,loc) < 0)
-							break;
-					}
-					if (id) {
-						SharedPtr<Peer> ptmp(RR->topology->add(tPtr,SharedPtr<Peer>(new Peer(RR))));
-						ptmp->init(RR->identity,id);
-						RR->sw->doAnythingWaitingForPeer(tPtr,ptmp);
-					}
-				}
-			}
-			break;
-
-		case Protocol::VERB_NETWORK_CONFIG_REQUEST: {
-			networkId = pkt.rI64(ptr);
-			const SharedPtr<Network> network(RR->node->network(networkId));
-			if (network)
-				network->handleConfigChunk(tPtr,p.idBE,peer,pkt,sizeof(Protocol::OK::Header),(int)p.size);
-		}	break;
-
-		case Protocol::VERB_MULTICAST_GATHER: {
-			// TODO
-		}	break;
-
-		default: break;
-	}
-
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_OK,pkt.data.fields.inRePacketId,(Protocol::Verb)pkt.data.fields.inReVerb,networkId);
-
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doWHOIS(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	if (!peer->rateGateInboundWhoisRequest(RR->node->now())) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_WHOIS,ZT_TRACE_PACKET_DROP_REASON_RATE_LIMIT_EXCEEDED);
-		return true;
-	}
-
-	ZT_GET_NEW_BUF(outp,Protocol::OK::WHOIS);
-
-	outp->data.fields.h.packetId = Protocol::getPacketId();
-	peer->address().copyTo(outp->data.fields.h.destination);
-	RR->identity.address().copyTo(outp->data.fields.h.source);
-	outp->data.fields.h.flags = 0;
-	outp->data.fields.h.verb = Protocol::VERB_OK;
-
-	outp->data.fields.oh.inReVerb = Protocol::VERB_WHOIS;
-	outp->data.fields.oh.inRePacketId = p.idBE;
-
-	int ptr = sizeof(Protocol::Header);
-	int outl = sizeof(Protocol::OK::WHOIS);
-	while ((ptr + ZT_ADDRESS_LENGTH) <= p.size) {
-		const SharedPtr<Peer> ptmp(RR->topology->get(tPtr,Address(p.pkt->data.bytes + ptr)));
-		if (ptmp) {
-			outp->wO(outl,ptmp->identity());
-			Locator loc(ptmp->locator());
-			outp->wO(outl,loc);
-		}
-		ptr += ZT_ADDRESS_LENGTH;
-	}
-
-	if ((outl > sizeof(Protocol::OK::WHOIS))&&(!Buf<>::writeOverflow(outl))) {
-		Protocol::armor(*outp,outl,peer->key(),ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012);
-		p.path->send(RR,tPtr,outp->data.bytes,outl,RR->node->now());
-	}
-
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_WHOIS,0,Protocol::VERB_NOP,0);
-
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doRENDEZVOUS(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	if (RR->topology->isRoot(peer->identity())) {
-		if (p.size < sizeof(Protocol::RENDEZVOUS)) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_RENDEZVOUS,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-			return true;
-		}
-		Buf< Protocol::RENDEZVOUS > &pkt = reinterpret_cast<Buf< Protocol::RENDEZVOUS > &>(*p.pkt);
-
-		const SharedPtr<Peer> with(RR->topology->get(tPtr,Address(pkt.data.fields.peerAddress)));
-		if (with) {
-			const unsigned int port = Utils::ntoh(pkt.data.fields.port);
-			if (port != 0) {
-				switch(pkt.data.fields.addressLength) {
-					case 4:
-						if ((sizeof(Protocol::RENDEZVOUS) + 4) <= p.size) {
-							InetAddress atAddr(pkt.data.fields.address,4,port);
-							++junk;
-							RR->node->putPacket(tPtr,p.path->localSocket(),atAddr,(const void *)&junk,2,2); // IPv4 "firewall opener" hack
-							with->sendHELLO(tPtr,p.path->localSocket(),atAddr,RR->node->now());
-							RR->t->tryingNewPath(tPtr,with->identity(),atAddr,p.path->address(),p.idBE,Protocol::VERB_RENDEZVOUS,peer->address(),peer->identity().hash(),ZT_TRACE_TRYING_NEW_PATH_REASON_RENDEZVOUS);
-						}
-						break;
-					case 16:
-						if ((sizeof(Protocol::RENDEZVOUS) + 16) <= p.size) {
-							InetAddress atAddr(pkt.data.fields.address,16,port);
-							with->sendHELLO(tPtr,p.path->localSocket(),atAddr,RR->node->now());
-							RR->t->tryingNewPath(tPtr,with->identity(),atAddr,p.path->address(),p.idBE,Protocol::VERB_RENDEZVOUS,peer->address(),peer->identity().hash(),ZT_TRACE_TRYING_NEW_PATH_REASON_RENDEZVOUS);
-						}
-						break;
-				}
-			}
-		}
-	}
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_RENDEZVOUS,0,Protocol::VERB_NOP,0);
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doFRAME(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	if (p.size < sizeof(Protocol::FRAME)) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_EXT_FRAME,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-		return true;
-	}
-	Buf< Protocol::FRAME > &pkt = reinterpret_cast<Buf< Protocol::FRAME > &>(*p.pkt);
-
-	const SharedPtr<Network> network(RR->node->network(Utils::ntoh(pkt.data.fields.networkId)));
-	if (network) {
-		if (network->gate(tPtr,peer)) {
-			const unsigned int etherType = Utils::ntoh(pkt.data.fields.etherType);
-			const MAC sourceMac(peer->address(),network->id());
-			const unsigned int frameLen = (unsigned int)(p.size - sizeof(Protocol::FRAME));
-			if (network->filterIncomingPacket(tPtr,peer,RR->identity.address(),sourceMac,network->mac(),pkt.data.fields.data,frameLen,etherType,0) > 0)
-				RR->node->putFrame(tPtr,network->id(),network->userPtr(),sourceMac,network->mac(),etherType,0,pkt.data.fields.data,frameLen);
-		} else {
-			RR->t->incomingNetworkFrameDropped(tPtr,network->id(),MAC(),MAC(),peer->identity(),p.path->address(),p.hops,0,nullptr,Protocol::VERB_FRAME,true,ZT_TRACE_FRAME_DROP_REASON_PERMISSION_DENIED);
-			_sendErrorNeedCredentials(p,RR,tPtr,peer,network->id());
-			return false; // try to decode again after we get credentials?
-		}
-	}
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_FRAME,0,Protocol::VERB_NOP,0);
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doEXT_FRAME(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	if (p.size < sizeof(Protocol::EXT_FRAME)) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_EXT_FRAME,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-		return true;
-	}
-	Buf< Protocol::EXT_FRAME > &pkt = reinterpret_cast<Buf< Protocol::EXT_FRAME > &>(*p.pkt);
-
-	const SharedPtr<Network> network(RR->node->network(Utils::ntoh(pkt.data.fields.networkId)));
-	if (network) {
-		int ptr = sizeof(Protocol::EXT_FRAME);
-		const uint8_t flags = pkt.data.fields.flags;
-
-		if ((flags & Protocol::EXT_FRAME_FLAG_COM_ATTACHED_deprecated) != 0) {
-			CertificateOfMembership com;
-			if (pkt.rO(ptr,com) < 0) {
-				RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_EXT_FRAME,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-				return true;
-			}
-			if (com)
-				network->addCredential(tPtr,peer->identity(),com);
-		}
-
-		if (!network->gate(tPtr,peer)) {
-			RR->t->incomingNetworkFrameDropped(tPtr,network->id(),MAC(),MAC(),peer->identity(),p.path->address(),p.hops,0,nullptr,Protocol::VERB_EXT_FRAME,true,ZT_TRACE_FRAME_DROP_REASON_PERMISSION_DENIED);
-			_sendErrorNeedCredentials(p,RR,tPtr,peer,network->id());
-			return false; // try to parse again if we get credentials
-		}
-
-		const MAC to(pkt.rBnc(ptr,6));
-		const MAC from(pkt.rBnc(ptr,6));
-		const unsigned int etherType = pkt.rI16(ptr);
-
-		if ((from)&&(from != network->mac())&&(!Buf<>::readOverflow(ptr,p.size))) {
-			const int frameSize = (int)(p.size - ptr);
-			if (frameSize >= 0) {
-				const uint64_t nwid = network->id();
-				const uint8_t *const frameData = pkt.data.bytes + ptr;
-				switch (network->filterIncomingPacket(tPtr,peer,RR->identity.address(),from,to,frameData,frameSize,etherType,0)) {
-
-					case 1:
-						if (from != MAC(peer->address(),nwid)) {
-							if (network->config().permitsBridging(peer->address())) {
-								network->learnBridgeRoute(from,peer->address());
-							} else {
-								RR->t->incomingNetworkFrameDropped(tPtr,nwid,from,to,peer->identity(),p.path->address(),p.hops,(uint16_t)frameSize,frameData,Protocol::VERB_EXT_FRAME,true,ZT_TRACE_FRAME_DROP_REASON_BRIDGING_NOT_ALLOWED_REMOTE);
-								goto packet_dropped;
-							}
-						} else if (to != network->mac()) {
-							if (to.isMulticast()) {
-								if (network->config().multicastLimit == 0) {
-									RR->t->incomingNetworkFrameDropped(tPtr,nwid,from,to,peer->identity(),p.path->address(),p.hops,(uint16_t)frameSize,frameData,Protocol::VERB_EXT_FRAME,true,ZT_TRACE_FRAME_DROP_REASON_MULTICAST_DISABLED);
-									goto packet_dropped;
-								}
-							} else if (!network->config().permitsBridging(RR->identity.address())) {
-								RR->t->incomingNetworkFrameDropped(tPtr,nwid,from,to,peer->identity(),p.path->address(),p.hops,(uint16_t)frameSize,frameData,Protocol::VERB_EXT_FRAME,true,ZT_TRACE_FRAME_DROP_REASON_BRIDGING_NOT_ALLOWED_LOCAL);
-								goto packet_dropped;
-							}
-						}
-						// fall through -- 2 means accept regardless of bridging checks or other restrictions
-
-					case 2:
-						RR->node->putFrame(tPtr,nwid,network->userPtr(),from,to,etherType,0,frameData,frameSize);
-						break;
-
-				}
-			}
-		}
-
-		if ((flags & Protocol::EXT_FRAME_FLAG_ACK_REQUESTED) != 0) {
-			ZT_GET_NEW_BUF(outp,Protocol::OK::EXT_FRAME);
-
-			outp->data.fields.h.packetId = Protocol::getPacketId();
-			peer->address().copyTo(outp->data.fields.h.destination);
-			RR->identity.address().copyTo(outp->data.fields.h.source);
-			outp->data.fields.h.flags = 0;
-			outp->data.fields.h.verb = Protocol::VERB_OK;
-
-			outp->data.fields.oh.inReVerb = Protocol::VERB_EXT_FRAME;
-			outp->data.fields.oh.inRePacketId = p.idBE;
-
-			outp->data.fields.networkId = pkt.data.fields.networkId;
-			outp->data.fields.flags = 0;
-			to.copyTo(outp->data.fields.destMac);
-			from.copyTo(outp->data.fields.sourceMac);
-			outp->data.fields.etherType = Utils::hton((uint16_t)etherType);
-
-			Protocol::armor(*outp,sizeof(Protocol::OK::EXT_FRAME),peer->key(),ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012);
-			p.path->send(RR,tPtr,outp->data.bytes,sizeof(Protocol::OK::EXT_FRAME),RR->node->now());
-		}
-	}
-
-packet_dropped:
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_EXT_FRAME,0,Protocol::VERB_NOP,0);
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doECHO(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	if (!peer->rateGateEchoRequest(RR->node->now())) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_ECHO,ZT_TRACE_PACKET_DROP_REASON_RATE_LIMIT_EXCEEDED);
-		return true;
-	}
-
-	ZT_GET_NEW_BUF(outp,Protocol::OK::ECHO);
-
-	outp->data.fields.h.packetId = Protocol::getPacketId();
-	peer->address().copyTo(outp->data.fields.h.destination);
-	RR->identity.address().copyTo(outp->data.fields.h.source);
-	outp->data.fields.h.flags = 0;
-	outp->data.fields.h.verb = Protocol::VERB_OK;
-
-	outp->data.fields.oh.inReVerb = Protocol::VERB_ECHO;
-	outp->data.fields.oh.inRePacketId = p.idBE;
-
-	int outl = sizeof(Protocol::OK::ECHO);
-	if (p.size > sizeof(Protocol::Header)) {
-		outp->wB(outl,p.pkt->data.bytes + sizeof(Protocol::Header),p.size - sizeof(Protocol::Header));
-	}
-
-	if (!Buf<>::writeOverflow(outl)) {
-		Protocol::armor(*outp,outl,peer->key(),ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012);
-		p.path->send(RR,tPtr,outp->data.bytes,outl,RR->node->now());
-	}
-
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_ECHO,0,Protocol::VERB_NOP,0);
-
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doNETWORK_CREDENTIALS(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	int ptr = sizeof(Protocol::Header);
-	const uint8_t *payload = p.pkt->data.bytes;
-	SharedPtr<Network> network;
-
-	// Early versions of ZeroTier sent only the certificate of membership. The COM always
-	// starts with a non-zero byte. To extend this message we then parse COMs until we find
-	// a zero byte, then parse the other types (which are prefaced by a count for better
-	// extensibility) if they are present.
-
-	// Also note that technically these can be for different networks but in practice they
-	// are always for the same network (when talking with current nodes). This code therefore
-	// accepts different networks for each credential and ignores any credentials for
-	// networks that we've not currently joined.
-
-	while ((ptr < p.size)&&(payload[ptr] != 0)) {
-		CertificateOfMembership com;
-		int l = com.unmarshal(payload + ptr,(int)(p.size - ptr));
-		if (l < 0) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CREDENTIALS,ZT_TRACE_PACKET_DROP_REASON_INVALID_OBJECT);
-			return true;
-		}
-		ptr += l;
-
-		const uint64_t nwid = com.networkId();
-		if ((!network)||(network->id() != nwid))
-			network = RR->node->network(nwid);
-		if (network) {
-			if (network->addCredential(tPtr,peer->identity(),com) == Membership::ADD_DEFERRED_FOR_WHOIS)
-				return false;
-		}
-	}
-	++ptr; // skip trailing 0 after COMs if present
-
-	// The following code is copypasta for each credential type: capability, tag, revocation,
-	// and certificate of ownership. Each type is prefaced by a count, but it's legal for the
-	// packet to terminate prematurely if all remaining counts are zero.
-
-	if (ptr >= p.size)
-		return true;
-
-	unsigned int count = p.pkt->rI16(ptr);
-	for(unsigned int i=0;i<count;++i) {
-		if (ptr >= p.size) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CREDENTIALS,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-			return true;
-		}
-		Capability cap;
-		int l = cap.unmarshal(payload + ptr,(int)(p.size - ptr));
-		if (l < 0) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CREDENTIALS,ZT_TRACE_PACKET_DROP_REASON_INVALID_OBJECT);
-			return true;
-		}
-		ptr += l;
-
-		const uint64_t nwid = cap.networkId();
-		if ((!network)||(network->id() != nwid))
-			network = RR->node->network(nwid);
-		if (network) {
-			if (network->addCredential(tPtr,peer->identity(),cap) == Membership::ADD_DEFERRED_FOR_WHOIS)
-				return false;
-		}
-	}
-
-	if (ptr >= p.size)
-		return true;
-
-	count = p.pkt->rI16(ptr);
-	for(unsigned int i=0;i<count;++i) {
-		if (ptr >= p.size) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CREDENTIALS,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-			return true;
-		}
-		Tag tag;
-		int l = tag.unmarshal(payload + ptr,(int)(p.size - ptr));
-		if (l < 0) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CREDENTIALS,ZT_TRACE_PACKET_DROP_REASON_INVALID_OBJECT);
-			return true;
-		}
-		ptr += l;
-
-		const uint64_t nwid = tag.networkId();
-		if ((!network)||(network->id() != nwid))
-			network = RR->node->network(nwid);
-		if (network) {
-			if (network->addCredential(tPtr,peer->identity(),tag) == Membership::ADD_DEFERRED_FOR_WHOIS)
-				return false;
-		}
-	}
-
-	if (ptr >= p.size)
-		return true;
-
-	count = p.pkt->rI16(ptr);
-	for(unsigned int i=0;i<count;++i) {
-		if (ptr >= p.size) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CREDENTIALS,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-			return true;
-		}
-		Revocation rev;
-		int l = rev.unmarshal(payload + ptr,(int)(p.size - ptr));
-		if (l < 0) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CREDENTIALS,ZT_TRACE_PACKET_DROP_REASON_INVALID_OBJECT);
-			return true;
-		}
-		ptr += l;
-
-		const uint64_t nwid = rev.networkId();
-		if ((!network)||(network->id() != nwid))
-			network = RR->node->network(nwid);
-		if (network) {
-			if (network->addCredential(tPtr,peer->identity(),rev) == Membership::ADD_DEFERRED_FOR_WHOIS)
-				return false;
-		}
-	}
-
-	if (ptr >= p.size)
-		return true;
-
-	count = p.pkt->rI16(ptr);
-	for(unsigned int i=0;i<count;++i) {
-		if (ptr >= p.size) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CREDENTIALS,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-			return true;
-		}
-		CertificateOfOwnership coo;
-		int l = coo.unmarshal(payload + ptr,(int)(p.size - ptr));
-		if (l < 0) {
-			RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CREDENTIALS,ZT_TRACE_PACKET_DROP_REASON_INVALID_OBJECT);
-			return true;
-		}
-		ptr += l;
-
-		const uint64_t nwid = coo.networkId();
-		if ((!network)||(network->id() != nwid))
-			network = RR->node->network(nwid);
-		if (network) {
-			if (network->addCredential(tPtr,peer->identity(),coo) == Membership::ADD_DEFERRED_FOR_WHOIS)
-				return false;
-		}
-	}
-
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_NETWORK_CREDENTIALS,0,Protocol::VERB_NOP,(network) ? network->id() : 0);
-
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doNETWORK_CONFIG_REQUEST(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	int ptr = sizeof(Protocol::Header);
-
-	const uint64_t nwid = p.pkt->rI64(ptr);
-	const unsigned int dictSize = p.pkt->rI16(ptr);
-	const uint8_t *dictData = p.pkt->rBnc(ptr,dictSize);
-	if (Buf<>::readOverflow(ptr,p.size)) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CONFIG_REQUEST,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-		return true;
-	}
-
-	if (RR->localNetworkController) {
-		Dictionary requestMetaData;
-		if ((dictSize > 0)&&(dictData)) {
-			if (!requestMetaData.decode(dictData,dictSize)) {
-				RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CONFIG_REQUEST,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-				return true;
-			}
-		}
-		RR->localNetworkController->request(nwid,(p.hops > 0) ? InetAddress::NIL : p.path->address(),Utils::ntoh(p.idBE),peer->identity(),requestMetaData);
-	} else {
-		ZT_GET_NEW_BUF(outp,Protocol::ERROR::UNSUPPORTED_OPERATION__NETWORK_CONFIG_REQUEST);
-
-		outp->data.fields.h.packetId = Protocol::getPacketId();
-		peer->address().copyTo(outp->data.fields.h.destination);
-		RR->identity.address().copyTo(outp->data.fields.h.source);
-		outp->data.fields.h.flags = 0;
-		outp->data.fields.h.verb = Protocol::VERB_OK;
-
-		outp->data.fields.eh.inReVerb = Protocol::VERB_NETWORK_CONFIG_REQUEST;
-		outp->data.fields.eh.inRePacketId = p.idBE;
-		outp->data.fields.eh.error = Protocol::ERROR_UNSUPPORTED_OPERATION;
-
-		outp->data.fields.networkId = Utils::hton(nwid);
-
-		Protocol::armor(*outp,sizeof(Protocol::ERROR::UNSUPPORTED_OPERATION__NETWORK_CONFIG_REQUEST),peer->key(),ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012);
-		p.path->send(RR,tPtr,outp->data.bytes,sizeof(Protocol::ERROR::UNSUPPORTED_OPERATION__NETWORK_CONFIG_REQUEST),RR->node->now());
-	}
-
-	// Note that NETWORK_CONFIG_REQUEST does not pertain to a network we have *joined*, but one
-	// we may control. The network ID parameter to peer->received() is therefore zero.
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_NETWORK_CONFIG_REQUEST,0,Protocol::VERB_NOP,0);
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doNETWORK_CONFIG(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	int ptr = sizeof(Protocol::Header);
-	const uint64_t nwid = p.pkt->rI64(ptr);
-	if (ptr >= (int)p.size) {
-		RR->t->incomingPacketDropped(tPtr,p.idBE,0,peer->identity(),p.path->address(),p.hops,Protocol::VERB_NETWORK_CONFIG,ZT_TRACE_PACKET_DROP_REASON_MALFORMED_PACKET);
-		return true;
-	}
-
-	const SharedPtr<Network> network(RR->node->network(nwid));
-	if (network) {
-		const uint64_t configUpdateId = network->handleConfigChunk(tPtr,p.idBE,peer,*p.pkt,ptr,(int)p.size - ptr);
-		if (configUpdateId != 0) {
-			ZT_GET_NEW_BUF(outp,Protocol::OK::NETWORK_CONFIG);
-
-			outp->data.fields.h.packetId = Protocol::getPacketId();
-			peer->address().copyTo(outp->data.fields.h.destination);
-			RR->identity.address().copyTo(outp->data.fields.h.source);
-			outp->data.fields.h.flags = 0;
-			outp->data.fields.h.verb = Protocol::VERB_OK;
-
-			outp->data.fields.oh.inReVerb = Protocol::VERB_NETWORK_CONFIG;
-			outp->data.fields.oh.inRePacketId = p.idBE;
-
-			outp->data.fields.networkId = Utils::hton(nwid);
-			outp->data.fields.configUpdateId = Utils::hton(configUpdateId);
-
-			Protocol::armor(*outp,sizeof(Protocol::OK::NETWORK_CONFIG),peer->key(),ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012);
-			p.path->send(RR,tPtr,outp->data.bytes,sizeof(Protocol::OK::NETWORK_CONFIG),RR->node->now());
-		}
-	}
-
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_NETWORK_CONFIG,0,Protocol::VERB_NOP,nwid);
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doMULTICAST_GATHER(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doPUSH_DIRECT_PATHS(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	/*
-	const int64_t now = RR->node->now();
-
-	if (peer->rateGateInboundPushDirectPaths(now)) {
-		uint8_t countPerScope[ZT_INETADDRESS_MAX_SCOPE+1][2]; // [][0] is v4, [][1] is v6
-		memset(countPerScope,0,sizeof(countPerScope));
-
-		unsigned int count = pkt.at<uint16_t>(ZT_PACKET_IDX_PAYLOAD);
-		unsigned int ptr = ZT_PACKET_IDX_PAYLOAD + 2;
-
-		while (count--) {
-			// unsigned int flags = (*this)[ptr++];
-			++ptr;
-			unsigned int extLen = pkt.at<uint16_t>(ptr); ptr += 2;
-			ptr += extLen; // unused right now
-			unsigned int addrType = pkt[ptr++];
-			unsigned int addrLen = pkt[ptr++];
-
-			switch(addrType) {
-				case 4: {
-					const InetAddress a(pkt.field(ptr,4),4,pkt.at<uint16_t>(ptr + 4));
-					if (peer->shouldTryPath(tPtr,now,peer,a)) {
-						if (++countPerScope[(int)a.ipScope()][0] <= ZT_PUSH_DIRECT_PATHS_MAX_PER_SCOPE_AND_FAMILY) {
-							RR->node->putPacket(tPtr,path->localSocket(),a,(const void *)&junk,sizeof(junk),2); // IPv4 "firewall opener"
-							++junk;
-							peer->sendHELLO(tPtr,-1,a,now);
-							RR->t->tryingNewPath(tPtr,peer->identity(),a,path->address(),pkt.packetId(),Packet::VERB_PUSH_DIRECT_PATHS,peer->address(),peer->identity().hash(),ZT_TRACE_TRYING_NEW_PATH_REASON_RECEIVED_PUSH_DIRECT_PATHS);
-						}
-					}
-				}	break;
-				case 6: {
-					const InetAddress a(pkt.field(ptr,16),16,pkt.at<uint16_t>(ptr + 16));
-					if (peer->shouldTryPath(tPtr,now,peer,a)) {
-						if (++countPerScope[(int)a.ipScope()][1] <= ZT_PUSH_DIRECT_PATHS_MAX_PER_SCOPE_AND_FAMILY) {
-							peer->sendHELLO(tPtr,-1,a,now);
-							RR->t->tryingNewPath(tPtr,peer->identity(),a,path->address(),pkt.packetId(),Packet::VERB_PUSH_DIRECT_PATHS,peer->address(),peer->identity().hash(),ZT_TRACE_TRYING_NEW_PATH_REASON_RECEIVED_PUSH_DIRECT_PATHS);
-						}
-					}
-				}	break;
-			}
-
-			ptr += addrLen;
-		}
-	}
-
-	peer->received(tPtr,path,pkt.hops(),pkt.packetId(),pkt.payloadLength(),Packet::VERB_PUSH_DIRECT_PATHS,0,Packet::VERB_NOP,0);
-*/
-	return true;
-}
-
-ZT_ALWAYS_INLINE bool _doUSER_MESSAGE(IncomingPacket &p,const RuntimeEnvironment *const RR,void *const tPtr,const SharedPtr<Peer> &peer)
-{
-	ZT_UserMessage um;
-	int ptr = sizeof(Protocol::Header);
-	um.id = reinterpret_cast<const ZT_Identity *>(&(peer->identity()));
-	um.typeId = p.pkt->rI64(ptr);
-	int ds = (int)p.size - ptr;
-	if (ds > 0) {
-		um.data = p.pkt->data.bytes + ptr;
-		um.length = (unsigned int)ds;
-		RR->node->postEvent(tPtr,ZT_EVENT_USER_MESSAGE,reinterpret_cast<const void *>(&um));
-	}
-	peer->received(tPtr,p.path,p.hops,p.idBE,p.size,Protocol::VERB_USER_MESSAGE,0,Protocol::VERB_NOP,0);
-	return true;
-}
-
-//////////////////////////////////////////////////////////////////////////////
-} // anonymous namespace
-
-bool IncomingPacket::tryDecode(const RuntimeEnvironment *RR,void *tPtr)
-{
-	const Address source(pkt->data.fields.source);
-	const SharedPtr<Peer> peer(RR->topology->get(tPtr,source));
-
-	try {
-		// Check for trusted paths or unencrypted HELLOs (HELLO is the only packet sent in the clear)
-		const uint8_t c = Protocol::packetCipher(pkt->data.fields);
-		bool trusted = false;
-		if (c == ZT_PROTO_CIPHER_SUITE__NONE) {
-			// If this is marked as a packet via a trusted path, check source address and path ID.
-			// Obviously if no trusted paths are configured this always returns false and such
-			// packets are dropped on the floor.
-			const uint64_t tpid = Utils::ntoh(pkt->data.fields.mac); // the MAC is the trusted path ID on these packets
-			if (RR->topology->shouldInboundPathBeTrusted(path->address(),tpid)) {
-				trusted = true;
-			} else {
-				if (peer)
-					RR->t->incomingPacketDropped(tPtr,idBE,0,peer->identity(),path->address(),hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_MAC_FAILED);
-				return true;
-			}
-		} else if ((c == ZT_PROTO_CIPHER_SUITE__POLY1305_NONE)&&(pkt->data.fields.verb == Protocol::VERB_HELLO)) {
-			// Only HELLO is allowed in the clear, but the MAC is still checked in _doHELLO().
-			return _doHELLO(*this,RR,tPtr,false);
-		}
-
-		if (!peer) {
-			RR->sw->requestWhois(tPtr,RR->node->now(),source);
-			return false;
-		}
-
-		if (!trusted) {
-			if (!dearmor(peer->key())) {
-				RR->t->incomingPacketDropped(tPtr,idBE,0,peer->identity(),path->address(),hops,Protocol::VERB_NOP,ZT_TRACE_PACKET_DROP_REASON_MAC_FAILED);
-				return true;
-			}
-		}
-
-		if (!uncompress()) {
-			RR->t->incomingPacketDropped(tPtr,idBE,0,peer->identity(),path->address(),hops,Protocol::VERB_NOP,ZT_TRACE_PACKET_DROP_REASON_INVALID_COMPRESSED_DATA);
-			return true;
-		}
-
-		const Protocol::Verb verb = (Protocol::Verb)pkt->data.fields.verb;
-		bool r = true;
-		switch(verb) {
-			default: // ignore unknown verbs, but if they pass auth check they are "received" and considered NOPs by peer->receive()
-				RR->t->incomingPacketDropped(tPtr,idBE,0,peer->identity(),path->address(),hops,verb,ZT_TRACE_PACKET_DROP_REASON_UNRECOGNIZED_VERB);
-				// fall through
-			case Protocol::VERB_NOP:
-				peer->received(tPtr,path,hops,idBE,size,Protocol::VERB_NOP,0,Protocol::VERB_NOP,0);
-				break;
-			case Protocol::VERB_HELLO:                      r = _doHELLO(*this,RR,tPtr,true);                  break;
-			case Protocol::VERB_ERROR:                      r = _doERROR(*this,RR,tPtr,peer);                  break;
-			case Protocol::VERB_OK:                         r = _doOK(*this,RR,tPtr,peer);                     break;
-			case Protocol::VERB_WHOIS:                      r = _doWHOIS(*this,RR,tPtr,peer);                  break;
-			case Protocol::VERB_RENDEZVOUS:                 r = _doRENDEZVOUS(*this,RR,tPtr,peer);             break;
-			case Protocol::VERB_FRAME:                      r = _doFRAME(*this,RR,tPtr,peer);                  break;
-			case Protocol::VERB_EXT_FRAME:                  r = _doEXT_FRAME(*this,RR,tPtr,peer);              break;
-			case Protocol::VERB_ECHO:                       r = _doECHO(*this,RR,tPtr,peer);                   break;
-			case Protocol::VERB_NETWORK_CREDENTIALS:        r = _doNETWORK_CREDENTIALS(*this,RR,tPtr,peer);    break;
-			case Protocol::VERB_NETWORK_CONFIG_REQUEST:     r = _doNETWORK_CONFIG_REQUEST(*this,RR,tPtr,peer); break;
-			case Protocol::VERB_NETWORK_CONFIG:             r = _doNETWORK_CONFIG(*this,RR,tPtr,peer);         break;
-			case Protocol::VERB_MULTICAST_GATHER:           r = _doMULTICAST_GATHER(*this,RR,tPtr,peer);       break;
-			case Protocol::VERB_PUSH_DIRECT_PATHS:          r = _doPUSH_DIRECT_PATHS(*this,RR,tPtr,peer);      break;
-			case Protocol::VERB_USER_MESSAGE:               r = _doUSER_MESSAGE(*this,RR,tPtr,peer);           break;
-		}
-		return r;
-	} catch (int ztExcCode) {
-	} catch ( ... ) {}
-
-	if (peer)
-		RR->t->incomingPacketDropped(tPtr,idBE,0,peer->identity(),path->address(),hops,Protocol::VERB_HELLO,ZT_TRACE_PACKET_DROP_REASON_UNSPECIFIED);
-	return true;
-}
-
-} // namespace ZeroTier

attic/IncomingPacket.hpp

@@ -1,109 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#ifndef ZT_INCOMINGPACKET_HPP
-#define ZT_INCOMINGPACKET_HPP
-
-#include "Path.hpp"
-#include "Utils.hpp"
-#include "MulticastGroup.hpp"
-#include "Peer.hpp"
-#include "Buf.hpp"
-#include "Protocol.hpp"
-
-/*
- * The big picture:
- *
- * tryDecode gets called for a given fully-assembled packet until it returns
- * true or the packet's time to live has been exceeded, in which case it is
- * discarded as failed decode. Any exception thrown by tryDecode also causes
- * the packet to be discarded.
- *
- * Thus a return of false from tryDecode() indicates that it should be called
- * again. Logic is very simple as to when, and it's in doAnythingWaitingForPeer
- * in Switch. This might be expanded to be more fine grained in the future.
- *
- * A return value of true indicates that the packet is done. tryDecode must
- * never be called again after that.
- */
-
-namespace ZeroTier {
-
-class RuntimeEnvironment;
-class Network;
-
-class IncomingPacket
-{
-public:
-	ZT_ALWAYS_INLINE IncomingPacket() {}
-
-	template<typename X>
-	ZT_ALWAYS_INLINE void set(const SharedPtr< Buf<X> > &pkt_,const unsigned int pktSize_,const SharedPtr<Path> &path_,const int64_t now_)
-	{
-		idBE = 0; // initially zero, set when decryption/auth occurs
-		receiveTime = now_;
-		path = path_;
-		pkt = reinterpret_cast< SharedPtr< Buf< Protocol::Header > > >(pkt_);
-		size = pktSize_;
-		hops = Protocol::packetHops(pkt->data.fields);
-	}
-
-	/**
-	 * Attempt to decode this packet
-	 *
-	 * Note that this returns 'true' if processing is complete. This says nothing
-	 * about whether the packet was valid. A rejection is 'complete.'
-	 *
-	 * Once true is returned, this must not be called again. The packet's state
-	 * may no longer be valid.
-	 *
-	 * @param RR Runtime environment
-	 * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
-	 * @return True if decoding and processing is complete, false if caller should try again
-	 */
-	bool tryDecode(const RuntimeEnvironment *RR,void *tPtr);
-
-	/**
-	 * Packet ID in big-endian byte order or 0 if not decrypted/dearmored yet
-	 */
-	uint64_t idBE;
-
-	/**
-	 * Time packet was received
-	 */
-	int64_t receiveTime;
-
-	/**
-	 * Path over which packet was received
-	 */
-	SharedPtr< Path > path;
-
-	/**
-	 * Packet itself
-	 */
-	SharedPtr< Buf< Protocol::Header > > pkt;
-
-	/**
-	 * Size of packet in bytes
-	 */
-	unsigned int size;
-
-	/**
-	 * Hop count for received packet
-	 */
-	uint8_t hops;
-};
-
-} // namespace ZeroTier
-
-#endif

attic/MIMC52.hpp

@@ -1,44 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#ifndef ZT_MIMC52_HPP
-#define ZT_MIMC52_HPP
-
-#include "Constants.hpp"
-
-namespace ZeroTier {
-
-/**
- * Compute a number of rounds of the MIMC52 verifiable delay function
- *
- * @param salt Input salt
- * @param saltSize Size of salt in bytes
- * @param rounds Number of rounds to compute
- * @return Proof that rounds were computed (proof of CPU cycles spent)
- */
-uint64_t mimc52Delay(const void *salt,unsigned int saltSize,unsigned long rounds);
-
-/**
- * Verify a MIMC52 proof of work
- *
- * @param salt Original input salt
- * @param saltSize Size of salt in bytes
- * @param rounds Number of rounds originally computed
- * @param proof Proof to verify (most significant 12 bits are ignored)
- * @return True if proof is valid
- */
-bool mimc52Verify(const void *salt,unsigned int saltSize,unsigned long rounds,uint64_t proof);
-
-} // namespace ZeroTier
-
-#endif

attic/ManagedRoute.cpp

@@ -1,558 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#include "../node/Constants.hpp"
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#ifdef __WINDOWS__
-#include <WinSock2.h>
-#include <Windows.h>
-#include <netioapi.h>
-#include <IPHlpApi.h>
-#endif
-
-#ifdef __UNIX_LIKE__
-#include <unistd.h>
-#include <sys/param.h>
-#include <sys/socket.h>
-#include <sys/types.h>
-#include <sys/wait.h>
-#include <netinet/in.h>
-#include <arpa/inet.h>
-#ifndef ZT_SDK
-#include <net/route.h>
-#endif
-#include <net/if.h>
-#ifdef __BSD__
-#include <net/if_dl.h>
-#include <sys/sysctl.h>
-#endif
-#include <ifaddrs.h>
-#endif
-
-#include <vector>
-#include <algorithm>
-#include <utility>
-
-#include "ManagedRoute.hpp"
-
-#define ZT_BSD_ROUTE_CMD "/sbin/route"
-#define ZT_LINUX_IP_COMMAND "/sbin/ip"
-#define ZT_LINUX_IP_COMMAND_2 "/usr/sbin/ip"
-
-namespace ZeroTier {
-
-namespace {
-
-// Fork a target into two more specific targets e.g. 0.0.0.0/0 -> 0.0.0.0/1, 128.0.0.0/1
-// If the target is already maximally-specific, 'right' will be unchanged and 'left' will be 't'
-static void _forkTarget(const InetAddress &t,InetAddress &left,InetAddress &right)
-{
-	const unsigned int bits = t.netmaskBits() + 1;
-	left = t;
-	if (t.ss_family == AF_INET) {
-		if (bits <= 32) {
-			left.setPort(bits);
-			right = t;
-			reinterpret_cast<struct sockaddr_in *>(&right)->sin_addr.s_addr ^= Utils::hton((uint32_t)(1 << (32 - bits)));
-			right.setPort(bits);
-		} else {
-			right.zero();
-		}
-	} else if (t.ss_family == AF_INET6) {
-		if (bits <= 128) {
-			left.setPort(bits);
-			right = t;
-			uint8_t *b = reinterpret_cast<uint8_t *>(reinterpret_cast<struct sockaddr_in6 *>(&right)->sin6_addr.s6_addr);
-			b[bits / 8] ^= 1 << (8 - (bits % 8));
-			right.setPort(bits);
-		} else {
-			right.zero();
-		}
-	}
-}
-
-struct _RTE
-{
-	InetAddress target;
-	InetAddress via;
-	char device[128];
-	int metric;
-	bool ifscope;
-};
-
-#ifdef __BSD__ // ------------------------------------------------------------
-#define ZT_ROUTING_SUPPORT_FOUND 1
-
-#ifndef ZT_SDK
-static std::vector<_RTE> _getRTEs(const InetAddress &target,bool contains)
-{
-	std::vector<_RTE> rtes;
-	int mib[6];
-	size_t needed;
-
-	mib[0] = CTL_NET;
-	mib[1] = PF_ROUTE;
-	mib[2] = 0;
-	mib[3] = 0;
-	mib[4] = NET_RT_DUMP;
-	mib[5] = 0;
-	if (!sysctl(mib,6,NULL,&needed,NULL,0)) {
-		if (needed <= 0)
-			return rtes;
-
-		char *buf = (char *)::malloc(needed);
-		if (buf) {
-			if (!sysctl(mib,6,buf,&needed,NULL,0)) {
-		    struct rt_msghdr *rtm;
-				for(char *next=buf,*end=buf+needed;next<end;) {
-					rtm = (struct rt_msghdr *)next;
-					char *saptr = (char *)(rtm + 1);
-					char *saend = next + rtm->rtm_msglen;
-
-					InetAddress sa_t,sa_v;
-					int deviceIndex = -9999;
-
-					if (((rtm->rtm_flags & RTF_LLINFO) == 0)&&((rtm->rtm_flags & RTF_HOST) == 0)&&((rtm->rtm_flags & RTF_UP) != 0)&&((rtm->rtm_flags & RTF_MULTICAST) == 0)) {
-						int which = 0;
-						while (saptr < saend) {
-							struct sockaddr *sa = (struct sockaddr *)saptr;
-							unsigned int salen = sa->sa_len;
-							if (!salen)
-								break;
-
-							// Skip missing fields in rtm_addrs bit field
-							while ((rtm->rtm_addrs & 1) == 0) {
-								rtm->rtm_addrs >>= 1;
-								++which;
-								if (which > 6)
-									break;
-							}
-							if (which > 6)
-								break;
-
-							rtm->rtm_addrs >>= 1;
-							switch(which++) {
-								case 0:
-									//printf("RTA_DST\n");
-									if (sa->sa_family == AF_INET6) {
-										struct sockaddr_in6 *sin6 = (struct sockaddr_in6 *)sa;
-										if ((sin6->sin6_addr.s6_addr[0] == 0xfe)&&((sin6->sin6_addr.s6_addr[1] & 0xc0) == 0x80)) {
-											// BSD uses this fucking strange in-band signaling method to encode device scope IDs for IPv6 addresses... probably a holdover from very early versions of the spec.
-											unsigned int interfaceIndex = ((((unsigned int)sin6->sin6_addr.s6_addr[2]) << 8) & 0xff) | (((unsigned int)sin6->sin6_addr.s6_addr[3]) & 0xff);
-											sin6->sin6_addr.s6_addr[2] = 0;
-											sin6->sin6_addr.s6_addr[3] = 0;
-											if (!sin6->sin6_scope_id)
-												sin6->sin6_scope_id = interfaceIndex;
-										}
-									}
-									sa_t = *sa;
-									break;
-								case 1:
-									//printf("RTA_GATEWAY\n");
-									switch(sa->sa_family) {
-										case AF_LINK:
-											deviceIndex = (int)((const struct sockaddr_dl *)sa)->sdl_index;
-											break;
-										case AF_INET:
-										case AF_INET6:
-											sa_v = *sa;
-											break;
-									}
-									break;
-								case 2: {
-									//printf("RTA_NETMASK\n");
-									if (sa_t.ss_family == AF_INET6) {
-										salen = sizeof(struct sockaddr_in6);
-										unsigned int bits = 0;
-										for(int i=0;i<16;++i) {
-											unsigned char c = (unsigned char)((const struct sockaddr_in6 *)sa)->sin6_addr.s6_addr[i];
-											if (c == 0xff)
-												bits += 8;
-											else break;
-										}
-										sa_t.setPort(bits);
-									} else if (sa_t.ss_family == AF_INET) {
-										salen = sizeof(struct sockaddr_in);
-										sa_t.setPort((unsigned int)Utils::countBits((uint32_t)((const struct sockaddr_in *)sa)->sin_addr.s_addr));
-									}
-								}	break;
-								/*
-								case 3:
-									//printf("RTA_GENMASK\n");
-									break;
-								case 4:
-									//printf("RTA_IFP\n");
-									break;
-								case 5:
-									//printf("RTA_IFA\n");
-									break;
-								case 6:
-									//printf("RTA_AUTHOR\n");
-									break;
-								*/
-							}
-
-							saptr += salen;
-						}
-
-						if (((contains)&&(sa_t.containsAddress(target)))||(sa_t == target)) {
-							rtes.push_back(_RTE());
-							rtes.back().target = sa_t;
-							rtes.back().via = sa_v;
-							if (deviceIndex >= 0) {
-								if_indextoname(deviceIndex,rtes.back().device);
-							} else {
-								rtes.back().device[0] = (char)0;
-							}
-							rtes.back().metric = ((int)rtm->rtm_rmx.rmx_hopcount < 0) ? 0 : (int)rtm->rtm_rmx.rmx_hopcount;
-						}
-					}
-
-					next = saend;
-				}
-			}
-
-			::free(buf);
-		}
-	}
-
-	return rtes;
-}
-#endif
-
-static void _routeCmd(const char *op,const InetAddress &target,const InetAddress &via,const char *ifscope,const char *localInterface)
-{
-	//char f1[1024],f2[1024]; printf("%s %s %s %s %s\n",op,target.toString(f1),via.toString(f2),ifscope,localInterface);
-	long p = (long)fork();
-	if (p > 0) {
-		int exitcode = -1;
-		::waitpid(p,&exitcode,0);
-	} else if (p == 0) {
-		::close(STDOUT_FILENO);
-		::close(STDERR_FILENO);
-		char ttmp[64];
-		char iptmp[64];
-		if (via) {
-			if ((ifscope)&&(ifscope[0])) {
-				::execl(ZT_BSD_ROUTE_CMD,ZT_BSD_ROUTE_CMD,op,"-ifscope",ifscope,((target.ss_family == AF_INET6) ? "-inet6" : "-inet"),target.toString(ttmp),via.toIpString(iptmp),(const char *)0);
-			} else {
-				::execl(ZT_BSD_ROUTE_CMD,ZT_BSD_ROUTE_CMD,op,((target.ss_family == AF_INET6) ? "-inet6" : "-inet"),target.toString(ttmp),via.toIpString(iptmp),(const char *)0);
-			}
-		} else if ((localInterface)&&(localInterface[0])) {
-			if ((ifscope)&&(ifscope[0])) {
-				::execl(ZT_BSD_ROUTE_CMD,ZT_BSD_ROUTE_CMD,op,"-ifscope",ifscope,((target.ss_family == AF_INET6) ? "-inet6" : "-inet"),target.toString(ttmp),"-interface",localInterface,(const char *)0);
-			} else {
-				::execl(ZT_BSD_ROUTE_CMD,ZT_BSD_ROUTE_CMD,op,((target.ss_family == AF_INET6) ? "-inet6" : "-inet"),target.toString(ttmp),"-interface",localInterface,(const char *)0);
-			}
-		}
-		::_exit(-1);
-	}
-}
-
-#endif // __BSD__ ------------------------------------------------------------
-
-#ifdef __LINUX__ // ----------------------------------------------------------
-#define ZT_ROUTING_SUPPORT_FOUND 1
-
-static void _routeCmd(const char *op,const InetAddress &target,const InetAddress &via,const char *localInterface)
-{
-	long p = (long)fork();
-	if (p > 0) {
-		int exitcode = -1;
-		::waitpid(p,&exitcode,0);
-	} else if (p == 0) {
-		::close(STDOUT_FILENO);
-		::close(STDERR_FILENO);
-		char ipbuf[64],ipbuf2[64];
-		if (via) {
-			::execl(ZT_LINUX_IP_COMMAND,ZT_LINUX_IP_COMMAND,(target.ss_family == AF_INET6) ? "-6" : "-4","route",op,target.toString(ipbuf),"via",via.toIpString(ipbuf2),(const char *)0);
-			::execl(ZT_LINUX_IP_COMMAND_2,ZT_LINUX_IP_COMMAND_2,(target.ss_family == AF_INET6) ? "-6" : "-4","route",op,target.toString(ipbuf),"via",via.toIpString(ipbuf2),(const char *)0);
-		} else if ((localInterface)&&(localInterface[0])) {
-			::execl(ZT_LINUX_IP_COMMAND,ZT_LINUX_IP_COMMAND,(target.ss_family == AF_INET6) ? "-6" : "-4","route",op,target.toString(ipbuf),"dev",localInterface,(const char *)0);
-			::execl(ZT_LINUX_IP_COMMAND_2,ZT_LINUX_IP_COMMAND_2,(target.ss_family == AF_INET6) ? "-6" : "-4","route",op,target.toString(ipbuf),"dev",localInterface,(const char *)0);
-		}
-		::_exit(-1);
-	}
-}
-
-#endif // __LINUX__ ----------------------------------------------------------
-
-#ifdef __WINDOWS__ // --------------------------------------------------------
-#define ZT_ROUTING_SUPPORT_FOUND 1
-
-static bool _winRoute(bool del,const NET_LUID &interfaceLuid,const NET_IFINDEX &interfaceIndex,const InetAddress &target,const InetAddress &via)
-{
-	MIB_IPFORWARD_ROW2 rtrow;
-	InitializeIpForwardEntry(&rtrow);
-	rtrow.InterfaceLuid.Value = interfaceLuid.Value;
-	rtrow.InterfaceIndex = interfaceIndex;
-	if (target.ss_family == AF_INET) {
-		rtrow.DestinationPrefix.Prefix.si_family = AF_INET;
-		rtrow.DestinationPrefix.Prefix.Ipv4.sin_family = AF_INET;
-		rtrow.DestinationPrefix.Prefix.Ipv4.sin_addr.S_un.S_addr = reinterpret_cast<const struct sockaddr_in *>(&target)->sin_addr.S_un.S_addr;
-		if (via.ss_family == AF_INET) {
-			rtrow.NextHop.si_family = AF_INET;
-			rtrow.NextHop.Ipv4.sin_family = AF_INET;
-			rtrow.NextHop.Ipv4.sin_addr.S_un.S_addr = reinterpret_cast<const struct sockaddr_in *>(&via)->sin_addr.S_un.S_addr;
-		}
-	} else if (target.ss_family == AF_INET6) {
-		rtrow.DestinationPrefix.Prefix.si_family = AF_INET6;
-		rtrow.DestinationPrefix.Prefix.Ipv6.sin6_family = AF_INET6;
-		memcpy(rtrow.DestinationPrefix.Prefix.Ipv6.sin6_addr.u.Byte,reinterpret_cast<const struct sockaddr_in6 *>(&target)->sin6_addr.u.Byte,16);
-		if (via.ss_family == AF_INET6) {
-			rtrow.NextHop.si_family = AF_INET6;
-			rtrow.NextHop.Ipv6.sin6_family = AF_INET6;
-			memcpy(rtrow.NextHop.Ipv6.sin6_addr.u.Byte,reinterpret_cast<const struct sockaddr_in6 *>(&via)->sin6_addr.u.Byte,16);
-		}
-	} else {
-		return false;
-	}
-	rtrow.DestinationPrefix.PrefixLength = target.netmaskBits();
-	rtrow.SitePrefixLength = rtrow.DestinationPrefix.PrefixLength;
-	rtrow.ValidLifetime = 0xffffffff;
-	rtrow.PreferredLifetime = 0xffffffff;
-	rtrow.Metric = -1;
-	rtrow.Protocol = MIB_IPPROTO_NETMGMT;
-	rtrow.Loopback = FALSE;
-	rtrow.AutoconfigureAddress = FALSE;
-	rtrow.Publish = FALSE;
-	rtrow.Immortal = FALSE;
-	rtrow.Age = 0;
-	rtrow.Origin = NlroManual;
-	if (del) {
-		return (DeleteIpForwardEntry2(&rtrow) == NO_ERROR);
-	} else {
-		NTSTATUS r = CreateIpForwardEntry2(&rtrow);
-		if (r == NO_ERROR) {
-			return true;
-		} else if (r == ERROR_OBJECT_ALREADY_EXISTS) {
-			return (SetIpForwardEntry2(&rtrow) == NO_ERROR);
-		} else {
-			return false;
-		}
-	}
-}
-
-static bool _winHasRoute(const NET_LUID &interfaceLuid, const NET_IFINDEX &interfaceIndex, const InetAddress &target, const InetAddress &via)
-{
-	MIB_IPFORWARD_ROW2 rtrow;
-	InitializeIpForwardEntry(&rtrow);
-	rtrow.InterfaceLuid.Value = interfaceLuid.Value;
-	rtrow.InterfaceIndex = interfaceIndex;
-	if (target.ss_family == AF_INET) {
-		rtrow.DestinationPrefix.Prefix.si_family = AF_INET;
-		rtrow.DestinationPrefix.Prefix.Ipv4.sin_family = AF_INET;
-		rtrow.DestinationPrefix.Prefix.Ipv4.sin_addr.S_un.S_addr = reinterpret_cast<const struct sockaddr_in *>(&target)->sin_addr.S_un.S_addr;
-		if (via.ss_family == AF_INET) {
-			rtrow.NextHop.si_family = AF_INET;
-			rtrow.NextHop.Ipv4.sin_family = AF_INET;
-			rtrow.NextHop.Ipv4.sin_addr.S_un.S_addr = reinterpret_cast<const struct sockaddr_in *>(&via)->sin_addr.S_un.S_addr;
-		}
-	} else if (target.ss_family == AF_INET6) {
-		rtrow.DestinationPrefix.Prefix.si_family = AF_INET6;
-		rtrow.DestinationPrefix.Prefix.Ipv6.sin6_family = AF_INET6;
-		memcpy(rtrow.DestinationPrefix.Prefix.Ipv6.sin6_addr.u.Byte, reinterpret_cast<const struct sockaddr_in6 *>(&target)->sin6_addr.u.Byte, 16);
-		if (via.ss_family == AF_INET6) {
-			rtrow.NextHop.si_family = AF_INET6;
-			rtrow.NextHop.Ipv6.sin6_family = AF_INET6;
-			memcpy(rtrow.NextHop.Ipv6.sin6_addr.u.Byte, reinterpret_cast<const struct sockaddr_in6 *>(&via)->sin6_addr.u.Byte, 16);
-		}
-	} else {
-		return false;
-	}
-	rtrow.DestinationPrefix.PrefixLength = target.netmaskBits();
-	rtrow.SitePrefixLength = rtrow.DestinationPrefix.PrefixLength;
-	return (GetIpForwardEntry2(&rtrow) == NO_ERROR);
-}
-
-#endif // __WINDOWS__ --------------------------------------------------------
-
-#ifndef ZT_ROUTING_SUPPORT_FOUND
-#error "ManagedRoute.cpp has no support for managing routes on this platform! You'll need to check and see if one of the existing ones will work and make sure proper defines are set, or write one. Please do a GitHub pull request if you do this for a new OS."
-#endif
-
-} // anonymous namespace
-
-/* Linux NOTE: for default route override, some Linux distributions will
- * require a change to the rp_filter parameter. A value of '1' will prevent
- * default route override from working properly.
- *
- * sudo sysctl -w net.ipv4.conf.all.rp_filter=2
- *
- * Add to /etc/sysctl.conf or /etc/sysctl.d/... to make permanent.
- *
- * This is true of CentOS/RHEL 6+ and possibly others. This is because
- * Linux default route override implies asymmetric routes, which then
- * trigger Linux's "martian packet" filter. */
-
-#ifndef ZT_SDK
-bool ManagedRoute::sync()
-{
-#ifdef __WINDOWS__
-	NET_LUID interfaceLuid;
-	interfaceLuid.Value = (ULONG64)Utils::hexStrToU64(_device); // on Windows we use the hex LUID as the "interface name" for ManagedRoute
-	NET_IFINDEX interfaceIndex = -1;
-	if (ConvertInterfaceLuidToIndex(&interfaceLuid,&interfaceIndex) != NO_ERROR)
-		return false;
-#endif
-
-	InetAddress leftt,rightt;
-	if (_target.netmaskBits() == 0) // bifurcate only the default route
-		_forkTarget(_target,leftt,rightt);
-	else leftt = _target;
-
-#ifdef __BSD__ // ------------------------------------------------------------
-
-	// Find lowest metric system route that this route should override (if any)
-	InetAddress newSystemVia;
-	char newSystemDevice[128];
-	newSystemDevice[0] = (char)0;
-	int systemMetric = 9999999;
-	std::vector<_RTE> rtes(_getRTEs(_target,false));
-	for(std::vector<_RTE>::iterator r(rtes.begin());r!=rtes.end();++r) {
-		if (r->via) {
-			if ( ((!newSystemVia)||(r->metric < systemMetric)) && (strcmp(r->device,_device) != 0) ) {
-				newSystemVia = r->via;
-				Utils::scopy(newSystemDevice,sizeof(newSystemDevice),r->device);
-				systemMetric = r->metric;
-			}
-		}
-	}
-
-	// Get device corresponding to route if we don't have that already
-	if ((newSystemVia)&&(!newSystemDevice[0])) {
-		rtes = _getRTEs(newSystemVia,true);
-		for(std::vector<_RTE>::iterator r(rtes.begin());r!=rtes.end();++r) {
-			if ( (r->device[0]) && (strcmp(r->device,_device) != 0) ) {
-				Utils::scopy(newSystemDevice,sizeof(newSystemDevice),r->device);
-				break;
-			}
-		}
-	}
-	if (!newSystemDevice[0])
-		newSystemVia.zero();
-
-	// Shadow system route if it exists, also delete any obsolete shadows
-	// and replace them with the new state. sync() is called periodically to
-	// allow us to do that if underlying connectivity changes.
-	if ((_systemVia != newSystemVia)||(strcmp(_systemDevice,newSystemDevice) != 0)) {
-		if (_systemVia) {
-			_routeCmd("delete",leftt,_systemVia,_systemDevice,(const char *)0);
-			if (rightt)
-				_routeCmd("delete",rightt,_systemVia,_systemDevice,(const char *)0);
-		}
-
-		_systemVia = newSystemVia;
-		Utils::scopy(_systemDevice,sizeof(_systemDevice),newSystemDevice);
-
-		if (_systemVia) {
-			_routeCmd("add",leftt,_systemVia,_systemDevice,(const char *)0);
-			_routeCmd("change",leftt,_systemVia,_systemDevice,(const char *)0);
-			if (rightt) {
-				_routeCmd("add",rightt,_systemVia,_systemDevice,(const char *)0);
-				_routeCmd("change",rightt,_systemVia,_systemDevice,(const char *)0);
-			}
-		}
-	}
-
-	if (!_applied.count(leftt)) {
-		_applied[leftt] = false; // not ifscoped
-		_routeCmd("add",leftt,_via,(const char *)0,(_via) ? (const char *)0 : _device);
-		_routeCmd("change",leftt,_via,(const char *)0,(_via) ? (const char *)0 : _device);
-	}
-	if ((rightt)&&(!_applied.count(rightt))) {
-		_applied[rightt] = false; // not ifscoped
-		_routeCmd("add",rightt,_via,(const char *)0,(_via) ? (const char *)0 : _device);
-		_routeCmd("change",rightt,_via,(const char *)0,(_via) ? (const char *)0 : _device);
-	}
-
-#endif // __BSD__ ------------------------------------------------------------
-
-#ifdef __LINUX__ // ----------------------------------------------------------
-
-	if (!_applied.count(leftt)) {
-		_applied[leftt] = false; // boolean unused
-		_routeCmd("replace",leftt,_via,(_via) ? (const char *)0 : _device);
-	}
-	if ((rightt)&&(!_applied.count(rightt))) {
-		_applied[rightt] = false; // boolean unused
-		_routeCmd("replace",rightt,_via,(_via) ? (const char *)0 : _device);
-	}
-
-#endif // __LINUX__ ----------------------------------------------------------
-
-#ifdef __WINDOWS__ // --------------------------------------------------------
-
-	if ( (!_applied.count(leftt)) || (!_winHasRoute(interfaceLuid,interfaceIndex,leftt,_via)) ) {
-		_applied[leftt] = false; // boolean unused
-		_winRoute(false,interfaceLuid,interfaceIndex,leftt,_via);
-	}
-	if ( (rightt) && ( (!_applied.count(rightt)) || (!_winHasRoute(interfaceLuid,interfaceIndex,rightt,_via)) ) ) {
-		_applied[rightt] = false; // boolean unused
-		_winRoute(false,interfaceLuid,interfaceIndex,rightt,_via);
-	}
-
-#endif // __WINDOWS__ --------------------------------------------------------
-
-	return true;
-}
-#endif
-
-void ManagedRoute::remove()
-{
-#ifdef __WINDOWS__
-	NET_LUID interfaceLuid;
-	interfaceLuid.Value = (ULONG64)Utils::hexStrToU64(_device); // on Windows we use the hex LUID as the "interface name" for ManagedRoute
-	NET_IFINDEX interfaceIndex = -1;
-	if (ConvertInterfaceLuidToIndex(&interfaceLuid,&interfaceIndex) != NO_ERROR)
-		return;
-#endif
-
-#ifdef __BSD__
-	if (_systemVia) {
-		InetAddress leftt,rightt;
-		_forkTarget(_target,leftt,rightt);
-		_routeCmd("delete",leftt,_systemVia,_systemDevice,(const char *)0);
-		if (rightt)
-			_routeCmd("delete",rightt,_systemVia,_systemDevice,(const char *)0);
-	}
-#endif // __BSD__ ------------------------------------------------------------
-
-	for(std::map<InetAddress,bool>::iterator r(_applied.begin());r!=_applied.end();++r) {
-#ifdef __BSD__ // ------------------------------------------------------------
-		_routeCmd("delete",r->first,_via,r->second ? _device : (const char *)0,(_via) ? (const char *)0 : _device);
-#endif // __BSD__ ------------------------------------------------------------
-
-#ifdef __LINUX__ // ----------------------------------------------------------
-		_routeCmd("del",r->first,_via,(_via) ? (const char *)0 : _device);
-#endif // __LINUX__ ----------------------------------------------------------
-
-#ifdef __WINDOWS__ // --------------------------------------------------------
-		_winRoute(true,interfaceLuid,interfaceIndex,r->first,_via);
-#endif // __WINDOWS__ --------------------------------------------------------
-	}
-
-	_target.zero();
-	_via.zero();
-	_systemVia.zero();
-	_device[0] = (char)0;
-	_systemDevice[0] = (char)0;
-	_applied.clear();
-}
-
-} // namespace ZeroTier

attic/ManagedRoute.hpp

@@ -1,91 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#ifndef ZT_MANAGEDROUTE_HPP
-#define ZT_MANAGEDROUTE_HPP
-
-#include "../node/InetAddress.hpp"
-#include "../node/Utils.hpp"
-#include "../node/SharedPtr.hpp"
-#include "../node/Atomic.hpp"
-
-#include <stdexcept>
-#include <vector>
-#include <map>
-#include <cstdlib>
-#include <cstring>
-
-namespace ZeroTier {
-
-/**
- * A ZT-managed route that used C++ RAII semantics to automatically clean itself up on deallocate
- */
-class ManagedRoute
-{
-	friend class SharedPtr<ManagedRoute>;
-
-public:
-	ZT_INLINE ManagedRoute(const InetAddress &target,const InetAddress &via,const char *device)
-	{
-		_target = target;
-		_via = via;
-		if (via.ss_family == AF_INET)
-			_via.setPort(32);
-		else if (via.ss_family == AF_INET6)
-			_via.setPort(128);
-		Utils::scopy(_device,sizeof(_device),device);
-		_systemDevice[0] = (char)0;
-	}
-
-	ZT_INLINE ~ManagedRoute() { this->remove(); }
-
-	/**
-	 * Set or update currently set route
-	 *
-	 * This must be called periodically for routes that shadow others so that
-	 * shadow routes can be updated. In some cases it has no effect
-	 *
-	 * @return True if route add/update was successful
-	 */
-	bool sync();
-
-	/**
-	 * Remove and clear this ManagedRoute
-	 *
-	 * This does nothing if this ManagedRoute is not set or has already been
-	 * removed. If this is not explicitly called it is called automatically on
-	 * destruct.
-	 */
-	void remove();
-
-	ZT_INLINE const InetAddress &target() const { return _target; }
-	ZT_INLINE const InetAddress &via() const { return _via; }
-	ZT_INLINE const char *device() const { return _device; }
-
-private:
-	ZT_INLINE ManagedRoute(const ManagedRoute &) {}
-	ZT_INLINE ManagedRoute &operator=(const ManagedRoute &) { return *this; }
-
-	InetAddress _target;
-	InetAddress _via;
-	InetAddress _systemVia; // for route overrides
-	std::map<InetAddress,bool> _applied; // routes currently applied
-	char _device[128];
-	char _systemDevice[128]; // for route overrides
-
-	Atomic<int> __refCount;
-};
-
-} // namespace ZeroTier
-
-#endif

attic/Packet.cpp

@@ -1,149 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#include <cstdint>
-#include <cstring>
-
-#include "Packet.hpp"
-#include "Mutex.hpp"
-#include "LZ4.hpp"
-
-#if defined(__GCC__) && (defined(__amd64) || defined(__amd64__) || defined(__x86_64) || defined(__x86_64__) || defined(__AMD64) || defined(__AMD64__) || defined(_M_X64))
-#define ZT_PACKET_USE_ATOMIC_INTRINSICS
-#endif
-#ifndef ZT_PACKET_USE_ATOMIC_INTRINSICS
-#include <atomic>
-#endif
-
-namespace ZeroTier {
-
-const uint8_t Packet::ZERO_KEY[32] = { 0,0,0,0,0,0,0,0,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 Packet::armor(const void *key,bool encryptPayload)
-{
-	uint8_t mangledKey[32];
-	uint8_t *const data = reinterpret_cast<uint8_t *>(unsafeData());
-
-	// Set flag now, since it affects key mangle function
-	setCipher(encryptPayload ? ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012 : ZT_PROTO_CIPHER_SUITE__POLY1305_NONE);
-
-	_salsa20MangleKey((const unsigned char *)key,mangledKey);
-
-	Salsa20 s20(mangledKey,data + ZT_PACKET_IDX_IV);
-	uint64_t macKey[4];
-	s20.crypt12(ZERO_KEY,macKey,sizeof(macKey));
-	uint8_t *const payload = data + ZT_PACKET_IDX_VERB;
-	const unsigned int payloadLen = size() - ZT_PACKET_IDX_VERB;
-	if (encryptPayload)
-		s20.crypt12(payload,payload,payloadLen);
-	uint64_t mac[2];
-	poly1305(mac,payload,payloadLen,macKey);
-	memcpy(data + ZT_PACKET_IDX_MAC,mac,8);
-}
-
-bool Packet::dearmor(const void *key)
-{
-	uint8_t mangledKey[32];
-	uint8_t *const data = reinterpret_cast<uint8_t *>(unsafeData());
-	const unsigned int payloadLen = size() - ZT_PACKET_IDX_VERB;
-	unsigned char *const payload = data + ZT_PACKET_IDX_VERB;
-	const unsigned int cs = cipher();
-
-	if ((cs == ZT_PROTO_CIPHER_SUITE__POLY1305_NONE)||(cs == ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012)) {
-		_salsa20MangleKey((const unsigned char *)key,mangledKey);
-		Salsa20 s20(mangledKey,data + ZT_PACKET_IDX_IV);
-		uint64_t macKey[4];
-		s20.crypt12(ZERO_KEY,macKey,sizeof(macKey));
-		uint64_t mac[2];
-		poly1305(mac,payload,payloadLen,macKey);
-#ifdef ZT_NO_UNALIGNED_ACCESS
-		if (!Utils::secureEq(mac,data + ZT_PACKET_IDX_MAC,8))
-			return false;
-#else
-		if ((*reinterpret_cast<const uint64_t *>(data + ZT_PACKET_IDX_MAC)) != mac[0]) // also secure, constant time
-			return false;
-#endif
-		if (cs == ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012)
-			s20.crypt12(payload,payload,payloadLen);
-		return true;
-	} else {
-		return false; // unrecognized cipher suite
-	}
-}
-
-bool Packet::compress()
-{
-	char *const data = reinterpret_cast<char *>(unsafeData());
-	char buf[ZT_PROTO_MAX_PACKET_LENGTH * 2];
-
-	if ((!compressed())&&(size() > (ZT_PACKET_IDX_PAYLOAD + 64))) { // don't bother compressing tiny packets
-		int pl = (int)(size() - ZT_PACKET_IDX_PAYLOAD);
-		int cl = LZ4_compress_fast(data + ZT_PACKET_IDX_PAYLOAD,buf,pl,ZT_PROTO_MAX_PACKET_LENGTH * 2,1);
-		if ((cl > 0)&&(cl < pl)) {
-			data[ZT_PACKET_IDX_VERB] |= (char)ZT_PROTO_VERB_FLAG_COMPRESSED;
-			setSize((unsigned int)cl + ZT_PACKET_IDX_PAYLOAD);
-			memcpy(data + ZT_PACKET_IDX_PAYLOAD,buf,cl);
-			return true;
-		}
-	}
-	data[ZT_PACKET_IDX_VERB] &= (char)(~ZT_PROTO_VERB_FLAG_COMPRESSED);
-
-	return false;
-}
-
-bool Packet::uncompress()
-{
-	char *const data = reinterpret_cast<char *>(unsafeData());
-	char buf[ZT_PROTO_MAX_PACKET_LENGTH];
-
-	if ((compressed())&&(size() >= ZT_PROTO_MIN_PACKET_LENGTH)) {
-		if (size() > ZT_PACKET_IDX_PAYLOAD) {
-			unsigned int compLen = size() - ZT_PACKET_IDX_PAYLOAD;
-			int ucl = LZ4_decompress_safe((const char *)data + ZT_PACKET_IDX_PAYLOAD,buf,compLen,sizeof(buf));
-			if ((ucl > 0)&&(ucl <= (int)(capacity() - ZT_PACKET_IDX_PAYLOAD))) {
-				setSize((unsigned int)ucl + ZT_PACKET_IDX_PAYLOAD);
-				memcpy(data + ZT_PACKET_IDX_PAYLOAD,buf,ucl);
-			} else {
-				return false;
-			}
-		}
-		data[ZT_PACKET_IDX_VERB] &= (char)(~ZT_PROTO_VERB_FLAG_COMPRESSED);
-	}
-
-	return true;
-}
-
-static unsigned long long s_initPacketID()
-{
-	unsigned long long tmp = 0;
-	Utils::getSecureRandom(&tmp,sizeof(tmp));
-	tmp >>= 31U;
-	tmp |= (((uint64_t)time(nullptr)) & 0xffffffffULL) << 33U;
-	return tmp;
-}
-#ifdef ZT_PACKET_USE_ATOMIC_INTRINSICS
-static unsigned long long s_packetIdCtr = s_initPacketID();
-#else
-static std::atomic<unsigned long long> s_packetIdCtr(s_initPacketID());
-#endif
-
-uint64_t getPacketId()
-{
-#ifdef ZT_PACKET_USE_ATOMIC_INTRINSICS
-	return __sync_add_and_fetch(&s_packetIdCtr,1ULL);
-#else
-	return ++s_packetIdCtr;
-#endif
-}
-
-} // namespace ZeroTier

attic/Packet.hpp

@@ -1,1201 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#ifndef ZT_N_PACKET_HPP
-#define ZT_N_PACKET_HPP
-
-#include <cstdint>
-#include <cstring>
-#include <cstdio>
-
-#include <string>
-#include <iostream>
-
-#include "Constants.hpp"
-
-#include "Address.hpp"
-#include "Poly1305.hpp"
-#include "Salsa20.hpp"
-#include "Utils.hpp"
-#include "Buffer.hpp"
-
-/**
- * Protocol version -- incremented only for major changes
- *
- * 1  - 0.2.0 ... 0.2.5
- * 2  - 0.3.0 ... 0.4.5
- *    + Added signature and originating peer to multicast frame
- *    + Double size of multicast frame bloom filter
- * 3  - 0.5.0 ... 0.6.0
- *    + Yet another multicast redesign
- *    + New crypto completely changes key agreement cipher
- * 4  - 0.6.0 ... 1.0.6
- *    + BREAKING CHANGE: New identity format based on hashcash design
- * 5  - 1.1.0 ... 1.1.5
- *    + Supports echo
- *    + Supports in-band world (root server definition) updates
- *    + Clustering! (Though this will work with protocol v4 clients.)
- *    + Otherwise backward compatible with protocol v4
- * 6  - 1.1.5 ... 1.1.10
- *    + Network configuration format revisions including binary values
- * 7  - 1.1.10 ... 1.1.17
- *    + Introduce trusted paths for local SDN use
- * 8  - 1.1.17 ... 1.2.0
- *    + Multipart network configurations for large network configs
- *    + Tags and Capabilities
- *    + inline push of CertificateOfMembership deprecated
- * 9  - 1.2.0 ... 1.2.14
- * 10 - 1.4.0 ... 1.6.0
- *    + Multipath capability and load balancing
- * 11 - 2.0.0 ... CURRENT
- *    + Peer-to-peer multicast replication (optional)
- *    + Old planet/moon stuff is DEAD!
- *    + AES-256-GMAC-CTR encryption is now the default
- *    + NIST P-384 (type 1) identities now supported
- *    + WILL_RELAY allows mesh-like operation
- *    + Ephemeral keys are now negotiated opportunistically
- */
-#define ZT_PROTO_VERSION 11
-
-/**
- * Minimum supported protocol version
- */
-#define ZT_PROTO_VERSION_MIN 6
-
-/**
- * Maximum hop count allowed by packet structure (3 bits, 0-7)
- *
- * This is a protocol constant. It's the maximum allowed by the length
- * of the hop counter -- three bits. See node/Constants.hpp for the
- * pragmatic forwarding limit, which is typically lower.
- */
-#define ZT_PROTO_MAX_HOPS 7
-
-/**
- * NONE/Poly1305 (using Salsa20/12 to generate poly1305 key)
- */
-#define ZT_PROTO_CIPHER_SUITE__POLY1305_NONE 0
-
-/**
- * Salsa2012/Poly1305
- */
-#define ZT_PROTO_CIPHER_SUITE__POLY1305_SALSA2012 1
-
-/**
- * No encryption or authentication at all
- *
- * For trusted paths the MAC field is the trusted path ID.
- */
-#define ZT_PROTO_CIPHER_SUITE__NONE 2
-
-/**
- * AES-GMAC_SIV with AES-256
- */
-#define ZT_PROTO_CIPHER_SUITE__AES256_GMAC_SIV 3
-
-/**
- * Header flag indicating that a packet is fragmented
- *
- * If this flag is set, the receiver knows to expect more than one fragment.
- * See Packet::Fragment for details.
- */
-#define ZT_PROTO_FLAG_FRAGMENTED 0x40
-
-/**
- * Verb flag indicating payload is compressed with LZ4
- */
-#define ZT_PROTO_VERB_FLAG_COMPRESSED 0x80
-
-// Field indexes in packet header
-#define ZT_PACKET_IDX_IV 0
-#define ZT_PACKET_IDX_DEST 8
-#define ZT_PACKET_IDX_SOURCE 13
-#define ZT_PACKET_IDX_FLAGS 18
-#define ZT_PACKET_IDX_MAC 19
-#define ZT_PACKET_IDX_VERB 27
-#define ZT_PACKET_IDX_PAYLOAD 28
-
-/**
- * Packet buffer size (can be changed)
- */
-#define ZT_PROTO_MAX_PACKET_LENGTH (ZT_MAX_PACKET_FRAGMENTS * ZT_DEFAULT_PHYSMTU)
-
-/**
- * Minimum viable packet length (a.k.a. header length)
- */
-#define ZT_PROTO_MIN_PACKET_LENGTH ZT_PACKET_IDX_PAYLOAD
-
-// Indexes of fields in fragment header
-#define ZT_PACKET_FRAGMENT_IDX_PACKET_ID 0
-#define ZT_PACKET_FRAGMENT_IDX_DEST 8
-#define ZT_PACKET_FRAGMENT_IDX_FRAGMENT_INDICATOR 13
-#define ZT_PACKET_FRAGMENT_IDX_FRAGMENT_NO 14
-#define ZT_PACKET_FRAGMENT_IDX_HOPS 15
-#define ZT_PACKET_FRAGMENT_IDX_PAYLOAD 16
-
-/**
- * Magic number found at ZT_PACKET_FRAGMENT_IDX_FRAGMENT_INDICATOR
- */
-#define ZT_PACKET_FRAGMENT_INDICATOR ZT_ADDRESS_RESERVED_PREFIX
-
-/**
- * Minimum viable fragment length
- */
-#define ZT_PROTO_MIN_FRAGMENT_LENGTH ZT_PACKET_FRAGMENT_IDX_PAYLOAD
-
-// Field indices for parsing verbs -------------------------------------------
-
-// Some verbs have variable-length fields. Those aren't fully defined here
-// yet-- instead they are parsed using relative indexes in IncomingPacket.
-// See their respective handler functions.
-
-#define ZT_PROTO_VERB_HELLO_IDX_PROTOCOL_VERSION (ZT_PACKET_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_HELLO_IDX_MAJOR_VERSION (ZT_PROTO_VERB_HELLO_IDX_PROTOCOL_VERSION + 1)
-#define ZT_PROTO_VERB_HELLO_IDX_MINOR_VERSION (ZT_PROTO_VERB_HELLO_IDX_MAJOR_VERSION + 1)
-#define ZT_PROTO_VERB_HELLO_IDX_REVISION (ZT_PROTO_VERB_HELLO_IDX_MINOR_VERSION + 1)
-#define ZT_PROTO_VERB_HELLO_IDX_TIMESTAMP (ZT_PROTO_VERB_HELLO_IDX_REVISION + 2)
-#define ZT_PROTO_VERB_HELLO_IDX_IDENTITY (ZT_PROTO_VERB_HELLO_IDX_TIMESTAMP + 8)
-
-#define ZT_PROTO_VERB_ERROR_IDX_IN_RE_VERB (ZT_PACKET_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_ERROR_IDX_IN_RE_PACKET_ID (ZT_PROTO_VERB_ERROR_IDX_IN_RE_VERB + 1)
-#define ZT_PROTO_VERB_ERROR_IDX_ERROR_CODE (ZT_PROTO_VERB_ERROR_IDX_IN_RE_PACKET_ID + 8)
-#define ZT_PROTO_VERB_ERROR_IDX_PAYLOAD (ZT_PROTO_VERB_ERROR_IDX_ERROR_CODE + 1)
-
-#define ZT_PROTO_VERB_OK_IDX_IN_RE_VERB (ZT_PACKET_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_OK_IDX_IN_RE_PACKET_ID (ZT_PROTO_VERB_OK_IDX_IN_RE_VERB + 1)
-#define ZT_PROTO_VERB_OK_IDX_PAYLOAD (ZT_PROTO_VERB_OK_IDX_IN_RE_PACKET_ID + 8)
-
-#define ZT_PROTO_VERB_WHOIS_IDX_ZTADDRESS (ZT_PACKET_IDX_PAYLOAD)
-
-#define ZT_PROTO_VERB_RENDEZVOUS_IDX_FLAGS (ZT_PACKET_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_RENDEZVOUS_IDX_ZTADDRESS (ZT_PROTO_VERB_RENDEZVOUS_IDX_FLAGS + 1)
-#define ZT_PROTO_VERB_RENDEZVOUS_IDX_PORT (ZT_PROTO_VERB_RENDEZVOUS_IDX_ZTADDRESS + 5)
-#define ZT_PROTO_VERB_RENDEZVOUS_IDX_ADDRLEN (ZT_PROTO_VERB_RENDEZVOUS_IDX_PORT + 2)
-#define ZT_PROTO_VERB_RENDEZVOUS_IDX_ADDRESS (ZT_PROTO_VERB_RENDEZVOUS_IDX_ADDRLEN + 1)
-
-#define ZT_PROTO_VERB_FRAME_IDX_NETWORK_ID (ZT_PACKET_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_FRAME_IDX_ETHERTYPE (ZT_PROTO_VERB_FRAME_IDX_NETWORK_ID + 8)
-#define ZT_PROTO_VERB_FRAME_IDX_PAYLOAD (ZT_PROTO_VERB_FRAME_IDX_ETHERTYPE + 2)
-
-#define ZT_PROTO_VERB_EXT_FRAME_IDX_NETWORK_ID (ZT_PACKET_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_EXT_FRAME_LEN_NETWORK_ID 8
-#define ZT_PROTO_VERB_EXT_FRAME_IDX_FLAGS (ZT_PROTO_VERB_EXT_FRAME_IDX_NETWORK_ID + ZT_PROTO_VERB_EXT_FRAME_LEN_NETWORK_ID)
-#define ZT_PROTO_VERB_EXT_FRAME_LEN_FLAGS 1
-#define ZT_PROTO_VERB_EXT_FRAME_IDX_COM (ZT_PROTO_VERB_EXT_FRAME_IDX_FLAGS + ZT_PROTO_VERB_EXT_FRAME_LEN_FLAGS)
-#define ZT_PROTO_VERB_EXT_FRAME_IDX_TO (ZT_PROTO_VERB_EXT_FRAME_IDX_FLAGS + ZT_PROTO_VERB_EXT_FRAME_LEN_FLAGS)
-#define ZT_PROTO_VERB_EXT_FRAME_LEN_TO 6
-#define ZT_PROTO_VERB_EXT_FRAME_IDX_FROM (ZT_PROTO_VERB_EXT_FRAME_IDX_TO + ZT_PROTO_VERB_EXT_FRAME_LEN_TO)
-#define ZT_PROTO_VERB_EXT_FRAME_LEN_FROM 6
-#define ZT_PROTO_VERB_EXT_FRAME_IDX_ETHERTYPE (ZT_PROTO_VERB_EXT_FRAME_IDX_FROM + ZT_PROTO_VERB_EXT_FRAME_LEN_FROM)
-#define ZT_PROTO_VERB_EXT_FRAME_LEN_ETHERTYPE 2
-#define ZT_PROTO_VERB_EXT_FRAME_IDX_PAYLOAD (ZT_PROTO_VERB_EXT_FRAME_IDX_ETHERTYPE + ZT_PROTO_VERB_EXT_FRAME_LEN_ETHERTYPE)
-
-#define ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST_IDX_NETWORK_ID (ZT_PACKET_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST_IDX_DICT_LEN (ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST_IDX_NETWORK_ID + 8)
-#define ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST_IDX_DICT (ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST_IDX_DICT_LEN + 2)
-
-#define ZT_PROTO_VERB_MULTICAST_GATHER_IDX_NETWORK_ID (ZT_PACKET_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_MULTICAST_GATHER_IDX_FLAGS (ZT_PROTO_VERB_MULTICAST_GATHER_IDX_NETWORK_ID + 8)
-#define ZT_PROTO_VERB_MULTICAST_GATHER_IDX_MAC (ZT_PROTO_VERB_MULTICAST_GATHER_IDX_FLAGS + 1)
-#define ZT_PROTO_VERB_MULTICAST_GATHER_IDX_ADI (ZT_PROTO_VERB_MULTICAST_GATHER_IDX_MAC + 6)
-#define ZT_PROTO_VERB_MULTICAST_GATHER_IDX_GATHER_LIMIT (ZT_PROTO_VERB_MULTICAST_GATHER_IDX_ADI + 4)
-#define ZT_PROTO_VERB_MULTICAST_GATHER_IDX_COM (ZT_PROTO_VERB_MULTICAST_GATHER_IDX_GATHER_LIMIT + 4)
-
-#define ZT_PROTO_VERB_HELLO__OK__IDX_TIMESTAMP (ZT_PROTO_VERB_OK_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_HELLO__OK__IDX_PROTOCOL_VERSION (ZT_PROTO_VERB_HELLO__OK__IDX_TIMESTAMP + 8)
-#define ZT_PROTO_VERB_HELLO__OK__IDX_MAJOR_VERSION (ZT_PROTO_VERB_HELLO__OK__IDX_PROTOCOL_VERSION + 1)
-#define ZT_PROTO_VERB_HELLO__OK__IDX_MINOR_VERSION (ZT_PROTO_VERB_HELLO__OK__IDX_MAJOR_VERSION + 1)
-#define ZT_PROTO_VERB_HELLO__OK__IDX_REVISION (ZT_PROTO_VERB_HELLO__OK__IDX_MINOR_VERSION + 1)
-
-#define ZT_PROTO_VERB_WHOIS__OK__IDX_IDENTITY (ZT_PROTO_VERB_OK_IDX_PAYLOAD)
-
-#define ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST__OK__IDX_NETWORK_ID (ZT_PROTO_VERB_OK_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST__OK__IDX_DICT_LEN (ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST__OK__IDX_NETWORK_ID + 8)
-#define ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST__OK__IDX_DICT (ZT_PROTO_VERB_NETWORK_CONFIG_REQUEST__OK__IDX_DICT_LEN + 2)
-
-#define ZT_PROTO_VERB_MULTICAST_GATHER__OK__IDX_NETWORK_ID (ZT_PROTO_VERB_OK_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_MULTICAST_GATHER__OK__IDX_MAC (ZT_PROTO_VERB_MULTICAST_GATHER__OK__IDX_NETWORK_ID + 8)
-#define ZT_PROTO_VERB_MULTICAST_GATHER__OK__IDX_ADI (ZT_PROTO_VERB_MULTICAST_GATHER__OK__IDX_MAC + 6)
-#define ZT_PROTO_VERB_MULTICAST_GATHER__OK__IDX_GATHER_RESULTS (ZT_PROTO_VERB_MULTICAST_GATHER__OK__IDX_ADI + 4)
-
-#define ZT_PROTO_VERB_MULTICAST_FRAME__OK__IDX_NETWORK_ID (ZT_PROTO_VERB_OK_IDX_PAYLOAD)
-#define ZT_PROTO_VERB_MULTICAST_FRAME__OK__IDX_MAC (ZT_PROTO_VERB_MULTICAST_FRAME__OK__IDX_NETWORK_ID + 8)
-#define ZT_PROTO_VERB_MULTICAST_FRAME__OK__IDX_ADI (ZT_PROTO_VERB_MULTICAST_FRAME__OK__IDX_MAC + 6)
-#define ZT_PROTO_VERB_MULTICAST_FRAME__OK__IDX_FLAGS (ZT_PROTO_VERB_MULTICAST_FRAME__OK__IDX_ADI + 4)
-#define ZT_PROTO_VERB_MULTICAST_FRAME__OK__IDX_COM_AND_GATHER_RESULTS (ZT_PROTO_VERB_MULTICAST_FRAME__OK__IDX_FLAGS + 1)
-
-// ---------------------------------------------------------------------------
-
-namespace ZeroTier {
-
-/**
- * ZeroTier packet
- *
- * Packet format:
- *   <[8] 64-bit packet ID / crypto IV>
- *   <[5] destination ZT address>
- *   <[5] source ZT address>
- *   <[1] flags/cipher/hops>
- *   <[8] 64-bit MAC (or trusted path ID in trusted path mode)>
- *   [... -- begin encryption envelope -- ...]
- *   <[1] encrypted flags (MS 3 bits) and verb (LS 5 bits)>
- *   [... verb-specific payload ...]
- *
- * Packets smaller than 28 bytes are invalid and silently discarded.
- *
- * The 64-bit packet ID is a strongly random value used as a crypto IV.
- * Its least significant 3 bits are also used as a monotonically increasing
- * (and looping) counter for sending packets to a particular recipient. This
- * can be used for link quality monitoring and reporting and has no crypto
- * impact as it does not increase the likelihood of an IV collision. (The
- * crypto we use is not sensitive to the nature of the IV, only that it does
- * not repeat.)
- *
- * The flags/cipher/hops bit field is: FFCCCHHH where C is a 3-bit cipher
- * selection allowing up to 7 cipher suites, F is outside-envelope flags,
- * and H is hop count.
- *
- * The three-bit hop count is the only part of a packet that is mutable in
- * transit without invalidating the MAC. All other bits in the packet are
- * immutable. This is because intermediate nodes can increment the hop
- * count up to 7 (protocol max).
- *
- * For unencrypted packets, MAC is computed on plaintext. Only HELLO is ever
- * sent in the clear, as it's the "here is my public key" message.
- */
-class Packet : public Buffer<ZT_PROTO_MAX_PACKET_LENGTH>
-{
-public:
-	/**
-	 * A packet fragment
-	 *
-	 * Fragments are sent if a packet is larger than UDP MTU. The first fragment
-	 * is sent with its normal header with the fragmented flag set. Remaining
-	 * fragments are sent this way.
-	 *
-	 * The fragmented bit indicates that there is at least one fragment. Fragments
-	 * themselves contain the total, so the receiver must "learn" this from the
-	 * first fragment it receives.
-	 *
-	 * Fragments are sent with the following format:
-	 *   <[8] packet ID of packet whose fragment this belongs to>
-	 *   <[5] destination ZT address>
-	 *   <[1] 0xff, a reserved address, signals that this isn't a normal packet>
-	 *   <[1] total fragments (most significant 4 bits), fragment no (LS 4 bits)>
-	 *   <[1] ZT hop count (top 5 bits unused and must be zero)>
-	 *   <[...] fragment data>
-	 *
-	 * The protocol supports a maximum of 16 fragments. If a fragment is received
-	 * before its main packet header, it should be cached for a brief period of
-	 * time to see if its parent arrives. Loss of any fragment constitutes packet
-	 * loss; there is no retransmission mechanism. The receiver must wait for full
-	 * receipt to authenticate and decrypt; there is no per-fragment MAC. (But if
-	 * fragments are corrupt, the MAC will fail for the whole assembled packet.)
-	 */
-	class Fragment : public Buffer<ZT_PROTO_MAX_PACKET_LENGTH>
-	{
-	public:
-		inline Fragment() :
-			Buffer<ZT_PROTO_MAX_PACKET_LENGTH>() {}
-
-		template<unsigned int C2>
-		inline Fragment(const Buffer<C2> &b) :
-			Buffer<ZT_PROTO_MAX_PACKET_LENGTH>(b) {}
-
-		inline Fragment(const void *data,unsigned int len) :
-			Buffer<ZT_PROTO_MAX_PACKET_LENGTH>(data,len) {}
-
-		/**
-		 * Initialize from a packet
-		 *
-		 * @param p Original assembled packet
-		 * @param fragStart Start of fragment (raw index in packet data)
-		 * @param fragLen Length of fragment in bytes
-		 * @param fragNo Which fragment (>= 1, since 0 is Packet with end chopped off)
-		 * @param fragTotal Total number of fragments (including 0)
-		 */
-		inline Fragment(const Packet &p,unsigned int fragStart,unsigned int fragLen,unsigned int fragNo,unsigned int fragTotal)
-		{
-			init(p,fragStart,fragLen,fragNo,fragTotal);
-		}
-
-		/**
-		 * Initialize from a packet
-		 *
-		 * @param p Original assembled packet
-		 * @param fragStart Start of fragment (raw index in packet data)
-		 * @param fragLen Length of fragment in bytes
-		 * @param fragNo Which fragment (>= 1, since 0 is Packet with end chopped off)
-		 * @param fragTotal Total number of fragments (including 0)
-		 */
-		inline void init(const Packet &p,unsigned int fragStart,unsigned int fragLen,unsigned int fragNo,unsigned int fragTotal)
-		{
-			if ((fragStart + fragLen) > p.size())
-				throw ZT_EXCEPTION_OUT_OF_BOUNDS;
-			setSize(fragLen + ZT_PROTO_MIN_FRAGMENT_LENGTH);
-
-			// NOTE: this copies both the IV/packet ID and the destination address.
-			memcpy(field(ZT_PACKET_FRAGMENT_IDX_PACKET_ID,13),p.field(ZT_PACKET_IDX_IV,13),13);
-
-			(*this)[ZT_PACKET_FRAGMENT_IDX_FRAGMENT_INDICATOR] = ZT_PACKET_FRAGMENT_INDICATOR;
-			(*this)[ZT_PACKET_FRAGMENT_IDX_FRAGMENT_NO] = (char)(((fragTotal & 0xf) << 4) | (fragNo & 0xf));
-			(*this)[ZT_PACKET_FRAGMENT_IDX_HOPS] = 0;
-
-			memcpy(field(ZT_PACKET_FRAGMENT_IDX_PAYLOAD,fragLen),p.field(fragStart,fragLen),fragLen);
-		}
-
-		/**
-		 * Get this fragment's destination
-		 *
-		 * @return Destination ZT address
-		 */
-		inline Address destination() const { return Address(field(ZT_PACKET_FRAGMENT_IDX_DEST,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); }
-
-		/**
-		 * @return True if fragment is of a valid length
-		 */
-		inline bool lengthValid() const { return (size() >= ZT_PACKET_FRAGMENT_IDX_PAYLOAD); }
-
-		/**
-		 * @return ID of packet this is a fragment of
-		 */
-		inline uint64_t packetId() const { return at<uint64_t>(ZT_PACKET_FRAGMENT_IDX_PACKET_ID); }
-
-		/**
-		 * @return Total number of fragments in packet
-		 */
-		inline unsigned int totalFragments() const { return (((unsigned int)((*this)[ZT_PACKET_FRAGMENT_IDX_FRAGMENT_NO]) >> 4) & 0xf); }
-
-		/**
-		 * @return Fragment number of this fragment
-		 */
-		inline unsigned int fragmentNumber() const { return ((unsigned int)((*this)[ZT_PACKET_FRAGMENT_IDX_FRAGMENT_NO]) & 0xf); }
-
-		/**
-		 * @return Fragment ZT hop count
-		 */
-		inline unsigned int hops() const { return (unsigned int)((*this)[ZT_PACKET_FRAGMENT_IDX_HOPS]); }
-
-		/**
-		 * Increment this packet's hop count
-		 */
-		inline unsigned int incrementHops()
-		{
-			return (unsigned int)((*this)[ZT_PACKET_FRAGMENT_IDX_HOPS] = (((*this)[ZT_PACKET_FRAGMENT_IDX_HOPS]) + 1));
-		}
-
-		/**
-		 * @return Length of payload in bytes
-		 */
-		inline unsigned int payloadLength() const { return ((size() > ZT_PACKET_FRAGMENT_IDX_PAYLOAD) ? (size() - ZT_PACKET_FRAGMENT_IDX_PAYLOAD) : 0); }
-
-		/**
-		 * @return Raw packet payload
-		 */
-		inline const unsigned char *payload() const { return field(ZT_PACKET_FRAGMENT_IDX_PAYLOAD,size() - ZT_PACKET_FRAGMENT_IDX_PAYLOAD); }
-	};
-
-	/**
-	 * ZeroTier protocol verbs
-	 */
-	enum Verb /* Max value: 32 (5 bits) */
-	{
-		/**
-		 * No operation (ignored, no reply)
-		 */
-		VERB_NOP = 0x00,
-
-		/**
-		 * Announcement of a node's existence and vitals:
-		 *   <[1] protocol version>
-		 *   <[1] software major version>
-		 *   <[1] software minor version>
-		 *   <[2] software revision>
-		 *   <[8] timestamp for determining latency>
-		 *   <[...] binary serialized identity>
-		 *   <[...] physical destination address of packet>
-		 *   [... begin encrypted region ...]
-		 *   <[2] 16-bit reserved (legacy) field, always 0>
-		 *   <[2] 16-bit length of meta-data dictionary>
-		 *   <[...] meta-data dictionary>
-		 *   [... end encrypted region ...]
-		 *   <[48] HMAC-SHA384 of all fields to this point (as plaintext)>
-		 *
-		 * HELLO is sent with authentication but without the usual encryption so
-		 * that peers can exchange identities.
-		 *
-		 * Destination address is the actual wire address to which the packet
-		 * was sent. See InetAddress::serialize() for format.
-		 *
-		 * Starting at "begin encrypted section" the reset of the packet is
-		 * encrypted with Salsa20/12. This is not the normal packet encryption
-		 * and is technically not necessary as nothing in HELLO is secret. It
-		 * exists merely to shield meta-data info from passive listeners to
-		 * slightly improve privacy, and for backward compatibility with older
-		 * nodes that required it.
-		 *
-		 * HELLO (and its OK response) ends with a large 384-bit HMAC to allow
-		 * identity exchanges to be authenticated with additional strength beyond
-		 * ordinary packet authentication.
-		 *
-		 * OK payload:
-		 *   <[8] HELLO timestamp field echo>
-		 *   <[1] protocol version>
-		 *   <[1] software major version>
-		 *   <[1] software minor version>
-		 *   <[2] software revision>
-		 *   <[...] physical destination address of packet>
-		 *   <[2] 16-bit reserved (legacy) field, always 0>
-		 *   <[2] 16-bit length of meta-data dictionary>
-		 *   <[...] meta-data dictionary>
-		 *   <[48] HMAC-SHA384 of all fields to this point (as plaintext)>
-		 *
-		 * With the exception of the timestamp, the other fields pertain to the
-		 * respondent who is sending OK and are not echoes.
-		 *
-		 * ERROR has no payload.
-		 */
-		VERB_HELLO = 0x01,
-
-		/**
-		 * Error response:
-		 *   <[1] in-re verb>
-		 *   <[8] in-re packet ID>
-		 *   <[1] error code>
-		 *   <[...] error-dependent payload>
-		 *
-		 * If this is not in response to a single packet then verb can be
-		 * NOP and packet ID can be zero.
-		 */
-		VERB_ERROR = 0x02,
-
-		/**
-		 * Success response:
-		 *   <[1] in-re verb>
-		 *   <[8] in-re packet ID>
-		 *   <[...] request-specific payload>
-		 */
-		VERB_OK = 0x03,
-
-		/**
-		 * Query an identity by address:
-		 *   <[5] address to look up>
-		 *   [<[...] additional addresses to look up>
-		 *
-		 * OK response payload:
-		 *   <[...] identity>
-		 *   <[...] locator>
-		 *   [... additional identity/locator pairs]
-		 *
-		 * If the address is not found, no response is generated. The semantics
-		 * of WHOIS is similar to ARP and NDP in that persistent retrying can
-		 * be performed.
-		 *
-		 * It is possible for an identity but a null/empty locator to be returned
-		 * if no locator is known for a node. Older versions will also send no
-		 * locator field at all.
-		 */
-		VERB_WHOIS = 0x04,
-
-		/**
-		 * Relay-mediated NAT traversal or firewall punching initiation:
-		 *   <[1] flags (unused, currently 0)>
-		 *   <[5] ZeroTier address of peer that might be found at this address>
-		 *   <[2] 16-bit protocol address port>
-		 *   <[1] protocol address length (4 for IPv4, 16 for IPv6)>
-		 *   <[...] protocol address (network byte order)>
-		 *
-		 * An upstream node can send this to inform both sides of a relay of
-		 * information they might use to establish a direct connection.
-		 *
-		 * Upon receipt a peer sends HELLO to establish a direct link.
-		 *
-		 * No OK or ERROR is generated.
-		 */
-		VERB_RENDEZVOUS = 0x05,
-
-		/**
-		 * ZT-to-ZT unicast ethernet frame (shortened EXT_FRAME):
-		 *   <[8] 64-bit network ID>
-		 *   <[2] 16-bit ethertype>
-		 *   <[...] ethernet payload>
-		 *
-		 * MAC addresses are derived from the packet's source and destination
-		 * ZeroTier addresses. This is a shortened EXT_FRAME that elides full
-		 * Ethernet framing and other optional flags and features when they
-		 * are not necessary.
-		 *
-		 * ERROR may be generated if a membership certificate is needed for a
-		 * closed network. Payload will be network ID.
-		 */
-		VERB_FRAME = 0x06,
-
-		/**
-		 * Full Ethernet frame with MAC addressing and optional fields:
-		 *   <[8] 64-bit network ID>
-		 *   <[1] flags>
-		 *   <[6] destination MAC or all zero for destination node>
-		 *   <[6] source MAC or all zero for node of origin>
-		 *   <[2] 16-bit ethertype>
-		 *   <[...] ethernet payload>
-		 *
-		 * Flags:
-		 *   0x01 - Certificate of network membership attached (DEPRECATED)
-		 *   0x02 - Most significant bit of subtype (see below)
-		 *   0x04 - Middle bit of subtype (see below)
-		 *   0x08 - Least significant bit of subtype (see below)
-		 *   0x10 - ACK requested in the form of OK(EXT_FRAME)
-		 *
-		 * Subtypes (0..7):
-		 *   0x0 - Normal frame (bridging can be determined by checking MAC)
-		 *   0x1 - TEEd outbound frame
-		 *   0x2 - REDIRECTed outbound frame
-		 *   0x3 - WATCHed outbound frame (TEE with ACK, ACK bit also set)
-		 *   0x4 - TEEd inbound frame
-		 *   0x5 - REDIRECTed inbound frame
-		 *   0x6 - WATCHed inbound frame
-		 *   0x7 - (reserved for future use)
-		 *
-		 * An extended frame carries full MAC addressing, making it a
-		 * superset of VERB_FRAME. If 0x20 is set then p2p or hub and
-		 * spoke multicast propagation is requested.
-		 *
-		 * OK payload (if ACK flag is set):
-		 *   <[8] 64-bit network ID>
-		 *   <[1] flags>
-		 *   <[6] destination MAC or all zero for destination node>
-		 *   <[6] source MAC or all zero for node of origin>
-		 *   <[2] 16-bit ethertype>
-		 */
-		VERB_EXT_FRAME = 0x07,
-
-		/**
-		 * ECHO request (a.k.a. ping):
-		 *   <[...] arbitrary payload>
-		 *
-		 * This generates OK with a copy of the transmitted payload. No ERROR
-		 * is generated. Response to ECHO requests is optional and ECHO may be
-		 * ignored if a node detects a possible flood.
-		 */
-		VERB_ECHO = 0x08,
-
-		/**
-		 * Announce interest in multicast group(s):
-		 *   <[8] 64-bit network ID>
-		 *   <[6] multicast Ethernet address>
-		 *   <[4] multicast additional distinguishing information (ADI)>
-		 *   [... additional tuples of network/address/adi ...]
-		 *
-		 * LIKEs may be sent to any peer, though a good implementation should
-		 * restrict them to peers on the same network they're for and to network
-		 * controllers and root servers. In the current network, root servers
-		 * will provide the service of final multicast cache.
-		 */
-		VERB_MULTICAST_LIKE = 0x09,
-
-		/**
-		 * Network credentials push:
-		 *   [<[...] one or more certificates of membership>]
-		 *   <[1] 0x00, null byte marking end of COM array>
-		 *   <[2] 16-bit number of capabilities>
-		 *   <[...] one or more serialized Capability>
-		 *   <[2] 16-bit number of tags>
-		 *   <[...] one or more serialized Tags>
-		 *   <[2] 16-bit number of revocations>
-		 *   <[...] one or more serialized Revocations>
-		 *   <[2] 16-bit number of certificates of ownership>
-		 *   <[...] one or more serialized CertificateOfOwnership>
-		 *
-		 * This can be sent by anyone at any time to push network credentials.
-		 * These will of course only be accepted if they are properly signed.
-		 * Credentials can be for any number of networks.
-		 *
-		 * The use of a zero byte to terminate the COM section is for legacy
-		 * backward compatibility. Newer fields are prefixed with a length.
-		 *
-		 * OK/ERROR are not generated.
-		 */
-		VERB_NETWORK_CREDENTIALS = 0x0a,
-
-		/**
-		 * Network configuration request:
-		 *   <[8] 64-bit network ID>
-		 *   <[2] 16-bit length of request meta-data dictionary>
-		 *   <[...] string-serialized request meta-data>
-		 *   <[8] 64-bit revision of netconf we currently have>
-		 *   <[8] 64-bit timestamp of netconf we currently have>
-		 *
-		 * This message requests network configuration from a node capable of
-		 * providing it.
-		 *
-		 * Responses to this are always whole configs intended for the recipient.
-		 * For patches and other updates a NETWORK_CONFIG is sent instead.
-		 *
-		 * It would be valid and correct as of 1.2.0 to use NETWORK_CONFIG always,
-		 * but OK(NETWORK_CONFIG_REQUEST) should be sent for compatibility.
-		 *
-		 * OK response payload:
-		 *   <[8] 64-bit network ID>
-		 *   <[2] 16-bit length of network configuration dictionary chunk>
-		 *   <[...] network configuration dictionary (may be incomplete)>
-		 *   [ ... end of legacy single chunk response ... ]
-		 *   <[1] 8-bit flags>
-		 *   <[8] 64-bit config update ID (should never be 0)>
-		 *   <[4] 32-bit total length of assembled dictionary>
-		 *   <[4] 32-bit index of chunk>
-		 *   [ ... end signed portion ... ]
-		 *   <[1] 8-bit chunk signature type>
-		 *   <[2] 16-bit length of chunk signature>
-		 *   <[...] chunk signature>
-		 *
-		 * The chunk signature signs the entire payload of the OK response.
-		 * Currently only one signature type is supported: ed25519 (1).
-		 *
-		 * Each config chunk is signed to prevent memory exhaustion or
-		 * traffic crowding DOS attacks against config fragment assembly.
-		 *
-		 * If the packet is from the network controller it is permitted to end
-		 * before the config update ID or other chunking related or signature
-		 * fields. This is to support older controllers that don't include
-		 * these fields and may be removed in the future.
-		 *
-		 * ERROR response payload:
-		 *   <[8] 64-bit network ID>
-		 */
-		VERB_NETWORK_CONFIG_REQUEST = 0x0b,
-
-		/**
-		 * Network configuration data push:
-		 *   <[8] 64-bit network ID>
-		 *   <[2] 16-bit length of network configuration dictionary chunk>
-		 *   <[...] network configuration dictionary (may be incomplete)>
-		 *   <[1] 8-bit flags>
-		 *   <[8] 64-bit config update ID (should never be 0)>
-		 *   <[4] 32-bit total length of assembled dictionary>
-		 *   <[4] 32-bit index of chunk>
-		 *   [ ... end signed portion ... ]
-		 *   <[1] 8-bit chunk signature type>
-		 *   <[2] 16-bit length of chunk signature>
-		 *   <[...] chunk signature>
-		 *
-		 * This is a direct push variant for network config updates. It otherwise
-		 * carries the same payload as OK(NETWORK_CONFIG_REQUEST) and has the same
-		 * semantics.
-		 *
-		 * The legacy mode missing the additional chunking fields is not supported
-		 * here.
-		 *
-		 * Flags:
-		 *   0x01 - Use fast propagation
-		 *
-		 * An OK should be sent if the config is successfully received and
-		 * accepted.
-		 *
-		 * OK payload:
-		 *   <[8] 64-bit network ID>
-		 *   <[8] 64-bit config update ID>
-		 */
-		VERB_NETWORK_CONFIG = 0x0c,
-
-		/**
-		 * Request endpoints for multicast distribution:
-		 *   <[8] 64-bit network ID>
-		 *   <[1] flags>
-		 *   <[6] MAC address of multicast group being queried>
-		 *   <[4] 32-bit ADI for multicast group being queried>
-		 *   <[4] 32-bit requested max number of multicast peers>
-		 *
-		 * This message asks a peer for additional known endpoints that have
-		 * LIKEd a given multicast group. It's sent when the sender wishes
-		 * to send multicast but does not have the desired number of recipient
-		 * peers.
-		 *
-		 * OK response payload: (multiple OKs can be generated)
-		 *   <[8] 64-bit network ID>
-		 *   <[6] MAC address of multicast group being queried>
-		 *   <[4] 32-bit ADI for multicast group being queried>
-		 *   <[4] 32-bit total number of known members in this multicast group>
-		 *   <[2] 16-bit number of members enumerated in this packet>
-		 *   <[...] series of 5-byte ZeroTier addresses of enumerated members>
-		 *
-		 * ERROR is not generated; queries that return no response are dropped.
-		 */
-		VERB_MULTICAST_GATHER = 0x0d,
-
-		/** *** DEPRECATED ***
-		 * Multicast frame:
-		 *   <[8] 64-bit network ID>
-		 *   <[1] flags>
-		 *  [<[4] 32-bit implicit gather limit>]
-		 *  [<[6] source MAC>]
-		 *   <[6] destination MAC (multicast address)>
-		 *   <[4] 32-bit multicast ADI (multicast address extension)>
-		 *   <[2] 16-bit ethertype>
-		 *   <[...] ethernet payload>
-		 *
-		 * Flags:
-		 *   0x01 - Network certificate of membership attached (DEPRECATED)
-		 *   0x02 - Implicit gather limit field is present
-		 *   0x04 - Source MAC is specified -- otherwise it's computed from sender
-		 *   0x08 - Please replicate (sent to multicast replicators)
-		 *
-		 * OK and ERROR responses are optional. OK may be generated if there are
-		 * implicit gather results or if the recipient wants to send its own
-		 * updated certificate of network membership to the sender. ERROR may be
-		 * generated if a certificate is needed or if multicasts to this group
-		 * are no longer wanted (multicast unsubscribe).
-		 *
-		 * OK response payload:
-		 *   <[8] 64-bit network ID>
-		 *   <[6] MAC address of multicast group>
-		 *   <[4] 32-bit ADI for multicast group>
-		 *   <[1] flags>
-		 *  [<[...] network certificate of membership (DEPRECATED)>]
-		 *  [<[...] implicit gather results if flag 0x01 is set>]
-		 *
-		 * OK flags (same bits as request flags):
-		 *   0x01 - OK includes certificate of network membership (DEPRECATED)
-		 *   0x02 - OK includes implicit gather results
-		 *
-		 * ERROR response payload:
-		 *   <[8] 64-bit network ID>
-		 *   <[6] multicast group MAC>
-		 *   <[4] 32-bit multicast group ADI>
-		 */
-		VERB_MULTICAST_FRAME = 0x0e,
-
-		/**
-		 * Push of potential endpoints for direct communication:
-		 *   <[2] 16-bit number of paths>
-		 *   <[...] paths>
-		 *
-		 * Path record format:
-		 *   <[1] 8-bit path flags (always 0, currently unused)>
-		 *   <[2] length of extended path characteristics or 0 for none>
-		 *   <[...] extended path characteristics>
-		 *   <[1] address type>
-		 *   <[1] address length in bytes>
-		 *   <[...] address>
-		 *
-		 * The receiver may, upon receiving a push, attempt to establish a
-		 * direct link to one or more of the indicated addresses. It is the
-		 * responsibility of the sender to limit which peers it pushes direct
-		 * paths to to those with whom it has a trust relationship. The receiver
-		 * must obey any restrictions provided such as exclusivity or blacklists.
-		 * OK responses to this message are optional.
-		 *
-		 * Note that a direct path push does not imply that learned paths can't
-		 * be used unless they are blacklisted explicitly or unless flag 0x01
-		 * is set.
-		 *
-		 * OK and ERROR are not generated.
-		 */
-		VERB_PUSH_DIRECT_PATHS = 0x10,
-
-		VERB_ACK = 0x12,
-		VERB_QOS_MEASUREMENT = 0x13,
-
-		/**
-		 * A message with arbitrary user-definable content:
-		 *   <[8] 64-bit arbitrary message type ID>
-		 *  [<[...] message payload>]
-		 *
-		 * This can be used to send arbitrary messages over VL1. It generates no
-		 * OK or ERROR and has no special semantics outside of whatever the user
-		 * (via the ZeroTier core API) chooses to give it.
-		 *
-		 * Message type IDs less than or equal to 65535 are reserved for use by
-		 * ZeroTier, Inc. itself. We recommend making up random ones for your own
-		 * implementations.
-		 */
-		VERB_USER_MESSAGE = 0x14,
-
-		/**
-		 * Encapsulate a ZeroTier packet for multicast distribution:
-		 *   [... begin signed portion ...]
-		 *   <[1] 8-bit flags>
-		 *   <[5] 40-bit ZeroTier address of sender>
-		 *   <[2] 16-bit length of inner payload>
-		 *   <[1] inner payload verb>
-		 *   <[...] inner payload data>
-		 *   [... end signed portion ...]
-		 *   <[2] 16-bit length of signature or 0 if un-signed>
-		 *  [<[...] optional signature of multicast>]
-		 *   <[...] address (min prefix) list>
-		 */
-		VERB_MULTICAST = 0x16,
-
-		/**
-		 * Encapsulate a full ZeroTier packet in another:
-		 *   <[...] raw encapsulated packet>
-		 *
-		 * Encapsulation exists to enable secure relaying as opposed to the usual
-		 * "dumb" relaying. The latter is faster but secure relaying has roles
-		 * where endpoint privacy is desired. Multiply nested ENCAP packets
-		 * could allow ZeroTier to act as an onion router.
-		 *
-		 * When encapsulated packets are forwarded they do have their hop count
-		 * field incremented.
-		 */
-		VERB_ENCAP = 0x17
-
-		// protocol max: 0x1f
-	};
-
-	/**
-	 * Error codes for VERB_ERROR
-	 */
-	enum ErrorCode
-	{
-		/* No error, not actually used in transit */
-		ERROR_NONE = 0x00,
-
-		/* Invalid request */
-		ERROR_INVALID_REQUEST = 0x01,
-
-		/* Bad/unsupported protocol version */
-		ERROR_BAD_PROTOCOL_VERSION = 0x02,
-
-		/* Unknown object queried */
-		ERROR_OBJ_NOT_FOUND = 0x03,
-
-		/* HELLO pushed an identity whose address is already claimed */
-		ERROR_IDENTITY_COLLISION = 0x04,
-
-		/* Verb or use case not supported/enabled by this node */
-		ERROR_UNSUPPORTED_OPERATION = 0x05,
-
-		/* Network membership certificate update needed */
-		ERROR_NEED_MEMBERSHIP_CERTIFICATE = 0x06,
-
-		/* Tried to join network, but you're not a member */
-		ERROR_NETWORK_ACCESS_DENIED_ = 0x07, /* extra _ at end to avoid Windows name conflict */
-
-		/* Cannot deliver a forwarded ZeroTier packet (e.g. hops exceeded, no routes) */
-		/* Payload: <packet ID>, <destination>, <... additional packet ID / destinations> */
-		ERROR_CANNOT_DELIVER = 0x09
-	};
-
-	template<unsigned int C2>
-	inline Packet(const Buffer<C2> &b) :
-		Buffer<ZT_PROTO_MAX_PACKET_LENGTH>(b)
-	{
-	}
-
-	inline Packet(const void *data,unsigned int len) :
-		Buffer<ZT_PROTO_MAX_PACKET_LENGTH>(data,len)
-	{
-	}
-
-	/**
-	 * Construct a new empty packet with a unique random packet ID
-	 *
-	 * Flags and hops will be zero. Other fields and data region are undefined.
-	 * Use the header access methods (setDestination() and friends) to fill out
-	 * the header. Payload should be appended; initial size is header size.
-	 */
-	inline Packet() :
-		Buffer<ZT_PROTO_MAX_PACKET_LENGTH>(ZT_PROTO_MIN_PACKET_LENGTH)
-	{
-		setAt<uint64_t>(ZT_PACKET_IDX_IV,Packet::nextPacketId());
-		(*this)[ZT_PACKET_IDX_FLAGS] = 0; // zero flags, cipher ID, and hops
-	}
-
-	/**
-	 * Make a copy of a packet with a new initialization vector and destination address
-	 *
-	 * This can be used to take one draft prototype packet and quickly make copies to
-	 * encrypt for different destinations.
-	 *
-	 * @param prototype Prototype packet
-	 * @param dest Destination ZeroTier address for new packet
-	 */
-	inline Packet(const Packet &prototype,const Address &dest) :
-		Buffer<ZT_PROTO_MAX_PACKET_LENGTH>(prototype)
-	{
-		setAt<uint64_t>(ZT_PACKET_IDX_IV,Packet::nextPacketId());
-		setDestination(dest);
-	}
-
-	/**
-	 * Construct a new empty packet with a unique random packet ID
-	 *
-	 * @param dest Destination ZT address
-	 * @param source Source ZT address
-	 * @param v Verb
-	 */
-	inline Packet(const Address &dest,const Address &source,const Verb v) :
-		Buffer<ZT_PROTO_MAX_PACKET_LENGTH>(ZT_PROTO_MIN_PACKET_LENGTH)
-	{
-		setAt<uint64_t>(ZT_PACKET_IDX_IV,Packet::nextPacketId());
-		setDestination(dest);
-		setSource(source);
-		(*this)[ZT_PACKET_IDX_FLAGS] = 0; // zero flags and hops
-		setVerb(v);
-	}
-
-	/**
-	 * Reset this packet structure for reuse in place
-	 *
-	 * @param dest Destination ZT address
-	 * @param source Source ZT address
-	 * @param v Verb
-	 */
-	inline void reset(const Address &dest,const Address &source,const Verb v)
-	{
-		setSize(ZT_PROTO_MIN_PACKET_LENGTH);
-		setAt<uint64_t>(ZT_PACKET_IDX_IV,Packet::nextPacketId());
-		setDestination(dest);
-		setSource(source);
-		(*this)[ZT_PACKET_IDX_FLAGS] = 0; // zero flags, cipher ID, and hops
-		setVerb(v);
-	}
-
-	/**
-	 * Generate a new IV / packet ID in place
-	 *
-	 * This can be used to re-use a packet buffer multiple times to send
-	 * technically different but otherwise identical copies of the same
-	 * packet.
-	 */
-	inline void newInitializationVector() { setAt<uint64_t>(ZT_PACKET_IDX_IV,Packet::nextPacketId()); }
-
-	/**
-	 * Set this packet's destination
-	 *
-	 * @param dest ZeroTier address of destination
-	 */
-	inline void setDestination(const Address &dest) { dest.copyTo(field(ZT_PACKET_IDX_DEST,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); }
-
-	/**
-	 * Set this packet's source
-	 *
-	 * @param source ZeroTier address of source
-	 */
-	inline void setSource(const Address &source) { source.copyTo(field(ZT_PACKET_IDX_SOURCE,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); }
-
-	/**
-	 * Get this packet's destination
-	 *
-	 * @return Destination ZT address
-	 */
-	inline Address destination() const { return Address(field(ZT_PACKET_IDX_DEST,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); }
-
-	/**
-	 * Get this packet's source
-	 *
-	 * @return Source ZT address
-	 */
-	inline Address source() const { return Address(field(ZT_PACKET_IDX_SOURCE,ZT_ADDRESS_LENGTH),ZT_ADDRESS_LENGTH); }
-
-	/**
-	 * @return True if packet is of valid length
-	 */
-	inline bool lengthValid() const { return (size() >= ZT_PROTO_MIN_PACKET_LENGTH); }
-
-	/**
-	 * @return True if packet is fragmented (expect fragments)
-	 */
-	inline bool fragmented() const { return (((unsigned char)(*this)[ZT_PACKET_IDX_FLAGS] & ZT_PROTO_FLAG_FRAGMENTED) != 0); }
-
-	/**
-	 * Set this packet's fragmented flag
-	 *
-	 * @param f Fragmented flag value
-	 */
-	inline void setFragmented(bool f)
-	{
-		if (f)
-			(*this)[ZT_PACKET_IDX_FLAGS] |= (char)ZT_PROTO_FLAG_FRAGMENTED;
-		else (*this)[ZT_PACKET_IDX_FLAGS] &= (char)(~ZT_PROTO_FLAG_FRAGMENTED);
-	}
-
-	/**
-	 * @return True if compressed (result only valid if unencrypted)
-	 */
-	inline bool compressed() const { return (((unsigned char)(*this)[ZT_PACKET_IDX_VERB] & ZT_PROTO_VERB_FLAG_COMPRESSED) != 0); }
-
-	/**
-	 * @return ZeroTier forwarding hops (0 to 7)
-	 */
-	inline unsigned int hops() const { return ((unsigned int)(*this)[ZT_PACKET_IDX_FLAGS] & 0x07); }
-
-	/**
-	 * Increment this packet's hop count
-	 */
-	inline unsigned char incrementHops()
-	{
-		unsigned char &b = (*this)[ZT_PACKET_IDX_FLAGS];
-		const unsigned char h = (b + 1) & 0x07;
-		b = (b & 0xf8) | h;
-		return (unsigned int)h;
-	}
-
-	/**
-	 * @return Cipher suite selector: 0 - 7 (see #defines)
-	 */
-	inline unsigned int cipher() const
-	{
-		return (((unsigned int)(*this)[ZT_PACKET_IDX_FLAGS] & 0x38) >> 3);
-	}
-
-	/**
-	 * Set this packet's cipher suite
-	 */
-	inline void setCipher(unsigned int c)
-	{
-		unsigned char &b = (*this)[ZT_PACKET_IDX_FLAGS];
-		b = (b & 0xc7) | (unsigned char)((c << 3) & 0x38); // bits: FFCCCHHH
-	}
-
-	/**
-	 * Get the trusted path ID for this packet (only meaningful if cipher is trusted path)
-	 *
-	 * @return Trusted path ID (from MAC field)
-	 */
-	inline uint64_t trustedPathId() const { return at<uint64_t>(ZT_PACKET_IDX_MAC); }
-
-	/**
-	 * Set this packet's trusted path ID and set the cipher spec to trusted path
-	 *
-	 * @param tpid Trusted path ID
-	 */
-	inline void setTrusted(const uint64_t tpid)
-	{
-		setCipher(ZT_PROTO_CIPHER_SUITE__NONE);
-		setAt(ZT_PACKET_IDX_MAC,tpid);
-	}
-
-	/**
-	 * Get this packet's unique ID (the IV field interpreted as uint64_t)
-	 *
-	 * Note that the least significant 3 bits of this ID will change when armor()
-	 * is called to armor the packet for transport. This is because armor() will
-	 * mask the last 3 bits against the send counter for QoS monitoring use prior
-	 * to actually using the IV to encrypt and MAC the packet. Be aware of this
-	 * when grabbing the packetId of a new packet prior to armor/send.
-	 *
-	 * @return Packet ID
-	 */
-	inline uint64_t packetId() const { return at<uint64_t>(ZT_PACKET_IDX_IV); }
-
-	/**
-	 * Set packet verb
-	 *
-	 * This also has the side-effect of clearing any verb flags, such as
-	 * compressed, and so must only be done during packet composition.
-	 *
-	 * @param v New packet verb
-	 */
-	inline void setVerb(Verb v) { (*this)[ZT_PACKET_IDX_VERB] = (char)v; }
-
-	/**
-	 * @return Packet verb (not including flag bits)
-	 */
-	inline Verb verb() const { return (Verb)((*this)[ZT_PACKET_IDX_VERB] & 0x1f); }
-
-	/**
-	 * @return Length of packet payload
-	 */
-	inline unsigned int payloadLength() const { return ((size() < ZT_PROTO_MIN_PACKET_LENGTH) ? 0 : (size() - ZT_PROTO_MIN_PACKET_LENGTH)); }
-
-	/**
-	 * @return Raw packet payload
-	 */
-	inline const unsigned char *payload() const { return field(ZT_PACKET_IDX_PAYLOAD,size() - ZT_PACKET_IDX_PAYLOAD); }
-
-	/**
-	 * Armor packet for transport
-	 *
-	 * @param key 32-byte key
-	 * @param encryptPayload If true, encrypt packet payload, else just MAC
-	 */
-	void armor(const void *key,bool encryptPayload);
-
-	/**
-	 * Verify and (if encrypted) decrypt packet
-	 *
-	 * This does not handle trusted path mode packets and will return false
-	 * for these. These are handled in IncomingPacket if the sending physical
-	 * address and MAC field match a trusted path.
-	 *
-	 * @param key 32-byte key
-	 * @return False if packet is invalid or failed MAC authenticity check
-	 */
-	bool dearmor(const void *key);
-
-	/**
-	 * Attempt to compress payload if not already (must be unencrypted)
-	 *
-	 * This requires that the payload at least contain the verb byte already
-	 * set. The compressed flag in the verb is set if compression successfully
-	 * results in a size reduction. If no size reduction occurs, compression
-	 * is not done and the flag is left cleared.
-	 *
-	 * @return True if compression occurred
-	 */
-	bool compress();
-
-	/**
-	 * Attempt to decompress payload if it is compressed (must be unencrypted)
-	 *
-	 * If payload is compressed, it is decompressed and the compressed verb
-	 * flag is cleared. Otherwise nothing is done and true is returned.
-	 *
-	 * @return True if data is now decompressed and valid, false on error
-	 */
-	bool uncompress();
-
-private:
-	static const uint8_t ZERO_KEY[32];
-	static uint64_t nextPacketId();
-
-	/**
-	 * Deterministically mangle a 256-bit crypto key based on packet
-	 *
-	 * This uses extra data from the packet to mangle the secret, giving us an
-	 * effective IV that is somewhat more than 64 bits. This is "free" for
-	 * Salsa20 since it has negligible key setup time so using a different
-	 * key each time is fine.
-	 *
-	 * @param in Input key (32 bytes)
-	 * @param out Output buffer (32 bytes)
-	 */
-	ZT_ALWAYS_INLINE void _salsa20MangleKey(const uint8_t *in,uint8_t *out) const
-	{
-		const uint8_t *const d = (const unsigned char *)data();
-
-		// IV and source/destination addresses. Using the addresses divides the
-		// key space into two halves-- A->B and B->A (since order will change).
-		for(unsigned int i=0;i<18;++i) // 8 + (ZT_ADDRESS_LENGTH * 2) == 18
-			out[i] = in[i] ^ d[i];
-
-		// Flags, but with hop count masked off. Hop count is altered by forwarding
-		// nodes. It's one of the only parts of a packet modifiable by people
-		// without the key.
-		out[18] = in[18] ^ (d[ZT_PACKET_IDX_FLAGS] & 0xf8U);
-
-		// Raw packet size in bytes -- thus each packet size defines a new
-		// key space.
-		out[19] = in[19] ^ (uint8_t)size();
-		out[20] = in[20] ^ (uint8_t)(size() >> 8U); // little endian
-
-		// Rest of raw key is used unchanged
-		for(unsigned int i=21;i<32;++i)
-			out[i] = in[i];
-	}
-};
-
-} // namespace ZeroTier
-
-#endif

attic/Str.hpp

@@ -1,138 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#ifndef ZT_STR_HPP
-#define ZT_STR_HPP
-
-#include "Constants.hpp"
-#include "Utils.hpp"
-#include "Address.hpp"
-#include "MAC.hpp"
-#include "InetAddress.hpp"
-
-namespace ZeroTier {
-
-/**
- * A short non-allocating replacement for std::string
- *
- * @tparam C Maximum capacity (default: 1021 to make total size 1024)
- */
-template<unsigned long C = 1021>
-class Str
-{
-public:
-	typedef char * iterator;
-	typedef const char * const_iterator;
-
-	ZT_ALWAYS_INLINE Str() { memset(reinterpret_cast<void *>(this),0,sizeof(Str)); }
-	explicit ZT_ALWAYS_INLINE Str(const char *s) { *this = s; }
-
-	ZT_ALWAYS_INLINE Str &operator=(const char *s)
-	{
-		if (s) {
-			unsigned int l = 0;
-			while (l < C) {
-				char c = s[l];
-				if (!c) break;
-				_s[l++] = c;
-			}
-			_s[l] = 0;
-			_l = (uint16_t)l;
-		} else {
-			_l = 0;
-			_s[0] = 0;
-		}
-	}
-
-	ZT_ALWAYS_INLINE char operator[](const unsigned int i) const
-	{
-		if (i >= (unsigned int)_l)
-			return 0;
-		return _s[i];
-	}
-
-	ZT_ALWAYS_INLINE void clear() { _l = 0; _s[0] = 0; }
-	ZT_ALWAYS_INLINE const char *c_str() const { return _s; }
-	ZT_ALWAYS_INLINE unsigned int length() const { return (unsigned int)_l; }
-	ZT_ALWAYS_INLINE bool empty() const { return (_l == 0); }
-
-	ZT_ALWAYS_INLINE iterator begin() { return (iterator)_s; }
-	ZT_ALWAYS_INLINE iterator end() { return (iterator)(_s + (unsigned long)_l); }
-	ZT_ALWAYS_INLINE const_iterator begin() const { return (const_iterator)_s; }
-	ZT_ALWAYS_INLINE const_iterator end() const { return (const_iterator)(_s + (unsigned long)_l); }
-
-	ZT_ALWAYS_INLINE Str &operator<<(const char *s)
-	{
-		if (s) {
-			unsigned int l = _l;
-			while (l < C) {
-				char c = s[l];
-				if (!c) break;
-				_s[l++] = c;
-			}
-			_s[l] = 0;
-			_l = (uint16_t)l;
-		}
-	}
-	ZT_ALWAYS_INLINE Str &operator<<(const Str &s) { return ((*this) << s._s); }
-	ZT_ALWAYS_INLINE Str &operator<<(const char c)
-	{
-		if (_l < C) {
-			_s[_l++] = c;
-			_s[_l] = 0;
-		}
-		return *this;
-	}
-
-	ZT_ALWAYS_INLINE Str &operator<<(const Address &a)
-	{
-		char tmp[32];
-		return ((*this) << a.toString(tmp));
-	}
-	ZT_ALWAYS_INLINE Str &operator<<(const InetAddress &a)
-	{
-		char tmp[128];
-		return ((*this) << a.toString(tmp));
-	}
-	ZT_ALWAYS_INLINE Str &operator<<(const MAC &a)
-	{
-		char tmp[64];
-		return ((*this) << a.toString(tmp));
-	}
-
-	ZT_ALWAYS_INLINE operator bool() const { return (_l != 0); }
-
-	ZT_ALWAYS_INLINE bool operator==(const Str &s) const { return ((_l == s._l)&&(memcmp(_s,s._s,_l) == 0)); }
-	ZT_ALWAYS_INLINE bool operator!=(const Str &s) const { return ((_l != s._l)||(memcmp(_s,s._s,_l) != 0)); }
-	ZT_ALWAYS_INLINE bool operator<(const Str &s) const { return ( (_l < s._l) ? true : ((_l == s._l) ? (memcmp(_s,s._s,_l) < 0) : false) ); }
-	ZT_ALWAYS_INLINE bool operator>(const Str &s) const { return (s < *this); }
-	ZT_ALWAYS_INLINE bool operator<=(const Str &s) const { return !(s < *this); }
-	ZT_ALWAYS_INLINE bool operator>=(const Str &s) const { return !(*this < s); }
-
-	ZT_ALWAYS_INLINE bool operator==(const char *s) const { return (strcmp(_s,s) == 0); }
-	ZT_ALWAYS_INLINE bool operator!=(const char *s) const { return (strcmp(_s,s) != 0); }
-	ZT_ALWAYS_INLINE bool operator<(const char *s) const { return (strcmp(_s,s) < 0); }
-	ZT_ALWAYS_INLINE bool operator>(const char *s) const { return (strcmp(_s,s) > 0); }
-	ZT_ALWAYS_INLINE bool operator<=(const char *s) const { return (strcmp(_s,s) <= 0); }
-	ZT_ALWAYS_INLINE bool operator>=(const char *s) const { return (strcmp(_s,s) >= 0); }
-
-	ZT_ALWAYS_INLINE unsigned long hashCode() const { return Utils::hashString(_s,_l); }
-
-private:
-	uint16_t _l;
-	char _s[C+1];
-};
-
-} // namespace ZeroTier
-
-#endif

attic/Switch.cpp

@@ -1,630 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#include <cstdio>
-#include <algorithm>
-#include <utility>
-
-#include "Constants.hpp"
-#include "RuntimeEnvironment.hpp"
-#include "Switch.hpp"
-#include "Node.hpp"
-#include "InetAddress.hpp"
-#include "Peer.hpp"
-#include "SelfAwareness.hpp"
-#include "Trace.hpp"
-
-namespace ZeroTier {
-
-Switch::Switch(const RuntimeEnvironment *renv) :
-	RR(renv),
-	_lastCheckedQueues(0)
-{
-}
-
-void Switch::onRemotePacket(void *tPtr,const int64_t localSocket,const InetAddress &fromAddr,const void *data,unsigned int len)
-{
-	try {
-		const int64_t now = RR->node->now();
-
-		const SharedPtr<Path> path(RR->topology->getPath(localSocket,fromAddr));
-		path->received(now);
-
-		if (len > ZT_PROTO_MIN_FRAGMENT_LENGTH) { // SECURITY: min length check is important since we do some C-style stuff below!
-			if (reinterpret_cast<const uint8_t *>(data)[ZT_PACKET_FRAGMENT_IDX_FRAGMENT_INDICATOR] == ZT_PACKET_FRAGMENT_INDICATOR) {
-				// Handle fragment ----------------------------------------------------
-
-				Packet::Fragment fragment(data,len);
-				const Address destination(fragment.destination());
-
-				if (destination != RR->identity.address()) {
-					if (fragment.hops() < ZT_RELAY_MAX_HOPS) {
-						fragment.incrementHops();
-						SharedPtr<Peer> relayTo = RR->topology->get(tPtr,destination);
-						if ((!relayTo)||(!relayTo->sendDirect(tPtr,fragment.data(),fragment.size(),now))) {
-							relayTo = RR->topology->root();
-							if (relayTo)
-								relayTo->sendDirect(tPtr,fragment.data(),fragment.size(),now);
-						}
-					}
-				} else {
-					// Fragment looks like ours
-					const uint64_t fragmentPacketId = fragment.packetId();
-					const unsigned int fragmentNumber = fragment.fragmentNumber();
-					const unsigned int totalFragments = fragment.totalFragments();
-
-					if ((totalFragments <= ZT_MAX_PACKET_FRAGMENTS)&&(fragmentNumber < ZT_MAX_PACKET_FRAGMENTS)&&(fragmentNumber > 0)&&(totalFragments > 1)) {
-						// Fragment appears basically sane. Its fragment number must be
-						// 1 or more, since a Packet with fragmented bit set is fragment 0.
-						// Total fragments must be more than 1, otherwise why are we
-						// seeing a Packet::Fragment?
-
-						RXQueueEntry *const rq = _findRXQueueEntry(fragmentPacketId);
-						Mutex::Lock rql(rq->lock);
-						if (rq->packetId != fragmentPacketId) {
-							// No packet found, so we received a fragment without its head.
-
-							rq->timestamp = now;
-							rq->packetId = fragmentPacketId;
-							rq->frags[fragmentNumber - 1] = fragment;
-							rq->totalFragments = totalFragments; // total fragment count is known
-							rq->haveFragments = 1 << fragmentNumber; // we have only this fragment
-							rq->complete = false;
-						} else if (!(rq->haveFragments & (1 << fragmentNumber))) {
-							// We have other fragments and maybe the head, so add this one and check
-
-							rq->frags[fragmentNumber - 1] = fragment;
-							rq->totalFragments = totalFragments;
-
-							if (Utils::countBits(rq->haveFragments |= (1 << fragmentNumber)) == totalFragments) {
-								// We have all fragments -- assemble and process full Packet
-
-								for(unsigned int f=1;f<totalFragments;++f)
-									rq->frag0.append(rq->frags[f - 1].payload(),rq->frags[f - 1].payloadLength());
-
-								if (rq->frag0.tryDecode(RR,tPtr)) {
-									rq->timestamp = 0; // packet decoded, free entry
-								} else {
-									rq->complete = true; // set complete flag but leave entry since it probably needs WHOIS or something
-								}
-							}
-						} // else this is a duplicate fragment, ignore
-					}
-				}
-
-				// --------------------------------------------------------------------
-			} else if (len >= ZT_PROTO_MIN_PACKET_LENGTH) { // min length check is important!
-				// Handle packet head -------------------------------------------------
-
-				const Address destination(reinterpret_cast<const uint8_t *>(data) + 8,ZT_ADDRESS_LENGTH);
-				const Address source(reinterpret_cast<const uint8_t *>(data) + 13,ZT_ADDRESS_LENGTH);
-
-				if (source == RR->identity.address())
-					return;
-
-				if (destination != RR->identity.address()) {
-					// This packet is not for this node, so possibly relay it ----------
-
-					Packet packet(data,len);
-					if (packet.hops() < ZT_RELAY_MAX_HOPS) {
-						packet.incrementHops();
-						SharedPtr<Peer> relayTo = RR->topology->get(tPtr,destination);
-						if ((!relayTo)||(!relayTo->sendDirect(tPtr,packet.data(),packet.size(),now))) {
-							relayTo = RR->topology->root();
-							if ((relayTo)&&(relayTo->address() != source))
-								relayTo->sendDirect(tPtr,packet.data(),packet.size(),now);
-						}
-					}
-
-				} else if ((reinterpret_cast<const uint8_t *>(data)[ZT_PACKET_IDX_FLAGS] & ZT_PROTO_FLAG_FRAGMENTED) != 0) {
-					// Packet is the head of a fragmented packet series ----------------
-
-					const uint64_t packetId = (
-						(((uint64_t)reinterpret_cast<const uint8_t *>(data)[0]) << 56U) |
-						(((uint64_t)reinterpret_cast<const uint8_t *>(data)[1]) << 48U) |
-						(((uint64_t)reinterpret_cast<const uint8_t *>(data)[2]) << 40U) |
-						(((uint64_t)reinterpret_cast<const uint8_t *>(data)[3]) << 32U) |
-						(((uint64_t)reinterpret_cast<const uint8_t *>(data)[4]) << 24U) |
-						(((uint64_t)reinterpret_cast<const uint8_t *>(data)[5]) << 16U) |
-						(((uint64_t)reinterpret_cast<const uint8_t *>(data)[6]) << 8U) |
-						((uint64_t)reinterpret_cast<const uint8_t *>(data)[7])
-					);
-
-					RXQueueEntry *const rq = _findRXQueueEntry(packetId);
-					Mutex::Lock rql(rq->lock);
-					if (rq->packetId != packetId) {
-						// If we have no other fragments yet, create an entry and save the head
-
-						rq->timestamp = now;
-						rq->packetId = packetId;
-						rq->frag0.init(data,len,path,now);
-						rq->totalFragments = 0;
-						rq->haveFragments = 1;
-						rq->complete = false;
-					} else if (!(rq->haveFragments & 1)) {
-						// Check if packet is complete -----------------------------------
-
-						if ((rq->totalFragments > 1)&&(Utils::countBits(rq->haveFragments |= 1) == rq->totalFragments)) {
-							// We have all fragments -- assemble and process full Packet ---
-
-							rq->frag0.init(data,len,path,now);
-							for(unsigned int f=1;f<rq->totalFragments;++f)
-								rq->frag0.append(rq->frags[f - 1].payload(),rq->frags[f - 1].payloadLength());
-
-							if (rq->frag0.tryDecode(RR,tPtr)) {
-								rq->timestamp = 0; // packet decoded, free entry
-							} else {
-								rq->complete = true; // set complete flag but leave entry since it probably needs WHOIS or something
-							}
-
-						} else {
-							// Still waiting on more fragments, but keep the head ----------
-
-							rq->frag0.init(data,len,path,now);
-
-						}
-					} // else this is a duplicate head, ignore
-				} else {
-
-					// Packet is unfragmented, so just process it ----------------------
-					IncomingPacket packet(data,len,path,now);
-					if (!packet.tryDecode(RR,tPtr)) {
-						RXQueueEntry *const rq = _nextRXQueueEntry();
-						Mutex::Lock rql(rq->lock);
-						rq->timestamp = now;
-						rq->packetId = packet.packetId();
-						rq->frag0 = packet;
-						rq->totalFragments = 1;
-						rq->haveFragments = 1;
-						rq->complete = true;
-					}
-
-				}
-
-				// --------------------------------------------------------------------
-			}
-		}
-	} catch ( ... ) {} // sanity check, should be caught elsewhere
-}
-
-void Switch::onLocalEthernet(void *tPtr,const SharedPtr<Network> &network,const MAC &from,const MAC &to,unsigned int etherType,unsigned int vlanId,const void *data,unsigned int len)
-{
-	if (!network->hasConfig())
-		return;
-
-	// Check if this packet is from someone other than the tap -- i.e. bridged in
-	bool fromBridged;
-	if ((fromBridged = (from != network->mac()))) {
-		if (!network->config().permitsBridging(RR->identity.address())) {
-			RR->t->outgoingNetworkFrameDropped(tPtr,network->id(),from,to,(uint16_t)etherType,(uint16_t)len,(const uint8_t *)data,ZT_TRACE_FRAME_DROP_REASON_BRIDGING_NOT_ALLOWED_LOCAL);
-			return;
-		}
-	}
-
-	uint8_t qosBucket = 0;
-
-	if (to.isMulticast()) {
-		MulticastGroup multicastGroup(to,0);
-
-		if (to.isBroadcast()) {
-			if ( (etherType == ZT_ETHERTYPE_ARP) && (len >= 28) && ((((const uint8_t *)data)[2] == 0x08)&&(((const uint8_t *)data)[3] == 0x00)&&(((const uint8_t *)data)[4] == 6)&&(((const uint8_t *)data)[5] == 4)&&(((const uint8_t *)data)[7] == 0x01)) ) {
-				/* IPv4 ARP is one of the few special cases that we impose upon what is
-				 * otherwise a straightforward Ethernet switch emulation. Vanilla ARP
-				 * is dumb old broadcast and simply doesn't scale. ZeroTier multicast
-				 * groups have an additional field called ADI (additional distinguishing
-			   * information) which was added specifically for ARP though it could
-				 * be used for other things too. We then take ARP broadcasts and turn
-				 * them into multicasts by stuffing the IP address being queried into
-				 * the 32-bit ADI field. In practice this uses our multicast pub/sub
-				 * system to implement a kind of extended/distributed ARP table. */
-				multicastGroup = MulticastGroup::deriveMulticastGroupForAddressResolution(InetAddress(((const unsigned char *)data) + 24,4,0));
-			} else if (!network->config().enableBroadcast()) {
-				// Don't transmit broadcasts if this network doesn't want them
-				RR->t->outgoingNetworkFrameDropped(tPtr,network->id(),from,to,(uint16_t)etherType,(uint16_t)len,(const uint8_t *)data,ZT_TRACE_FRAME_DROP_REASON_BROADCAST_DISABLED);
-				return;
-			}
-		} else if ((etherType == ZT_ETHERTYPE_IPV6)&&(len >= (40 + 8 + 16))) {
-			// IPv6 NDP emulation for certain very special patterns of private IPv6 addresses -- if enabled
-			if ((network->config().ndpEmulation())&&(reinterpret_cast<const uint8_t *>(data)[6] == 0x3a)&&(reinterpret_cast<const uint8_t *>(data)[40] == 0x87)) { // ICMPv6 neighbor solicitation
-				Address v6EmbeddedAddress;
-				const uint8_t *const pkt6 = reinterpret_cast<const uint8_t *>(data) + 40 + 8;
-				const uint8_t *my6 = (const uint8_t *)0;
-
-				// ZT-RFC4193 address: fdNN:NNNN:NNNN:NNNN:NN99:93DD:DDDD:DDDD / 88 (one /128 per actual host)
-
-				// ZT-6PLANE address:  fcXX:XXXX:XXDD:DDDD:DDDD:####:####:#### / 40 (one /80 per actual host)
-				// (XX - lower 32 bits of network ID XORed with higher 32 bits)
-
-				// For these to work, we must have a ZT-managed address assigned in one of the
-				// above formats, and the query must match its prefix.
-				for(unsigned int sipk=0;sipk<network->config().staticIpCount;++sipk) {
-					const InetAddress *const sip = &(network->config().staticIps[sipk]);
-					if (sip->ss_family == AF_INET6) {
-						my6 = reinterpret_cast<const uint8_t *>(reinterpret_cast<const struct sockaddr_in6 *>(&(*sip))->sin6_addr.s6_addr);
-						const unsigned int sipNetmaskBits = Utils::ntoh((uint16_t)reinterpret_cast<const struct sockaddr_in6 *>(&(*sip))->sin6_port);
-						if ((sipNetmaskBits == 88)&&(my6[0] == 0xfd)&&(my6[9] == 0x99)&&(my6[10] == 0x93)) { // ZT-RFC4193 /88 ???
-							unsigned int ptr = 0;
-							while (ptr != 11) {
-								if (pkt6[ptr] != my6[ptr])
-									break;
-								++ptr;
-							}
-							if (ptr == 11) { // prefix match!
-								v6EmbeddedAddress.setTo(pkt6 + ptr,5);
-								break;
-							}
-						} else if (sipNetmaskBits == 40) { // ZT-6PLANE /40 ???
-							const uint32_t nwid32 = (uint32_t)((network->id() ^ (network->id() >> 32U)) & 0xffffffffU);
-							if ( (my6[0] == 0xfc) && (my6[1] == (uint8_t)((nwid32 >> 24U) & 0xffU)) && (my6[2] == (uint8_t)((nwid32 >> 16U) & 0xffU)) && (my6[3] == (uint8_t)((nwid32 >> 8U) & 0xffU)) && (my6[4] == (uint8_t)(nwid32 & 0xffU))) {
-								unsigned int ptr = 0;
-								while (ptr != 5) {
-									if (pkt6[ptr] != my6[ptr])
-										break;
-									++ptr;
-								}
-								if (ptr == 5) { // prefix match!
-									v6EmbeddedAddress.setTo(pkt6 + ptr,5);
-									break;
-								}
-							}
-						}
-					}
-				}
-
-				if ((v6EmbeddedAddress)&&(v6EmbeddedAddress != RR->identity.address())) {
-					const MAC peerMac(v6EmbeddedAddress,network->id());
-
-					uint8_t adv[72];
-					adv[0] = 0x60; adv[1] = 0x00; adv[2] = 0x00; adv[3] = 0x00;
-					adv[4] = 0x00; adv[5] = 0x20;
-					adv[6] = 0x3a; adv[7] = 0xff;
-					for(int i=0;i<16;++i) adv[8 + i] = pkt6[i];
-					for(int i=0;i<16;++i) adv[24 + i] = my6[i];
-					adv[40] = 0x88; adv[41] = 0x00;
-					adv[42] = 0x00; adv[43] = 0x00; // future home of checksum
-					adv[44] = 0x60; adv[45] = 0x00; adv[46] = 0x00; adv[47] = 0x00;
-					for(int i=0;i<16;++i) adv[48 + i] = pkt6[i];
-					adv[64] = 0x02; adv[65] = 0x01;
-					adv[66] = peerMac[0]; adv[67] = peerMac[1]; adv[68] = peerMac[2]; adv[69] = peerMac[3]; adv[70] = peerMac[4]; adv[71] = peerMac[5];
-
-					uint16_t pseudo_[36];
-					uint8_t *const pseudo = reinterpret_cast<uint8_t *>(pseudo_);
-					for(int i=0;i<32;++i) pseudo[i] = adv[8 + i];
-					pseudo[32] = 0x00; pseudo[33] = 0x00; pseudo[34] = 0x00; pseudo[35] = 0x20;
-					pseudo[36] = 0x00; pseudo[37] = 0x00; pseudo[38] = 0x00; pseudo[39] = 0x3a;
-					for(int i=0;i<32;++i) pseudo[40 + i] = adv[40 + i];
-					uint32_t checksum = 0;
-					for(int i=0;i<36;++i) checksum += Utils::hton(pseudo_[i]);
-					while ((checksum >> 16U)) checksum = (checksum & 0xffffU) + (checksum >> 16U);
-					checksum = ~checksum;
-					adv[42] = (checksum >> 8U) & 0xffU;
-					adv[43] = checksum & 0xffU;
-
-					RR->node->putFrame(tPtr,network->id(),network->userPtr(),peerMac,from,ZT_ETHERTYPE_IPV6,0,adv,72);
-					return; // NDP emulation done. We have forged a "fake" reply, so no need to send actual NDP query.
-				} // else no NDP emulation
-			} // else no NDP emulation
-		}
-
-		// Check this after NDP emulation, since that has to be allowed in exactly this case
-		if (network->config().multicastLimit == 0) {
-			RR->t->outgoingNetworkFrameDropped(tPtr,network->id(),from,to,(uint16_t)etherType,(uint16_t)len,(const uint8_t *)data,ZT_TRACE_FRAME_DROP_REASON_MULTICAST_DISABLED);
-			return;
-		}
-
-		/* Learn multicast groups for bridged-in hosts.
-		 * Note that some OSes, most notably Linux, do this for you by learning
-		 * multicast addresses on bridge interfaces and subscribing each slave.
-		 * But in that case this does no harm, as the sets are just merged. */
-		if (fromBridged)
-			network->learnBridgedMulticastGroup(tPtr,multicastGroup,RR->node->now());
-
-		// First pass sets noTee to false, but noTee is set to true in OutboundMulticast to prevent duplicates.
-		if (!network->filterOutgoingPacket(tPtr,false,RR->identity.address(),Address(),from,to,(const uint8_t *)data,len,etherType,vlanId,qosBucket)) {
-			RR->t->outgoingNetworkFrameDropped(tPtr,network->id(),from,to,(uint16_t)etherType,(uint16_t)len,(const uint8_t *)data,ZT_TRACE_FRAME_DROP_REASON_FILTER_BLOCKED);
-			return;
-		}
-
-		// TODO
-		/*
-		RR->mc->send(
-			tPtr,
-			RR->node->now(),
-			network,
-			Address(),
-			multicastGroup,
-			(fromBridged) ? from : MAC(),
-			etherType,
-			data,
-			len);
-		*/
-	} else if (to == network->mac()) {
-		// Destination is this node, so just reinject it -------------------------
-
-		RR->node->putFrame(tPtr,network->id(),network->userPtr(),from,to,etherType,vlanId,data,len);
-
-	} else if (to[0] == MAC::firstOctetForNetwork(network->id())) {
-		// Destination is another ZeroTier peer on the same network --------------
-
-		Address toZT(to.toAddress(network->id())); // since in-network MACs are derived from addresses and network IDs, we can reverse this
-		SharedPtr<Peer> toPeer(RR->topology->get(tPtr,toZT));
-
-		if (!network->filterOutgoingPacket(tPtr,false,RR->identity.address(),toZT,from,to,(const uint8_t *)data,len,etherType,vlanId,qosBucket)) {
-			RR->t->outgoingNetworkFrameDropped(tPtr,network->id(),from,to,(uint16_t)etherType,(uint16_t)len,(const uint8_t *)data,ZT_TRACE_FRAME_DROP_REASON_FILTER_BLOCKED);
-			return;
-		}
-
-		network->pushCredentialsIfNeeded(tPtr,toZT,RR->node->now());
-
-		if (fromBridged) {
-			Packet outp(toZT,RR->identity.address(),Packet::VERB_EXT_FRAME);
-			outp.append(network->id());
-			outp.append((unsigned char)0x00);
-			to.appendTo(outp);
-			from.appendTo(outp);
-			outp.append((uint16_t)etherType);
-			outp.append(data,len);
-		} else {
-			Packet outp(toZT,RR->identity.address(),Packet::VERB_FRAME);
-			outp.append(network->id());
-			outp.append((uint16_t)etherType);
-			outp.append(data,len);
-		}
-	} else {
-		// Destination is bridged behind a remote peer ---------------------------
-
-		// We filter with a NULL destination ZeroTier address first. Filtrations
-		// for each ZT destination are also done below. This is the same rationale
-		// and design as for multicast.
-		if (!network->filterOutgoingPacket(tPtr,false,RR->identity.address(),Address(),from,to,(const uint8_t *)data,len,etherType,vlanId,qosBucket)) {
-			RR->t->outgoingNetworkFrameDropped(tPtr,network->id(),from,to,(uint16_t)etherType,(uint16_t)len,(const uint8_t *)data,ZT_TRACE_FRAME_DROP_REASON_FILTER_BLOCKED);
-			return;
-		}
-
-		Address bridges[ZT_MAX_BRIDGE_SPAM];
-		unsigned int numBridges = 0;
-
-		/* Create an array of up to ZT_MAX_BRIDGE_SPAM recipients for this bridged frame. */
-		bridges[0] = network->findBridgeTo(to);
-		std::vector<Address> activeBridges;
-		for(unsigned int i=0;i<network->config().specialistCount;++i) {
-			if ((network->config().specialists[i] & ZT_NETWORKCONFIG_SPECIALIST_TYPE_ACTIVE_BRIDGE) != 0)
-				activeBridges.push_back(Address(network->config().specialists[i]));
-		}
-		if ((bridges[0])&&(bridges[0] != RR->identity.address())&&(network->config().permitsBridging(bridges[0]))) {
-			/* We have a known bridge route for this MAC, send it there. */
-			++numBridges;
-		} else if (!activeBridges.empty()) {
-			/* If there is no known route, spam to up to ZT_MAX_BRIDGE_SPAM active
-			 * bridges. If someone responds, we'll learn the route. */
-			std::vector<Address>::const_iterator ab(activeBridges.begin());
-			if (activeBridges.size() <= ZT_MAX_BRIDGE_SPAM) {
-				// If there are <= ZT_MAX_BRIDGE_SPAM active bridges, spam them all
-				while (ab != activeBridges.end()) {
-					bridges[numBridges++] = *ab;
-					++ab;
-				}
-			} else {
-				// Otherwise pick a random set of them
-				while (numBridges < ZT_MAX_BRIDGE_SPAM) {
-					if (ab == activeBridges.end())
-						ab = activeBridges.begin();
-					if (((unsigned long)Utils::random() % (unsigned long)activeBridges.size()) == 0) {
-						bridges[numBridges++] = *ab;
-						++ab;
-					} else ++ab;
-				}
-			}
-		}
-
-		for(unsigned int b=0;b<numBridges;++b) {
-			if (network->filterOutgoingPacket(tPtr,true,RR->identity.address(),bridges[b],from,to,(const uint8_t *)data,len,etherType,vlanId,qosBucket)) {
-				Packet outp(bridges[b],RR->identity.address(),Packet::VERB_EXT_FRAME);
-				outp.append(network->id());
-				outp.append((uint8_t)0x00);
-				to.appendTo(outp);
-				from.appendTo(outp);
-				outp.append((uint16_t)etherType);
-				outp.append(data,len);
-			} else {
-				RR->t->outgoingNetworkFrameDropped(tPtr,network->id(),from,to,(uint16_t)etherType,(uint16_t)len,(const uint8_t *)data,ZT_TRACE_FRAME_DROP_REASON_FILTER_BLOCKED_AT_BRIDGE_REPLICATION);
-			}
-		}
-	}
-}
-
-void Switch::send(void *tPtr,Packet &packet,bool encrypt)
-{
-	const Address dest(packet.destination());
-	if (dest == RR->identity.address())
-		return;
-	if (!_trySend(tPtr,packet,encrypt)) {
-		{
-			Mutex::Lock _l(_txQueue_m);
-			if (_txQueue.size() >= ZT_TX_QUEUE_SIZE) {
-				_txQueue.pop_front();
-			}
-			_txQueue.push_back(TXQueueEntry(dest,RR->node->now(),packet,encrypt));
-		}
-		if (!RR->topology->get(tPtr,dest))
-			requestWhois(tPtr,RR->node->now(),dest);
-	}
-}
-
-void Switch::requestWhois(void *tPtr,const int64_t now,const Address &addr)
-{
-	if (addr == RR->identity.address())
-		return;
-
-	{
-		Mutex::Lock _l(_lastSentWhoisRequest_m);
-		int64_t &last = _lastSentWhoisRequest[addr];
-		if ((now - last) < ZT_WHOIS_RETRY_DELAY)
-			return;
-		else last = now;
-	}
-
-	const SharedPtr<Peer> root(RR->topology->root());
-	if (root) {
-		Packet outp(root->address(),RR->identity.address(),Packet::VERB_WHOIS);
-		addr.appendTo(outp);
-		RR->node->expectReplyTo(outp.packetId());
-		root->sendDirect(tPtr,outp.data(),outp.size(),now);
-	}
-}
-
-void Switch::doAnythingWaitingForPeer(void *tPtr,const SharedPtr<Peer> &peer)
-{
-	{
-		Mutex::Lock _l(_lastSentWhoisRequest_m);
-		_lastSentWhoisRequest.erase(peer->address());
-	}
-
-	const int64_t now = RR->node->now();
-	for(unsigned int ptr=0;ptr<ZT_RX_QUEUE_SIZE;++ptr) {
-		RXQueueEntry *const rq = &(_rxQueue[ptr]);
-		Mutex::Lock rql(rq->lock);
-		if ((rq->timestamp)&&(rq->complete)) {
-			if ((rq->frag0.tryDecode(RR,tPtr))||((now - rq->timestamp) > ZT_RECEIVE_QUEUE_TIMEOUT))
-				rq->timestamp = 0;
-		}
-	}
-
-	{
-		Mutex::Lock _l(_txQueue_m);
-		for(std::list< TXQueueEntry >::iterator txi(_txQueue.begin());txi!=_txQueue.end();) {
-			if (txi->dest == peer->address()) {
-				if (_trySend(tPtr,txi->packet,txi->encrypt)) {
-					_txQueue.erase(txi++);
-				} else {
-					++txi;
-				}
-			} else {
-				++txi;
-			}
-		}
-	}
-}
-
-unsigned long Switch::doTimerTasks(void *tPtr,int64_t now)
-{
-	const uint64_t timeSinceLastCheck = now - _lastCheckedQueues;
-	if (timeSinceLastCheck < ZT_WHOIS_RETRY_DELAY)
-		return (unsigned long)(ZT_WHOIS_RETRY_DELAY - timeSinceLastCheck);
-	_lastCheckedQueues = now;
-
-	std::vector<Address> needWhois;
-	{
-		Mutex::Lock _l(_txQueue_m);
-
-		for(std::list< TXQueueEntry >::iterator txi(_txQueue.begin());txi!=_txQueue.end();) {
-			if (_trySend(tPtr,txi->packet,txi->encrypt)) {
-				_txQueue.erase(txi++);
-			} else if ((now - txi->creationTime) > ZT_TRANSMIT_QUEUE_TIMEOUT) {
-				_txQueue.erase(txi++);
-			} else {
-				if (!RR->topology->get(tPtr,txi->dest))
-					needWhois.push_back(txi->dest);
-				++txi;
-			}
-		}
-	}
-	for(std::vector<Address>::const_iterator i(needWhois.begin());i!=needWhois.end();++i)
-		requestWhois(tPtr,now,*i);
-
-	for(unsigned int ptr=0;ptr<ZT_RX_QUEUE_SIZE;++ptr) {
-		RXQueueEntry *const rq = &(_rxQueue[ptr]);
-		Mutex::Lock rql(rq->lock);
-		if ((rq->timestamp)&&(rq->complete)) {
-			if ((rq->frag0.tryDecode(RR,tPtr))||((now - rq->timestamp) > ZT_RECEIVE_QUEUE_TIMEOUT)) {
-				rq->timestamp = 0;
-			} else {
-				const Address src(rq->frag0.source());
-				if (!RR->topology->get(tPtr,src))
-					requestWhois(tPtr,now,src);
-			}
-		}
-	}
-
-	{
-		Mutex::Lock _l(_lastSentWhoisRequest_m);
-		Hashtable< Address,int64_t >::Iterator i(_lastSentWhoisRequest);
-		Address *a = (Address *)0;
-		int64_t *ts = (int64_t *)0;
-		while (i.next(a,ts)) {
-			if ((now - *ts) > (ZT_WHOIS_RETRY_DELAY * 2))
-				_lastSentWhoisRequest.erase(*a);
-		}
-	}
-
-	return ZT_WHOIS_RETRY_DELAY;
-}
-
-bool Switch::_trySend(void *tPtr,Packet &packet,bool encrypt)
-{
-	const int64_t now = RR->node->now();
-	const SharedPtr<Peer> peer(RR->topology->get(tPtr,packet.destination()));
-	SharedPtr<Path> viaPath;
-	if (peer) {
-		viaPath = peer->path(now);
-		if (!viaPath) {
-			const SharedPtr<Peer> relay(RR->topology->root());
-			if (relay) {
-				viaPath = relay->path(now);
-				if (!viaPath)
-					return false;
-			} else {
-				return false;
-			}
-		}
-	} else {
-		return false;
-	}
-
-	unsigned int mtu = ZT_DEFAULT_PHYSMTU;
-	uint64_t trustedPathId = 0;
-	RR->topology->getOutboundPathInfo(viaPath->address(),mtu,trustedPathId);
-
-	unsigned int chunkSize = std::min(packet.size(),mtu);
-	packet.setFragmented(chunkSize < packet.size());
-
-	if (trustedPathId) {
-		packet.setTrusted(trustedPathId);
-	} else {
-		packet.armor(peer->key(),encrypt);
-	}
-
-	if (viaPath->send(RR,tPtr,packet.data(),chunkSize,now)) {
-		if (chunkSize < packet.size()) {
-			// Too big for one packet, fragment the rest
-			unsigned int fragStart = chunkSize;
-			unsigned int remaining = packet.size() - chunkSize;
-			unsigned int fragsRemaining = (remaining / (mtu - ZT_PROTO_MIN_FRAGMENT_LENGTH));
-			if ((fragsRemaining * (mtu - ZT_PROTO_MIN_FRAGMENT_LENGTH)) < remaining)
-				++fragsRemaining;
-			const unsigned int totalFragments = fragsRemaining + 1;
-
-			for(unsigned int fno=1;fno<totalFragments;++fno) {
-				chunkSize = std::min(remaining,(unsigned int)(mtu - ZT_PROTO_MIN_FRAGMENT_LENGTH));
-				Packet::Fragment frag(packet,fragStart,chunkSize,fno,totalFragments);
-				viaPath->send(RR,tPtr,frag.data(),frag.size(),now);
-				fragStart += chunkSize;
-				remaining -= chunkSize;
-			}
-		}
-	}
-
-	return true;
-}
-
-} // namespace ZeroTier

attic/Switch.hpp

@@ -1,192 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-#ifndef ZT_N_SWITCH_HPP
-#define ZT_N_SWITCH_HPP
-
-#include <map>
-#include <set>
-#include <vector>
-#include <list>
-
-#include "Constants.hpp"
-#include "Mutex.hpp"
-#include "MAC.hpp"
-#include "Utils.hpp"
-#include "InetAddress.hpp"
-#include "Topology.hpp"
-#include "Network.hpp"
-#include "SharedPtr.hpp"
-#include "IncomingPacket.hpp"
-#include "Hashtable.hpp"
-#include "Protocol.hpp"
-
-namespace ZeroTier {
-
-class RuntimeEnvironment;
-class Peer;
-
-/**
- * Core of the distributed Ethernet switch and protocol implementation
- *
- * This class is perhaps a bit misnamed, but it's basically where everything
- * meets. Transport-layer ZT packets come in here, as do virtual network
- * packets from tap devices, and this sends them where they need to go and
- * wraps/unwraps accordingly. It also handles queues and timeouts and such.
- */
-class Switch
-{
-public:
-	explicit Switch(const RuntimeEnvironment *renv);
-
-	/**
-	 * Called when a packet is received from the real network
-	 *
-	 * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
-	 * @param localSocket Local I/O socket as supplied by external code
-	 * @param fromAddr Internet IP address of origin
-	 * @param data Packet data
-	 * @param len Packet length
-	 */
-	void onRemotePacket(void *tPtr,int64_t localSocket,const InetAddress &fromAddr,const void *data,unsigned int len);
-
-	/**
-	 * Called when a packet comes from a local Ethernet tap
-	 *
-	 * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
-	 * @param network Which network's TAP did this packet come from?
-	 * @param from Originating MAC address
-	 * @param to Destination MAC address
-	 * @param etherType Ethernet packet type
-	 * @param vlanId VLAN ID or 0 if none
-	 * @param data Ethernet payload
-	 * @param len Frame length
-	 */
-	void onLocalEthernet(void *tPtr,const SharedPtr<Network> &network,const MAC &from,const MAC &to,unsigned int etherType,unsigned int vlanId,const void *data,unsigned int len);
-
-	/**
-	 * Send a packet to a ZeroTier address (destination in packet)
-	 *
-	 * The packet must be fully composed with source and destination but not
-	 * yet encrypted. If the destination peer is known the packet
-	 * is sent immediately. Otherwise it is queued and a WHOIS is dispatched.
-	 *
-	 * The packet may be compressed. Compression isn't done here.
-	 *
-	 * Needless to say, the packet's source must be this node. Otherwise it
-	 * won't be encrypted right. (This is not used for relaying.)
-	 *
-	 * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
-	 * @param packet Packet to send (buffer may be modified)
-	 * @param encrypt Encrypt packet payload? (always true except for HELLO)
-	 */
-	void send(void *tPtr,Packet &packet,bool encrypt);
-
-	/**
-	 * Request WHOIS on a given address
-	 *
-	 * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
-	 * @param now Current time
-	 * @param addr Address to look up
-	 */
-	void requestWhois(void *tPtr,int64_t now,const Address &addr);
-
-	/**
-	 * Run any processes that are waiting for this peer's identity
-	 *
-	 * Called when we learn of a peer's identity from HELLO, OK(WHOIS), etc.
-	 *
-	 * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
-	 * @param peer New peer
-	 */
-	void doAnythingWaitingForPeer(void *tPtr,const SharedPtr<Peer> &peer);
-
-	/**
-	 * Perform retries and other periodic timer tasks
-	 *
-	 * This can return a very long delay if there are no pending timer
-	 * tasks. The caller should cap this comparatively vs. other values.
-	 *
-	 * @param tPtr Thread pointer to be handed through to any callbacks called as a result of this call
-	 * @param now Current time
-	 * @return Number of milliseconds until doTimerTasks() should be run again
-	 */
-	unsigned long doTimerTasks(void *tPtr,int64_t now);
-
-private:
-	bool _trySend(void *tPtr,Packet &packet,bool encrypt); // packet is modified if return is true
-
-	const RuntimeEnvironment *const RR;
-	volatile int64_t _lastCheckedQueues;
-
-	// Time we last sent a WHOIS request for each address
-	Hashtable< Address,int64_t > _lastSentWhoisRequest;
-	Mutex _lastSentWhoisRequest_m;
-
-	// Packets waiting for WHOIS replies or other decode info or missing fragments
-	struct RXQueueEntry
-	{
-		ZT_ALWAYS_INLINE RXQueueEntry() : timestamp(0) {}
-		volatile int64_t timestamp; // 0 if entry is not in use
-		volatile uint64_t packetId;
-		IncomingPacket frag0; // head of packet
-		Packet::Fragment frags[ZT_MAX_PACKET_FRAGMENTS - 1]; // later fragments (if any)
-		unsigned int totalFragments; // 0 if only frag0 received, waiting for frags
-		uint32_t haveFragments; // bit mask, LSB to MSB
-		volatile bool complete; // if true, packet is complete
-		Mutex lock;
-	};
-	RXQueueEntry _rxQueue[ZT_RX_QUEUE_SIZE];
-	AtomicCounter<unsigned int> _rxQueuePtr;
-
-	// Returns matching or next available RX queue entry
-	ZT_ALWAYS_INLINE RXQueueEntry *_findRXQueueEntry(uint64_t packetId)
-	{
-		const unsigned int current = static_cast<unsigned int>(_rxQueuePtr.load());
-		for(unsigned int k=1;k<=ZT_RX_QUEUE_SIZE;++k) {
-			RXQueueEntry *rq = &(_rxQueue[(current - k) % ZT_RX_QUEUE_SIZE]);
-			if ((rq->packetId == packetId)&&(rq->timestamp))
-				return rq;
-		}
-		++_rxQueuePtr;
-		return &(_rxQueue[static_cast<unsigned int>(current) % ZT_RX_QUEUE_SIZE]);
-	}
-
-	// Returns current entry in rx queue ring buffer and increments ring pointer
-	ZT_ALWAYS_INLINE RXQueueEntry *_nextRXQueueEntry()
-	{
-		return &(_rxQueue[static_cast<unsigned int>((++_rxQueuePtr) - 1) % ZT_RX_QUEUE_SIZE]);
-	}
-
-	// ZeroTier-layer TX queue entry
-	struct TXQueueEntry
-	{
-		ZT_ALWAYS_INLINE TXQueueEntry() {}
-		ZT_ALWAYS_INLINE TXQueueEntry(Address d,uint64_t ct,const Packet &p,bool enc) :
-			dest(d),
-			creationTime(ct),
-			packet(p),
-			encrypt(enc) {}
-
-		Address dest;
-		uint64_t creationTime;
-		Packet packet; // unencrypted/unMAC'd packet -- this is done at send time
-		bool encrypt;
-	};
-	std::list< TXQueueEntry > _txQueue;
-	Mutex _txQueue_m;
-};
-
-} // namespace ZeroTier
-
-#endif

attic/ZeroTierDebug.h

@@ -1,104 +0,0 @@
-/*
- * Copyright (c)2013-2020 ZeroTier, Inc.
- *
- * Use of this software is governed by the Business Source License included
- * in the LICENSE.TXT file in the project's root directory.
- *
- * Change Date: 2024-01-01
- *
- * On the date above, in accordance with the Business Source License, use
- * of this software will be governed by version 2.0 of the Apache License.
- */
-/****/
-
-/**
- * @file
- *
- * Debug macros
- */
-
-#ifndef ZT_DEBUG_H
-#define ZT_DEBUG_H
-
-#if defined(__linux__) || defined(__APPLE__)
-#include <sys/syscall.h>
-#include <pthread.h>
-#include <unistd.h>
-#endif
-
-#include <string.h>
-
-#define ZT_MSG_INFO        true
-#define ZT_COLOR           true
-
-// Debug output colors
-#if defined(__APPLE__)
-		#include "TargetConditionals.h"
-#endif
-#if defined(ZT_COLOR) && !defined(_WIN32) && !defined(__ANDROID__) && !defined(TARGET_OS_IPHONE) && !defined(TARGET_IPHONE_SIMULATOR) && !defined(__APP_FRAMEWORK__)
-	#define ZT_RED   "\x1B[31m"
-	#define ZT_GRN   "\x1B[32m"
-	#define ZT_YEL   "\x1B[33m"
-	#define ZT_BLU   "\x1B[34m"
-	#define ZT_MAG   "\x1B[35m"
-	#define ZT_CYN   "\x1B[36m"
-	#define ZT_WHT   "\x1B[37m"
-	#define ZT_RESET "\x1B[0m"
-#else
-	#define ZT_RED
-	#define ZT_GRN
-	#define ZT_YEL
-	#define ZT_BLU
-	#define ZT_MAG
-	#define ZT_CYN
-	#define ZT_WHT
-	#define ZT_RESET
-#endif
-
-#define ZT_FILENAME (strrchr(__FILE__, '/') ? strrchr(__FILE__, '/') + 1 : __FILE__) // short
-
-#ifdef __linux__
-  #define ZT_THREAD_ID (long)0 // syscall(SYS_gettid)
-#endif
-#ifdef __APPLE__
-  #define ZT_THREAD_ID (long)0 // (long)gettid()
-#endif
-#ifdef __FreeBSD__
-  #define ZT_THREAD_ID (long)0 // (long)gettid()
-#endif
-#ifdef _WIN32
-  #define ZT_THREAD_ID (long)0 //
-#endif
-#if defined(__JNI_LIB__)
-		#include <jni.h>
-#endif
-#if defined(__ANDROID__)
-		#include <android/log.h>
-		#define ZT_LOG_TAG "ZTSDK"
-#endif
-#if defined(ZT_DEBUG_TRACE)
-	#if ZT_MSG_INFO == true
-		#if defined(__ANDROID__)
-			#define DEBUG_INFO(fmt, args...) ((void)__android_log_print(ANDROID_LOG_VERBOSE, ZT_LOG_TAG, \
-				"INFO : %17s:%5d:%20s: " fmt "\n", ZT_FILENAME, __LINE__, __FUNCTION__, ##args))
-		#endif
-		#if defined(_WIN32)
-			#define DEBUG_INFO(fmt, ...) fprintf(stderr, ZT_GRN "INFO [%ld]: %17s:%5d:%25s: " fmt "\n" \
-					ZT_RESET, ZT_THREAD_ID, ZT_FILENAME, __LINE__, __FUNCTION__, __VA_ARGS__)
-		#endif
-		#if defined(__linux__) or defined(__APPLE__) or defined(__FreeBSD__)
-			#define DEBUG_INFO(fmt, args ...) fprintf(stderr, ZT_GRN "INFO [%ld]: %17s:%5d:%25s: " fmt "\n" \
-					ZT_RESET, ZT_THREAD_ID, ZT_FILENAME, __LINE__, __FUNCTION__, ##args)
-		#endif
-	#else
-		#define DEBUG_INFO(fmt, args...)
-	#endif
-#else // blank
-	#if defined(_WIN32)
-		#define DEBUG_INFO(...)
-	#else
-		#define DEBUG_INFO(fmt, args...)
-	#endif
-#endif
-
-#endif // _H

attic/objects.mk

@@ -1,40 +0,0 @@
-CORE_OBJS=\
-	node/AES.o \
-	node/C25519.o \
-	node/Credential.o \
-	node/ECC384.o \
-	node/Identity.o \
-	node/IncomingPacket.o \
-	node/InetAddress.o \
-	node/Membership.o \
-	node/Multicaster.o \
-	node/Network.o \
-	node/NetworkConfig.o \
-	node/Node.o \
-	node/OutboundMulticast.o \
-	node/Packet.o \
-	node/Path.o \
-	node/Peer.o \
-	node/Poly1305.o \
-	node/Salsa20.o \
-	node/SelfAwareness.o \
-	node/SHA512.o \
-	node/Switch.o \
-	node/Trace.o \
-	node/Utils.o
-
-ONE_OBJS=\
-	controller/EmbeddedNetworkController.o \
-	controller/DBMirrorSet.o \
-	controller/DB.o \
-	controller/FileDB.o \
-	controller/LFDB.o \
-	controller/PostgreSQL.o \
-	controller/RabbitMQ.o \
-	osdep/EthernetTap.o \
-	osdep/ManagedRoute.o \
-	osdep/Http.o \
-	osdep/OSUtils.o \
-	service/SoftwareUpdater.o \
-	service/OneService.o
-

root/CMakeLists.txt → attic/root/CMakeLists.txt

@@ -14,6 +14,4 @@ target_compile_features(${PROJECT_NAME} PUBLIC cxx_std_11)
 target_include_directories(${PROJECT_NAME} PRIVATE
 	${CMAKE_SOURCE_DIR}/node
 	${CMAKE_SOURCE_DIR}/osdep
-	${CMAKE_SOURCE_DIR}/ext/json
-	${CMAKE_SOURCE_DIR}/ext/cpp-httplib
 )

controller/DB.hpp

@@ -32,7 +32,7 @@
 #include <mutex>
 #include <set>
 
-#include "../ext/json/json.hpp"
+#include "./thirdparty/json/json.hpp"
 
 namespace ZeroTier
 {

controller/EmbeddedNetworkController.hpp

@@ -35,7 +35,7 @@
 #include "../osdep/Thread.hpp"
 #include "../osdep/BlockingQueue.hpp"
 
-#include "../ext/json/json.hpp"
+#include "./thirdparty/json/json.hpp"
 
 #include "DB.hpp"
 #include "DBMirrorSet.hpp"

controller/thirdparty/json/LICENSE.MIT

@@ -0,0 +1,21 @@
+MIT License 
+
+Copyright (c) 2013-2017 Niels Lohmann
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

controller/thirdparty/json/README.md

@@ -0,0 +1,1123 @@
+[![JSON for Modern C++](https://raw.githubusercontent.com/nlohmann/json/master/doc/json.gif)](https://github.com/nlohmann/json/releases)
+
+[![Build Status](https://travis-ci.org/nlohmann/json.svg?branch=master)](https://travis-ci.org/nlohmann/json)
+[![Build Status](https://ci.appveyor.com/api/projects/status/1acb366xfyg3qybk/branch/develop?svg=true)](https://ci.appveyor.com/project/nlohmann/json)
+[![Coverage Status](https://img.shields.io/coveralls/nlohmann/json.svg)](https://coveralls.io/r/nlohmann/json)
+[![Coverity Scan Build Status](https://scan.coverity.com/projects/5550/badge.svg)](https://scan.coverity.com/projects/nlohmann-json)
+[![Codacy Badge](https://api.codacy.com/project/badge/Grade/f3732b3327e34358a0e9d1fe9f661f08)](https://www.codacy.com/app/nlohmann/json?utm_source=github.com&utm_medium=referral&utm_content=nlohmann/json&utm_campaign=Badge_Grade)
+[![Try online](https://img.shields.io/badge/try-online-blue.svg)](https://wandbox.org/permlink/TarF5pPn9NtHQjhf)
+[![Documentation](https://img.shields.io/badge/docs-doxygen-blue.svg)](http://nlohmann.github.io/json)
+[![GitHub license](https://img.shields.io/badge/license-MIT-blue.svg)](https://raw.githubusercontent.com/nlohmann/json/master/LICENSE.MIT)
+[![GitHub Releases](https://img.shields.io/github/release/nlohmann/json.svg)](https://github.com/nlohmann/json/releases)
+[![GitHub Issues](https://img.shields.io/github/issues/nlohmann/json.svg)](http://github.com/nlohmann/json/issues)
+[![Average time to resolve an issue](http://isitmaintained.com/badge/resolution/nlohmann/json.svg)](http://isitmaintained.com/project/nlohmann/json "Average time to resolve an issue")
+[![CII Best Practices](https://bestpractices.coreinfrastructure.org/projects/289/badge)](https://bestpractices.coreinfrastructure.org/projects/289)
+
+- [Design goals](#design-goals)
+- [Integration](#integration)
+- [Examples](#examples)
+  - [JSON as first-class data type](#json-as-first-class-data-type)
+  - [Serialization / Deserialization](#serialization--deserialization)
+  - [STL-like access](#stl-like-access)
+  - [Conversion from STL containers](#conversion-from-stl-containers)
+  - [JSON Pointer and JSON Patch](#json-pointer-and-json-patch)
+  - [JSON Merge Patch](#json-merge-patch)
+  - [Implicit conversions](#implicit-conversions)
+  - [Conversions to/from arbitrary types](#arbitrary-types-conversions)
+  - [Binary formats (CBOR, MessagePack, and UBJSON)](#binary-formats-cbor-messagepack-and-ubjson)
+- [Supported compilers](#supported-compilers)
+- [License](#license)
+- [Contact](#contact)
+- [Thanks](#thanks)
+- [Used third-party tools](#used-third-party-tools)
+- [Projects using JSON for Modern C++](#projects-using-json-for-modern-c)
+- [Notes](#notes)
+- [Execute unit tests](#execute-unit-tests)
+
+## Design goals
+
+There are myriads of [JSON](http://json.org) libraries out there, and each may even have its reason to exist. Our class had these design goals:
+
+- **Intuitive syntax**. In languages such as Python, JSON feels like a first class data type. We used all the operator magic of modern C++ to achieve the same feeling in your code. Check out the [examples below](#examples) and you'll know what I mean.
+
+- **Trivial integration**. Our whole code consists of a single header file [`json.hpp`](https://github.com/nlohmann/json/blob/develop/single_include/nlohmann/json.hpp). That's it. No library, no subproject, no dependencies, no complex build system. The class is written in vanilla C++11. All in all, everything should require no adjustment of your compiler flags or project settings.
+
+- **Serious testing**. Our class is heavily [unit-tested](https://github.com/nlohmann/json/tree/develop/test/src) and covers [100%](https://coveralls.io/r/nlohmann/json) of the code, including all exceptional behavior. Furthermore, we checked with [Valgrind](http://valgrind.org) and the [Clang Sanitizers](https://clang.llvm.org/docs/index.html) that there are no memory leaks. [Google OSS-Fuzz](https://github.com/google/oss-fuzz/tree/master/projects/json) additionally runs fuzz tests agains all parsers 24/7, effectively executing billions of tests so far. To maintain high quality, the project is following the [Core Infrastructure Initiative (CII) best practices](https://bestpractices.coreinfrastructure.org/projects/289).
+
+Other aspects were not so important to us:
+
+- **Memory efficiency**. Each JSON object has an overhead of one pointer (the maximal size of a union) and one enumeration element (1 byte). The default generalization uses the following C++ data types: `std::string` for strings, `int64_t`, `uint64_t` or `double` for numbers, `std::map` for objects, `std::vector` for arrays, and `bool` for Booleans. However, you can template the generalized class `basic_json` to your needs.
+
+- **Speed**. There are certainly [faster JSON libraries](https://github.com/miloyip/nativejson-benchmark#parsing-time) out there. However, if your goal is to speed up your development by adding JSON support with a single header, then this library is the way to go. If you know how to use a `std::vector` or `std::map`, you are already set.
+
+See the [contribution guidelines](https://github.com/nlohmann/json/blob/master/.github/CONTRIBUTING.md#please-dont) for more information.
+
+
+## Integration
+
+[`json.hpp`](https://github.com/nlohmann/json/blob/develop/single_include/nlohmann/json.hpp) is the single required file in `single_include/nlohmann` or [released here](https://github.com/nlohmann/json/releases). You need to add
+
+```cpp
+#include <nlohmann/json.hpp>
+
+// for convenience
+using json = nlohmann::json;
+```
+
+to the files you want to process JSON and set the necessary switches to enable C++11 (e.g., `-std=c++11` for GCC and Clang).
+
+You can further use file [`include/nlohmann/json_fwd.hpp`](https://github.com/nlohmann/json/blob/develop/include/nlohmann/json_fwd.hpp) for forward-declarations. The installation of json_fwd.hpp (as part of cmake's install step), can be achieved by setting `-DJSON_MultipleHeaders=ON`.
+
+### Package Managers
+
+:beer: If you are using OS X and [Homebrew](http://brew.sh), just type `brew tap nlohmann/json` and `brew install nlohmann_json` and you're set. If you want the bleeding edge rather than the latest release, use `brew install nlohmann_json --HEAD`.
+
+If you are using the [Meson Build System](http://mesonbuild.com), then you can wrap this repository as a subproject.
+
+If you are using [Conan](https://www.conan.io/) to manage your dependencies, merely add `jsonformoderncpp/x.y.z@vthiery/stable` to your `conanfile.py`'s requires, where `x.y.z` is the release version you want to use. Please file issues [here](https://github.com/vthiery/conan-jsonformoderncpp/issues) if you experience problems with the packages.
+
+If you are using [Spack](https://www.spack.io/) to manage your dependencies, you can use the `nlohmann_json` package. Please see the [spack project](https://github.com/spack/spack) for any issues regarding the packaging.
+
+If you are using [hunter](https://github.com/ruslo/hunter/) on your project for external dependencies, then you can use the [nlohmann_json package](https://docs.hunter.sh/en/latest/packages/pkg/nlohmann_json.html). Please see the hunter project for any issues regarding the packaging.
+
+If you are using [Buckaroo](https://buckaroo.pm), you can install this library's module with `buckaroo install nlohmann/json`. Please file issues [here](https://github.com/LoopPerfect/buckaroo-recipes/issues/new?title=nlohmann/nlohmann/json).
+
+If you are using [vcpkg](https://github.com/Microsoft/vcpkg/) on your project for external dependencies, then you can use the [nlohmann-json package](https://github.com/Microsoft/vcpkg/tree/master/ports/nlohmann-json). Please see the vcpkg project for any issues regarding the packaging.
+
+If you are using [cget](http://cget.readthedocs.io/en/latest/), you can install the latest development version with `cget install nlohmann/json`. A specific version can be installed with `cget install nlohmann/[email protected]`. Also, the multiple header version can be installed by adding the `-DJSON_MultipleHeaders=ON` flag (i.e., `cget install nlohmann/json -DJSON_MultipleHeaders=ON`).
+
+If you are using [CocoaPods](https://cocoapods.org), you can use the library by adding pod `"nlohmann_json", '~>3.1.2'` to your podfile (see [an example](https://bitbucket.org/benman/nlohmann_json-cocoapod/src/master/)). Please file issues [here](https://bitbucket.org/benman/nlohmann_json-cocoapod/issues?status=new&status=open).
+
+## Examples
+
+Beside the examples below, you may want to check the [documentation](https://nlohmann.github.io/json/) where each function contains a separate code example (e.g., check out [`emplace()`](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_a5338e282d1d02bed389d852dd670d98d.html#a5338e282d1d02bed389d852dd670d98d)). All [example files](https://github.com/nlohmann/json/tree/develop/doc/examples) can be compiled and executed on their own (e.g., file [emplace.cpp](https://github.com/nlohmann/json/blob/develop/doc/examples/emplace.cpp)).
+
+### JSON as first-class data type
+
+Here are some examples to give you an idea how to use the class.
+
+Assume you want to create the JSON object
+
+```json
+{
+  "pi": 3.141,
+  "happy": true,
+  "name": "Niels",
+  "nothing": null,
+  "answer": {
+    "everything": 42
+  },
+  "list": [1, 0, 2],
+  "object": {
+    "currency": "USD",
+    "value": 42.99
+  }
+}
+```
+
+With this library, you could write:
+
+```cpp
+// create an empty structure (null)
+json j;
+
+// add a number that is stored as double (note the implicit conversion of j to an object)
+j["pi"] = 3.141;
+
+// add a Boolean that is stored as bool
+j["happy"] = true;
+
+// add a string that is stored as std::string
+j["name"] = "Niels";
+
+// add another null object by passing nullptr
+j["nothing"] = nullptr;
+
+// add an object inside the object
+j["answer"]["everything"] = 42;
+
+// add an array that is stored as std::vector (using an initializer list)
+j["list"] = { 1, 0, 2 };
+
+// add another object (using an initializer list of pairs)
+j["object"] = { {"currency", "USD"}, {"value", 42.99} };
+
+// instead, you could also write (which looks very similar to the JSON above)
+json j2 = {
+  {"pi", 3.141},
+  {"happy", true},
+  {"name", "Niels"},
+  {"nothing", nullptr},
+  {"answer", {
+    {"everything", 42}
+  }},
+  {"list", {1, 0, 2}},
+  {"object", {
+    {"currency", "USD"},
+    {"value", 42.99}
+  }}
+};
+```
+
+Note that in all these cases, you never need to "tell" the compiler which JSON value type you want to use. If you want to be explicit or express some edge cases, the functions [`json::array`](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_aa80485befaffcadaa39965494e0b4d2e.html#aa80485befaffcadaa39965494e0b4d2e) and [`json::object`](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_aa13f7c0615867542ce80337cbcf13ada.html#aa13f7c0615867542ce80337cbcf13ada) will help:
+
+```cpp
+// a way to express the empty array []
+json empty_array_explicit = json::array();
+
+// ways to express the empty object {}
+json empty_object_implicit = json({});
+json empty_object_explicit = json::object();
+
+// a way to express an _array_ of key/value pairs [["currency", "USD"], ["value", 42.99]]
+json array_not_object = json::array({ {"currency", "USD"}, {"value", 42.99} });
+```
+
+### Serialization / Deserialization
+
+#### To/from strings
+
+You can create a JSON value (deserialization) by appending `_json` to a string literal:
+
+```cpp
+// create object from string literal
+json j = "{ \"happy\": true, \"pi\": 3.141 }"_json;
+
+// or even nicer with a raw string literal
+auto j2 = R"(
+  {
+    "happy": true,
+    "pi": 3.141
+  }
+)"_json;
+```
+
+Note that without appending the `_json` suffix, the passed string literal is not parsed, but just used as JSON string value. That is, `json j = "{ \"happy\": true, \"pi\": 3.141 }"` would just store the string `"{ "happy": true, "pi": 3.141 }"` rather than parsing the actual object.
+
+The above example can also be expressed explicitly using [`json::parse()`](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_aa9676414f2e36383c4b181fe856aa3c0.html#aa9676414f2e36383c4b181fe856aa3c0):
+
+```cpp
+// parse explicitly
+auto j3 = json::parse("{ \"happy\": true, \"pi\": 3.141 }");
+```
+
+You can also get a string representation of a JSON value (serialize):
+
+```cpp
+// explicit conversion to string
+std::string s = j.dump();    // {\"happy\":true,\"pi\":3.141}
+
+// serialization with pretty printing
+// pass in the amount of spaces to indent
+std::cout << j.dump(4) << std::endl;
+// {
+//     "happy": true,
+//     "pi": 3.141
+// }
+```
+
+Note the difference between serialization and assignment:
+
+```cpp
+// store a string in a JSON value
+json j_string = "this is a string";
+
+// retrieve the string value (implicit JSON to std::string conversion)
+std::string cpp_string = j_string;
+// retrieve the string value (explicit JSON to std::string conversion)
+auto cpp_string2 = j_string.get<std::string>();
+
+// retrieve the serialized value (explicit JSON serialization)
+std::string serialized_string = j_string.dump();
+
+// output of original string
+std::cout << cpp_string << " == " << cpp_string2 << " == " << j_string.get<std::string>() << '\n';
+// output of serialized value
+std::cout << j_string << " == " << serialized_string << std::endl;
+```
+
+[`.dump()`](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_a5adea76fedba9898d404fef8598aa663.html#a5adea76fedba9898d404fef8598aa663) always returns the serialized value, and [`.get<std::string>()`](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_a16f9445f7629f634221a42b967cdcd43.html#a16f9445f7629f634221a42b967cdcd43) returns the originally stored string value.
+
+Note the library only supports UTF-8. When you store strings with different encodings in the library, calling [`dump()`](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_a5adea76fedba9898d404fef8598aa663.html#a5adea76fedba9898d404fef8598aa663) may throw an exception.
+
+#### To/from streams (e.g. files, string streams)
+
+You can also use streams to serialize and deserialize:
+
+```cpp
+// deserialize from standard input
+json j;
+std::cin >> j;
+
+// serialize to standard output
+std::cout << j;
+
+// the setw manipulator was overloaded to set the indentation for pretty printing
+std::cout << std::setw(4) << j << std::endl;
+```
+
+These operators work for any subclasses of `std::istream` or `std::ostream`. Here is the same example with files:
+
+```cpp
+// read a JSON file
+std::ifstream i("file.json");
+json j;
+i >> j;
+
+// write prettified JSON to another file
+std::ofstream o("pretty.json");
+o << std::setw(4) << j << std::endl;
+```
+
+Please note that setting the exception bit for `failbit` is inappropriate for this use case. It will result in program termination due to the `noexcept` specifier in use.
+
+#### Read from iterator range
+
+You can also parse JSON from an iterator range; that is, from any container accessible by iterators whose content is stored as contiguous byte sequence, for instance a `std::vector<std::uint8_t>`:
+
+```cpp
+std::vector<std::uint8_t> v = {'t', 'r', 'u', 'e'};
+json j = json::parse(v.begin(), v.end());
+```
+
+You may leave the iterators for the range [begin, end):
+
+```cpp
+std::vector<std::uint8_t> v = {'t', 'r', 'u', 'e'};
+json j = json::parse(v);
+```
+
+#### SAX interface
+
+The library uses a SAX-like interface with the following functions:
+
+```cpp
+// called when null is parsed
+bool null();
+
+// called when a boolean is parsed; value is passed
+bool boolean(bool val);
+
+// called when a signed or unsigned integer number is parsed; value is passed
+bool number_integer(number_integer_t val);
+bool number_unsigned(number_unsigned_t val);
+
+// called when a floating-point number is parsed; value and original string is passed
+bool number_float(number_float_t val, const string_t& s);
+
+// called when a string is parsed; value is passed and can be safely moved away
+bool string(string_t& val);
+
+// called when an object or array begins or ends, resp. The number of elements is passed (or -1 if not known)
+bool start_object(std::size_t elements);
+bool end_object();
+bool start_array(std::size_t elements);
+bool end_array();
+// called when an object key is parsed; value is passed and can be safely moved away
+bool key(string_t& val);
+
+// called when a parse error occurs; byte position, the last token, and an exception is passed
+bool parse_error(std::size_t position, const std::string& last_token, const detail::exception& ex);
+```
+
+The return value of each function determines whether parsing should proceed.
+
+To implement your own SAX handler, proceed as follows:
+
+1. Implement the SAX interface in a class. You can use class `nlohmann::json_sax<json>` as base class, but you can also use any class where the functions described above are implemented and public.
+2. Create an object of your SAX interface class, e.g. `my_sax`.
+3. Call `bool json::sax_parse(input, &my_sax)`; where the first parameter can be any input like a string or an input stream and the second parameter is a pointer to your SAX interface.
+
+Note the `sax_parse` function only returns a `bool` indicating the result of the last executed SAX event. It does not return a  `json` value - it is up to you to decide what to do with the SAX events. Furthermore, no exceptions are thrown in case of a parse error - it is up to you what to do with the exception object passed to your `parse_error` implementation. Internally, the SAX interface is used for the DOM parser (class `json_sax_dom_parser`) as well as the acceptor (`json_sax_acceptor`), see file [`json_sax.hpp`](https://github.com/nlohmann/json/blob/develop/include/nlohmann/detail/input/json_sax.hpp).
+
+
+### STL-like access
+
+We designed the JSON class to behave just like an STL container. In fact, it satisfies the [**ReversibleContainer**](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer) requirement.
+
+```cpp
+// create an array using push_back
+json j;
+j.push_back("foo");
+j.push_back(1);
+j.push_back(true);
+
+// also use emplace_back
+j.emplace_back(1.78);
+
+// iterate the array
+for (json::iterator it = j.begin(); it != j.end(); ++it) {
+  std::cout << *it << '\n';
+}
+
+// range-based for
+for (auto& element : j) {
+  std::cout << element << '\n';
+}
+
+// getter/setter
+const std::string tmp = j[0];
+j[1] = 42;
+bool foo = j.at(2);
+
+// comparison
+j == "[\"foo\", 1, true]"_json;  // true
+
+// other stuff
+j.size();     // 3 entries
+j.empty();    // false
+j.type();     // json::value_t::array
+j.clear();    // the array is empty again
+
+// convenience type checkers
+j.is_null();
+j.is_boolean();
+j.is_number();
+j.is_object();
+j.is_array();
+j.is_string();
+
+// create an object
+json o;
+o["foo"] = 23;
+o["bar"] = false;
+o["baz"] = 3.141;
+
+// also use emplace
+o.emplace("weather", "sunny");
+
+// special iterator member functions for objects
+for (json::iterator it = o.begin(); it != o.end(); ++it) {
+  std::cout << it.key() << " : " << it.value() << "\n";
+}
+
+// find an entry
+if (o.find("foo") != o.end()) {
+  // there is an entry with key "foo"
+}
+
+// or simpler using count()
+int foo_present = o.count("foo"); // 1
+int fob_present = o.count("fob"); // 0
+
+// delete an entry
+o.erase("foo");
+```
+
+
+### Conversion from STL containers
+
+Any sequence container (`std::array`, `std::vector`, `std::deque`, `std::forward_list`, `std::list`) whose values can be used to construct JSON values (e.g., integers, floating point numbers, Booleans, string types, or again STL containers described in this section) can be used to create a JSON array. The same holds for similar associative containers (`std::set`, `std::multiset`, `std::unordered_set`, `std::unordered_multiset`), but in these cases the order of the elements of the array depends on how the elements are ordered in the respective STL container.
+
+```cpp
+std::vector<int> c_vector {1, 2, 3, 4};
+json j_vec(c_vector);
+// [1, 2, 3, 4]
+
+std::deque<double> c_deque {1.2, 2.3, 3.4, 5.6};
+json j_deque(c_deque);
+// [1.2, 2.3, 3.4, 5.6]
+
+std::list<bool> c_list {true, true, false, true};
+json j_list(c_list);
+// [true, true, false, true]
+
+std::forward_list<int64_t> c_flist {12345678909876, 23456789098765, 34567890987654, 45678909876543};
+json j_flist(c_flist);
+// [12345678909876, 23456789098765, 34567890987654, 45678909876543]
+
+std::array<unsigned long, 4> c_array {{1, 2, 3, 4}};
+json j_array(c_array);
+// [1, 2, 3, 4]
+
+std::set<std::string> c_set {"one", "two", "three", "four", "one"};
+json j_set(c_set); // only one entry for "one" is used
+// ["four", "one", "three", "two"]
+
+std::unordered_set<std::string> c_uset {"one", "two", "three", "four", "one"};
+json j_uset(c_uset); // only one entry for "one" is used
+// maybe ["two", "three", "four", "one"]
+
+std::multiset<std::string> c_mset {"one", "two", "one", "four"};
+json j_mset(c_mset); // both entries for "one" are used
+// maybe ["one", "two", "one", "four"]
+
+std::unordered_multiset<std::string> c_umset {"one", "two", "one", "four"};
+json j_umset(c_umset); // both entries for "one" are used
+// maybe ["one", "two", "one", "four"]
+```
+
+Likewise, any associative key-value containers (`std::map`, `std::multimap`, `std::unordered_map`, `std::unordered_multimap`) whose keys can construct an `std::string` and whose values can be used to construct JSON values (see examples above) can be used to create a JSON object. Note that in case of multimaps only one key is used in the JSON object and the value depends on the internal order of the STL container.
+
+```cpp
+std::map<std::string, int> c_map { {"one", 1}, {"two", 2}, {"three", 3} };
+json j_map(c_map);
+// {"one": 1, "three": 3, "two": 2 }
+
+std::unordered_map<const char*, double> c_umap { {"one", 1.2}, {"two", 2.3}, {"three", 3.4} };
+json j_umap(c_umap);
+// {"one": 1.2, "two": 2.3, "three": 3.4}
+
+std::multimap<std::string, bool> c_mmap { {"one", true}, {"two", true}, {"three", false}, {"three", true} };
+json j_mmap(c_mmap); // only one entry for key "three" is used
+// maybe {"one": true, "two": true, "three": true}
+
+std::unordered_multimap<std::string, bool> c_ummap { {"one", true}, {"two", true}, {"three", false}, {"three", true} };
+json j_ummap(c_ummap); // only one entry for key "three" is used
+// maybe {"one": true, "two": true, "three": true}
+```
+
+### JSON Pointer and JSON Patch
+
+The library supports **JSON Pointer** ([RFC 6901](https://tools.ietf.org/html/rfc6901)) as alternative means to address structured values. On top of this, **JSON Patch** ([RFC 6902](https://tools.ietf.org/html/rfc6902)) allows to describe differences between two JSON values - effectively allowing patch and diff operations known from Unix.
+
+```cpp
+// a JSON value
+json j_original = R"({
+  "baz": ["one", "two", "three"],
+  "foo": "bar"
+})"_json;
+
+// access members with a JSON pointer (RFC 6901)
+j_original["/baz/1"_json_pointer];
+// "two"
+
+// a JSON patch (RFC 6902)
+json j_patch = R"([
+  { "op": "replace", "path": "/baz", "value": "boo" },
+  { "op": "add", "path": "/hello", "value": ["world"] },
+  { "op": "remove", "path": "/foo"}
+])"_json;
+
+// apply the patch
+json j_result = j_original.patch(j_patch);
+// {
+//    "baz": "boo",
+//    "hello": ["world"]
+// }
+
+// calculate a JSON patch from two JSON values
+json::diff(j_result, j_original);
+// [
+//   { "op":" replace", "path": "/baz", "value": ["one", "two", "three"] },
+//   { "op": "remove","path": "/hello" },
+//   { "op": "add", "path": "/foo", "value": "bar" }
+// ]
+```
+
+### JSON Merge Patch
+
+The library supports **JSON Merge Patch** ([RFC 7386](https://tools.ietf.org/html/rfc7386)) as a patch format. Instead of using JSON Pointer (see above) to specify values to be manipulated, it describes the changes using a syntax that closely mimics the document being modified.
+
+```cpp
+// a JSON value
+json j_document = R"({
+  "a": "b",
+  "c": {
+    "d": "e",
+    "f": "g"
+  }
+})"_json;
+
+// a patch
+json j_patch = R"({
+  "a":"z",
+  "c": {
+    "f": null
+  }
+})"_json;
+
+// apply the patch
+j_original.merge_patch(j_patch);
+// {
+//  "a": "z",
+//  "c": {
+//    "d": "e"
+//  }
+// }
+```
+
+### Implicit conversions
+
+The type of the JSON object is determined automatically by the expression to store. Likewise, the stored value is implicitly converted.
+
+```cpp
+// strings
+std::string s1 = "Hello, world!";
+json js = s1;
+std::string s2 = js;
+
+// Booleans
+bool b1 = true;
+json jb = b1;
+bool b2 = jb;
+
+// numbers
+int i = 42;
+json jn = i;
+double f = jn;
+
+// etc.
+```
+
+You can also explicitly ask for the value:
+
+```cpp
+std::string vs = js.get<std::string>();
+bool vb = jb.get<bool>();
+int vi = jn.get<int>();
+
+// etc.
+```
+
+Note that `char` types are not automatically converted to JSON strings, but to integer numbers. A conversion to a string must be specified explicitly:
+
+```cpp
+char ch = 'A';                       // ASCII value 65
+json j_default = ch;                 // stores integer number 65
+json j_string = std::string(1, ch);  // stores string "A"
+```
+
+### Arbitrary types conversions
+
+Every type can be serialized in JSON, not just STL containers and scalar types. Usually, you would do something along those lines:
+
+```cpp
+namespace ns {
+    // a simple struct to model a person
+    struct person {
+        std::string name;
+        std::string address;
+        int age;
+    };
+}
+
+ns::person p = {"Ned Flanders", "744 Evergreen Terrace", 60};
+
+// convert to JSON: copy each value into the JSON object
+json j;
+j["name"] = p.name;
+j["address"] = p.address;
+j["age"] = p.age;
+
+// ...
+
+// convert from JSON: copy each value from the JSON object
+ns::person p {
+    j["name"].get<std::string>(),
+    j["address"].get<std::string>(),
+    j["age"].get<int>()
+};
+```
+
+It works, but that's quite a lot of boilerplate... Fortunately, there's a better way:
+
+```cpp
+// create a person
+ns::person p {"Ned Flanders", "744 Evergreen Terrace", 60};
+
+// conversion: person -> json
+json j = p;
+
+std::cout << j << std::endl;
+// {"address":"744 Evergreen Terrace","age":60,"name":"Ned Flanders"}
+
+// conversion: json -> person
+ns::person p2 = j;
+
+// that's it
+assert(p == p2);
+```
+
+#### Basic usage
+
+To make this work with one of your types, you only need to provide two functions:
+
+```cpp
+using nlohmann::json;
+
+namespace ns {
+    void to_json(json& j, const person& p) {
+        j = json{{"name", p.name}, {"address", p.address}, {"age", p.age}};
+    }
+
+    void from_json(const json& j, person& p) {
+        p.name = j.at("name").get<std::string>();
+        p.address = j.at("address").get<std::string>();
+        p.age = j.at("age").get<int>();
+    }
+} // namespace ns
+```
+
+That's all! When calling the `json` constructor with your type, your custom `to_json` method will be automatically called.
+Likewise, when calling `get<your_type>()`, the `from_json` method will be called.
+
+Some important things:
+
+* Those methods **MUST** be in your type's namespace (which can be the global namespace), or the library will not be able to locate them (in this example, they are in namespace `ns`, where `person` is defined).
+* Those methods **MUST** be available (e.g., properly headers must be included) everywhere you use the implicit conversions. Look at [issue 1108](https://github.com/nlohmann/json/issues/1108) for errors that may occur otherwise.
+* When using `get<your_type>()`, `your_type` **MUST** be [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible). (There is a way to bypass this requirement described later.)
+* In function `from_json`, use function [`at()`](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_a93403e803947b86f4da2d1fb3345cf2c.html#a93403e803947b86f4da2d1fb3345cf2c) to access the object values rather than `operator[]`. In case a key does not exist, `at` throws an exception that you can handle, whereas `operator[]` exhibits undefined behavior.
+* In case your type contains several `operator=` definitions, code like `your_variable = your_json;` [may not compile](https://github.com/nlohmann/json/issues/667). You need to write `your_variable = your_json.get<decltype your_variable>();` instead.
+* You do not need to add serializers or deserializers for STL types like `std::vector`: the library already implements these.
+* Be careful with the definition order of the `from_json`/`to_json` functions: If a type `B` has a member of type `A`, you **MUST** define `to_json(A)` before `to_json(B)`. Look at [issue 561](https://github.com/nlohmann/json/issues/561) for more details.
+
+
+#### How do I convert third-party types?
+
+This requires a bit more advanced technique. But first, let's see how this conversion mechanism works:
+
+The library uses **JSON Serializers** to convert types to json.
+The default serializer for `nlohmann::json` is `nlohmann::adl_serializer` (ADL means [Argument-Dependent Lookup](https://en.cppreference.com/w/cpp/language/adl)).
+
+It is implemented like this (simplified):
+
+```cpp
+template <typename T>
+struct adl_serializer {
+    static void to_json(json& j, const T& value) {
+        // calls the "to_json" method in T's namespace
+    }
+
+    static void from_json(const json& j, T& value) {
+        // same thing, but with the "from_json" method
+    }
+};
+```
+
+This serializer works fine when you have control over the type's namespace. However, what about `boost::optional` or `std::filesystem::path` (C++17)? Hijacking the `boost` namespace is pretty bad, and it's illegal to add something other than template specializations to `std`...
+
+To solve this, you need to add a specialization of `adl_serializer` to the `nlohmann` namespace, here's an example:
+
+```cpp
+// partial specialization (full specialization works too)
+namespace nlohmann {
+    template <typename T>
+    struct adl_serializer<boost::optional<T>> {
+        static void to_json(json& j, const boost::optional<T>& opt) {
+            if (opt == boost::none) {
+                j = nullptr;
+            } else {
+              j = *opt; // this will call adl_serializer<T>::to_json which will
+                        // find the free function to_json in T's namespace!
+            }
+        }
+
+        static void from_json(const json& j, boost::optional<T>& opt) {
+            if (j.is_null()) {
+                opt = boost::none;
+            } else {
+                opt = j.get<T>(); // same as above, but with
+                                  // adl_serializer<T>::from_json
+            }
+        }
+    };
+}
+```
+
+#### How can I use `get()` for non-default constructible/non-copyable types?
+
+There is a way, if your type is [MoveConstructible](https://en.cppreference.com/w/cpp/named_req/MoveConstructible). You will need to specialize the `adl_serializer` as well, but with a special `from_json` overload:
+
+```cpp
+struct move_only_type {
+    move_only_type() = delete;
+    move_only_type(int ii): i(ii) {}
+    move_only_type(const move_only_type&) = delete;
+    move_only_type(move_only_type&&) = default;
+
+    int i;
+};
+
+namespace nlohmann {
+    template <>
+    struct adl_serializer<move_only_type> {
+        // note: the return type is no longer 'void', and the method only takes
+        // one argument
+        static move_only_type from_json(const json& j) {
+            return {j.get<int>()};
+        }
+
+        // Here's the catch! You must provide a to_json method! Otherwise you
+        // will not be able to convert move_only_type to json, since you fully
+        // specialized adl_serializer on that type
+        static void to_json(json& j, move_only_type t) {
+            j = t.i;
+        }
+    };
+}
+```
+
+#### Can I write my own serializer? (Advanced use)
+
+Yes. You might want to take a look at [`unit-udt.cpp`](https://github.com/nlohmann/json/blob/develop/test/src/unit-udt.cpp) in the test suite, to see a few examples.
+
+If you write your own serializer, you'll need to do a few things:
+
+- use a different `basic_json` alias than `nlohmann::json` (the last template parameter of `basic_json` is the `JSONSerializer`)
+- use your `basic_json` alias (or a template parameter) in all your `to_json`/`from_json` methods
+- use `nlohmann::to_json` and `nlohmann::from_json` when you need ADL
+
+Here is an example, without simplifications, that only accepts types with a size <= 32, and uses ADL.
+
+```cpp
+// You should use void as a second template argument
+// if you don't need compile-time checks on T
+template<typename T, typename SFINAE = typename std::enable_if<sizeof(T) <= 32>::type>
+struct less_than_32_serializer {
+    template <typename BasicJsonType>
+    static void to_json(BasicJsonType& j, T value) {
+        // we want to use ADL, and call the correct to_json overload
+        using nlohmann::to_json; // this method is called by adl_serializer,
+                                 // this is where the magic happens
+        to_json(j, value);
+    }
+
+    template <typename BasicJsonType>
+    static void from_json(const BasicJsonType& j, T& value) {
+        // same thing here
+        using nlohmann::from_json;
+        from_json(j, value);
+    }
+};
+```
+
+Be **very** careful when reimplementing your serializer, you can stack overflow if you don't pay attention:
+
+```cpp
+template <typename T, void>
+struct bad_serializer
+{
+    template <typename BasicJsonType>
+    static void to_json(BasicJsonType& j, const T& value) {
+      // this calls BasicJsonType::json_serializer<T>::to_json(j, value);
+      // if BasicJsonType::json_serializer == bad_serializer ... oops!
+      j = value;
+    }
+
+    template <typename BasicJsonType>
+    static void to_json(const BasicJsonType& j, T& value) {
+      // this calls BasicJsonType::json_serializer<T>::from_json(j, value);
+      // if BasicJsonType::json_serializer == bad_serializer ... oops!
+      value = j.template get<T>(); // oops!
+    }
+};
+```
+
+### Binary formats (CBOR, MessagePack, and UBJSON)
+
+Though JSON is a ubiquitous data format, it is not a very compact format suitable for data exchange, for instance over a network. Hence, the library supports [CBOR](http://cbor.io) (Concise Binary Object Representation), [MessagePack](http://msgpack.org), and [UBJSON](http://ubjson.org) (Universal Binary JSON Specification) to efficiently encode JSON values to byte vectors and to decode such vectors.
+
+```cpp
+// create a JSON value
+json j = R"({"compact": true, "schema": 0})"_json;
+
+// serialize to CBOR
+std::vector<std::uint8_t> v_cbor = json::to_cbor(j);
+
+// 0xA2, 0x67, 0x63, 0x6F, 0x6D, 0x70, 0x61, 0x63, 0x74, 0xF5, 0x66, 0x73, 0x63, 0x68, 0x65, 0x6D, 0x61, 0x00
+
+// roundtrip
+json j_from_cbor = json::from_cbor(v_cbor);
+
+// serialize to MessagePack
+std::vector<std::uint8_t> v_msgpack = json::to_msgpack(j);
+
+// 0x82, 0xA7, 0x63, 0x6F, 0x6D, 0x70, 0x61, 0x63, 0x74, 0xC3, 0xA6, 0x73, 0x63, 0x68, 0x65, 0x6D, 0x61, 0x00
+
+// roundtrip
+json j_from_msgpack = json::from_msgpack(v_msgpack);
+
+// serialize to UBJSON
+std::vector<std::uint8_t> v_ubjson = json::to_ubjson(j);
+
+// 0x7B, 0x69, 0x07, 0x63, 0x6F, 0x6D, 0x70, 0x61, 0x63, 0x74, 0x54, 0x69, 0x06, 0x73, 0x63, 0x68, 0x65, 0x6D, 0x61, 0x69, 0x00, 0x7D
+
+// roundtrip
+json j_from_ubjson = json::from_ubjson(v_ubjson);
+```
+
+
+## Supported compilers
+
+Though it's 2018 already, the support for C++11 is still a bit sparse. Currently, the following compilers are known to work:
+
+- GCC 4.9 - 8.2 (and possibly later)
+- Clang 3.4 - 6.1 (and possibly later)
+- Intel C++ Compiler 17.0.2 (and possibly later)
+- Microsoft Visual C++ 2015 / Build Tools 14.0.25123.0 (and possibly later)
+- Microsoft Visual C++ 2017 / Build Tools 15.5.180.51428 (and possibly later)
+
+I would be happy to learn about other compilers/versions.
+
+Please note:
+
+- GCC 4.8 does not work because of two bugs ([55817](https://gcc.gnu.org/bugzilla/show_bug.cgi?id=55817) and [57824](https://gcc.gnu.org/bugzilla/show_bug.cgi?id=57824)) in the C++11 support. Note there is a [pull request](https://github.com/nlohmann/json/pull/212) to fix some of the issues.
+- Android defaults to using very old compilers and C++ libraries. To fix this, add the following to your `Application.mk`. This will switch to the LLVM C++ library, the Clang compiler, and enable C++11 and other features disabled by default.
+
+    ```
+    APP_STL := c++_shared
+    NDK_TOOLCHAIN_VERSION := clang3.6
+    APP_CPPFLAGS += -frtti -fexceptions
+    ```
+
+    The code compiles successfully with [Android NDK](https://developer.android.com/ndk/index.html?hl=ml), Revision 9 - 11 (and possibly later) and [CrystaX's Android NDK](https://www.crystax.net/en/android/ndk) version 10.
+
+- For GCC running on MinGW or Android SDK, the error `'to_string' is not a member of 'std'` (or similarly, for `strtod`) may occur. Note this is not an issue with the code,  but rather with the compiler itself. On Android, see above to build with a newer environment.  For MinGW, please refer to [this site](http://tehsausage.com/mingw-to-string) and [this discussion](https://github.com/nlohmann/json/issues/136) for information on how to fix this bug. For Android NDK using `APP_STL := gnustl_static`, please refer to [this discussion](https://github.com/nlohmann/json/issues/219).
+
+- Unsupported versions of GCC and Clang are rejected by `#error` directives. This can be switched off by defining `JSON_SKIP_UNSUPPORTED_COMPILER_CHECK`. Note that you can expect no support in this case.
+
+The following compilers are currently used in continuous integration at [Travis](https://travis-ci.org/nlohmann/json) and [AppVeyor](https://ci.appveyor.com/project/nlohmann/json):
+
+| Compiler        | Operating System             | Version String |
+|-----------------|------------------------------|----------------|
+| GCC 4.9.4       | Ubuntu 14.04.1 LTS           | g++-4.9 (Ubuntu 4.9.4-2ubuntu1~14.04.1) 4.9.4 |
+| GCC 5.5.0       | Ubuntu 14.04.1 LTS           | g++-5 (Ubuntu 5.5.0-12ubuntu1~14.04) 5.5.0 20171010 |
+| GCC 6.4.0       | Ubuntu 14.04.1 LTS           | g++-6 (Ubuntu 6.4.0-17ubuntu1~14.04) 6.4.0 20180424 |
+| GCC 7.3.0       | Ubuntu 14.04.1 LTS           | g++-7 (Ubuntu 7.3.0-21ubuntu1~14.04) 7.3.0 |
+| GCC 7.3.0       | Windows Server 2012 R2 (x64) | g++ (x86_64-posix-seh-rev0, Built by MinGW-W64 project) 7.3.0 |
+| GCC 8.1.0       | Ubuntu 14.04.1 LTS           | g++-8 (Ubuntu 8.1.0-5ubuntu1~14.04) 8.1.0 |
+| Clang 3.5.0     | Ubuntu 14.04.1 LTS           | clang version 3.5.0-4ubuntu2~trusty2 (tags/RELEASE_350/final) (based on LLVM 3.5.0) |
+| Clang 3.6.2     | Ubuntu 14.04.1 LTS           | clang version 3.6.2-svn240577-1~exp1 (branches/release_36) (based on LLVM 3.6.2) |
+| Clang 3.7.1     | Ubuntu 14.04.1 LTS           | clang version 3.7.1-svn253571-1~exp1 (branches/release_37) (based on LLVM 3.7.1) |
+| Clang 3.8.0     | Ubuntu 14.04.1 LTS           | clang version 3.8.0-2ubuntu3~trusty5 (tags/RELEASE_380/final) |
+| Clang 3.9.1     | Ubuntu 14.04.1 LTS           | clang version 3.9.1-4ubuntu3~14.04.3 (tags/RELEASE_391/rc2) |
+| Clang 4.0.1     | Ubuntu 14.04.1 LTS           | clang version 4.0.1-svn305264-1~exp1 (branches/release_40) |
+| Clang 5.0.2     | Ubuntu 14.04.1 LTS           | clang version 5.0.2-svn328729-1~exp1~20180509123505.100 (branches/release_50) |
+| Clang 6.0.1     | Ubuntu 14.04.1 LTS           | clang version 6.0.1-svn334776-1~exp1~20180726133705.85 (branches/release_60) |
+| Clang Xcode 6.4 | OSX 10.10.5 | Apple LLVM version 6.1.0 (clang-602.0.53) (based on LLVM 3.6.0svn) |
+| Clang Xcode 7.3 | OSX 10.11.6 | Apple LLVM version 7.3.0 (clang-703.0.31) |
+| Clang Xcode 8.0 | OSX 10.11.6 | Apple LLVM version 8.0.0 (clang-800.0.38) |
+| Clang Xcode 8.1 | OSX 10.12.6 | Apple LLVM version 8.0.0 (clang-800.0.42.1) |
+| Clang Xcode 8.2 | OSX 10.12.6 | Apple LLVM version 8.0.0 (clang-800.0.42.1) |
+| Clang Xcode 8.3 | OSX 10.11.6 | Apple LLVM version 8.1.0 (clang-802.0.38) |
+| Clang Xcode 9.0 | OSX 10.12.6 | Apple LLVM version 9.0.0 (clang-900.0.37) |
+| Clang Xcode 9.1 | OSX 10.12.6 | Apple LLVM version 9.0.0 (clang-900.0.38) |
+| Clang Xcode 9.2 | OSX 10.13.3 | Apple LLVM version 9.1.0 (clang-902.0.39.1) |
+| Clang Xcode 9.3 | OSX 10.13.3 | Apple LLVM version 9.1.0 (clang-902.0.39.2) |
+| Visual Studio 14 2015 | Windows Server 2012 R2 (x64) | Microsoft (R) Build Engine version 14.0.25420.1, MSVC 19.0.24215.1 |
+| Visual Studio 2017 | Windows Server 2016 | Microsoft (R) Build Engine version 15.7.180.61344, MSVC 19.14.26433.0 |
+
+## License
+
+<img align="right" src="http://opensource.org/trademarks/opensource/OSI-Approved-License-100x137.png">
+
+The class is licensed under the [MIT License](http://opensource.org/licenses/MIT):
+
+Copyright &copy; 2013-2018 [Niels Lohmann](http://nlohmann.me)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+* * *
+
+The class contains the UTF-8 Decoder from Bjoern Hoehrmann which is licensed under the [MIT License](http://opensource.org/licenses/MIT) (see above). Copyright &copy; 2008-2009 [Björn Hoehrmann](http://bjoern.hoehrmann.de/) <[email protected]>
+
+The class contains a slightly modified version of the Grisu2 algorithm from Florian Loitsch which is licensed under the [MIT License](http://opensource.org/licenses/MIT) (see above). Copyright &copy; 2009 [Florian Loitsch](http://florian.loitsch.com/)
+
+## Contact
+
+If you have questions regarding the library, I would like to invite you to [open an issue at GitHub](https://github.com/nlohmann/json/issues/new). Please describe your request, problem, or question as detailed as possible, and also mention the version of the library you are using as well as the version of your compiler and operating system. Opening an issue at GitHub allows other users and contributors to this library to collaborate. For instance, I have little experience with MSVC, and most issues in this regard have been solved by a growing community. If you have a look at the [closed issues](https://github.com/nlohmann/json/issues?q=is%3Aissue+is%3Aclosed), you will see that we react quite timely in most cases.
+
+Only if your request would contain confidential information, please [send me an email](mailto:[email protected]). For encrypted messages, please use [this key](https://keybase.io/nlohmann/pgp_keys.asc).
+
+## Security
+
+[Commits by Niels Lohmann](https://github.com/nlohmann/json/commits) and [releases](https://github.com/nlohmann/json/releases) are signed with this [PGP Key](https://keybase.io/nlohmann/pgp_keys.asc?fingerprint=797167ae41c0a6d9232e48457f3cea63ae251b69).
+
+## Thanks
+
+I deeply appreciate the help of the following people.
+
+![Contributors](https://raw.githubusercontent.com/nlohmann/json/develop/doc/avatars.png)
+
+- [Teemperor](https://github.com/Teemperor) implemented CMake support and lcov integration, realized escape and Unicode handling in the string parser, and fixed the JSON serialization.
+- [elliotgoodrich](https://github.com/elliotgoodrich) fixed an issue with double deletion in the iterator classes.
+- [kirkshoop](https://github.com/kirkshoop) made the iterators of the class composable to other libraries.
+- [wancw](https://github.com/wanwc) fixed a bug that hindered the class to compile with Clang.
+- Tomas Åblad found a bug in the iterator implementation.
+- [Joshua C. Randall](https://github.com/jrandall) fixed a bug in the floating-point serialization.
+- [Aaron Burghardt](https://github.com/aburgh) implemented code to parse streams incrementally. Furthermore, he greatly improved the parser class by allowing the definition of a filter function to discard undesired elements while parsing.
+- [Daniel Kopeček](https://github.com/dkopecek) fixed a bug in the compilation with GCC 5.0.
+- [Florian Weber](https://github.com/Florianjw) fixed a bug in and improved the performance of the comparison operators.
+- [Eric Cornelius](https://github.com/EricMCornelius) pointed out a bug in the handling with NaN and infinity values. He also improved the performance of the string escaping.
+- [易思龙](https://github.com/likebeta) implemented a conversion from anonymous enums.
+- [kepkin](https://github.com/kepkin) patiently pushed forward the support for Microsoft Visual studio.
+- [gregmarr](https://github.com/gregmarr) simplified the implementation of reverse iterators and helped with numerous hints and improvements. In particular, he pushed forward the implementation of user-defined types.
+- [Caio Luppi](https://github.com/caiovlp) fixed a bug in the Unicode handling.
+- [dariomt](https://github.com/dariomt) fixed some typos in the examples.
+- [Daniel Frey](https://github.com/d-frey) cleaned up some pointers and implemented exception-safe memory allocation.
+- [Colin Hirsch](https://github.com/ColinH) took care of a small namespace issue.
+- [Huu Nguyen](https://github.com/whoshuu) correct a variable name in the documentation.
+- [Silverweed](https://github.com/silverweed) overloaded `parse()` to accept an rvalue reference.
+- [dariomt](https://github.com/dariomt) fixed a subtlety in MSVC type support and implemented the `get_ref()` function to get a reference to stored values.
+- [ZahlGraf](https://github.com/ZahlGraf) added a workaround that allows compilation using Android NDK.
+- [whackashoe](https://github.com/whackashoe) replaced a function that was marked as unsafe by Visual Studio.
+- [406345](https://github.com/406345) fixed two small warnings.
+- [Glen Fernandes](https://github.com/glenfe) noted a potential portability problem in the `has_mapped_type` function.
+- [Corbin Hughes](https://github.com/nibroc) fixed some typos in the contribution guidelines.
+- [twelsby](https://github.com/twelsby) fixed the array subscript operator, an issue that failed the MSVC build, and floating-point parsing/dumping. He further added support for unsigned integer numbers and implemented better roundtrip support for parsed numbers.
+- [Volker Diels-Grabsch](https://github.com/vog) fixed a link in the README file.
+- [msm-](https://github.com/msm-) added support for American Fuzzy Lop.
+- [Annihil](https://github.com/Annihil) fixed an example in the README file.
+- [Themercee](https://github.com/Themercee) noted a wrong URL in the README file.
+- [Lv Zheng](https://github.com/lv-zheng) fixed a namespace issue with `int64_t` and `uint64_t`.
+- [abc100m](https://github.com/abc100m) analyzed the issues with GCC 4.8 and proposed a [partial solution](https://github.com/nlohmann/json/pull/212).
+- [zewt](https://github.com/zewt) added useful notes to the README file about Android.
+- [Róbert Márki](https://github.com/robertmrk) added a fix to use move iterators and improved the integration via CMake.
+- [Chris Kitching](https://github.com/ChrisKitching) cleaned up the CMake files.
+- [Tom Needham](https://github.com/06needhamt) fixed a subtle bug with MSVC 2015 which was also proposed by [Michael K.](https://github.com/Epidal).
+- [Mário Feroldi](https://github.com/thelostt) fixed a small typo.
+- [duncanwerner](https://github.com/duncanwerner) found a really embarrassing performance regression in the 2.0.0 release.
+- [Damien](https://github.com/dtoma) fixed one of the last conversion warnings.
+- [Thomas Braun](https://github.com/t-b) fixed a warning in a test case.
+- [Théo DELRIEU](https://github.com/theodelrieu) patiently and constructively oversaw the long way toward [iterator-range parsing](https://github.com/nlohmann/json/issues/290). He also implemented the magic behind the serialization/deserialization of user-defined types and split the single header file into smaller chunks.
+- [Stefan](https://github.com/5tefan) fixed a minor issue in the documentation.
+- [Vasil Dimov](https://github.com/vasild) fixed the documentation regarding conversions from `std::multiset`.
+- [ChristophJud](https://github.com/ChristophJud) overworked the CMake files to ease project inclusion.
+- [Vladimir Petrigo](https://github.com/vpetrigo) made a SFINAE hack more readable and added Visual Studio 17 to the build matrix.
+- [Denis Andrejew](https://github.com/seeekr) fixed a grammar issue in the README file.
+- [Pierre-Antoine Lacaze](https://github.com/palacaze) found a subtle bug in the `dump()` function.
+- [TurpentineDistillery](https://github.com/TurpentineDistillery) pointed to [`std::locale::classic()`](https://en.cppreference.com/w/cpp/locale/locale/classic) to avoid too much locale joggling, found some nice performance improvements in the parser, improved the benchmarking code, and realized locale-independent number parsing and printing.
+- [cgzones](https://github.com/cgzones) had an idea how to fix the Coverity scan.
+- [Jared Grubb](https://github.com/jaredgrubb) silenced a nasty documentation warning.
+- [Yixin Zhang](https://github.com/qwename) fixed an integer overflow check.
+- [Bosswestfalen](https://github.com/Bosswestfalen) merged two iterator classes into a smaller one.
+- [Daniel599](https://github.com/Daniel599) helped to get Travis execute the tests with Clang's sanitizers.
+- [Jonathan Lee](https://github.com/vjon) fixed an example in the README file.
+- [gnzlbg](https://github.com/gnzlbg) supported the implementation of user-defined types.
+- [Alexej Harm](https://github.com/qis) helped to get the user-defined types working with Visual Studio.
+- [Jared Grubb](https://github.com/jaredgrubb) supported the implementation of user-defined types.
+- [EnricoBilla](https://github.com/EnricoBilla) noted a typo in an example.
+- [Martin Hořeňovský](https://github.com/horenmar) found a way for a 2x speedup for the compilation time of the test suite.
+- [ukhegg](https://github.com/ukhegg) found proposed an improvement for the examples section.
+- [rswanson-ihi](https://github.com/rswanson-ihi) noted a typo in the README.
+- [Mihai Stan](https://github.com/stanmihai4) fixed a bug in the comparison with `nullptr`s.
+- [Tushar Maheshwari](https://github.com/tusharpm) added [cotire](https://github.com/sakra/cotire) support to speed up the compilation.
+- [TedLyngmo](https://github.com/TedLyngmo) noted a typo in the README, removed unnecessary bit arithmetic, and fixed some `-Weffc++` warnings.
+- [Krzysztof Woś](https://github.com/krzysztofwos) made exceptions more visible.
+- [ftillier](https://github.com/ftillier) fixed a compiler warning.
+- [tinloaf](https://github.com/tinloaf) made sure all pushed warnings are properly popped.
+- [Fytch](https://github.com/Fytch) found a bug in the documentation.
+- [Jay Sistar](https://github.com/Type1J) implemented a Meson build description.
+- [Henry Lee](https://github.com/HenryRLee) fixed a warning in ICC and improved the iterator implementation.
+- [Vincent Thiery](https://github.com/vthiery) maintains a package for the Conan package manager.
+- [Steffen](https://github.com/koemeet) fixed a potential issue with MSVC and `std::min`.
+- [Mike Tzou](https://github.com/Chocobo1) fixed some typos.
+- [amrcode](https://github.com/amrcode) noted a misleading documentation about comparison of floats.
+- [Oleg Endo](https://github.com/olegendo) reduced the memory consumption by replacing `<iostream>` with `<iosfwd>`.
+- [dan-42](https://github.com/dan-42) cleaned up the CMake files to simplify including/reusing of the library.
+- [Nikita Ofitserov](https://github.com/himikof) allowed for moving values from initializer lists.
+- [Greg Hurrell](https://github.com/wincent) fixed a typo.
+- [Dmitry Kukovinets](https://github.com/DmitryKuk) fixed a typo.
+- [kbthomp1](https://github.com/kbthomp1) fixed an issue related to the Intel OSX compiler.
+- [Markus Werle](https://github.com/daixtrose) fixed a typo.
+- [WebProdPP](https://github.com/WebProdPP) fixed a subtle error in a precondition check.
+- [Alex](https://github.com/leha-bot) noted an error in a code sample.
+- [Tom de Geus](https://github.com/tdegeus) reported some warnings with ICC and helped fixing them.
+- [Perry Kundert](https://github.com/pjkundert) simplified reading from input streams.
+- [Sonu Lohani](https://github.com/sonulohani) fixed a small compilation error.
+- [Jamie Seward](https://github.com/jseward) fixed all MSVC warnings.
+- [Nate Vargas](https://github.com/eld00d) added a Doxygen tag file.
+- [pvleuven](https://github.com/pvleuven) helped fixing a warning in ICC.
+- [Pavel](https://github.com/crea7or) helped fixing some warnings in MSVC.
+- [Jamie Seward](https://github.com/jseward) avoided unnecessary string copies in `find()` and `count()`.
+- [Mitja](https://github.com/Itja) fixed some typos.
+- [Jorrit Wronski](https://github.com/jowr) updated the Hunter package links.
+- [Matthias Möller](https://github.com/TinyTinni) added a `.natvis` for the MSVC debug view.
+- [bogemic](https://github.com/bogemic) fixed some C++17 deprecation warnings.
+- [Eren Okka](https://github.com/erengy) fixed some MSVC warnings.
+- [abolz](https://github.com/abolz) integrated the Grisu2 algorithm for proper floating-point formatting, allowing more roundtrip checks to succeed.
+- [Vadim Evard](https://github.com/Pipeliner) fixed a Markdown issue in the README.
+- [zerodefect](https://github.com/zerodefect) fixed a compiler warning.
+- [Kert](https://github.com/kaidokert) allowed to template the string type in the serialization and added the possibility to override the exceptional behavior.
+- [mark-99](https://github.com/mark-99) helped fixing an ICC error.
+- [Patrik Huber](https://github.com/patrikhuber) fixed links in the README file.
+- [johnfb](https://github.com/johnfb) found a bug in the implementation of CBOR's indefinite length strings.
+- [Paul Fultz II](https://github.com/pfultz2) added a note on the cget package manager.
+- [Wilson Lin](https://github.com/wla80) made the integration section of the README more concise.
+- [RalfBielig](https://github.com/ralfbielig) detected and fixed a memory leak in the parser callback.
+- [agrianius](https://github.com/agrianius) allowed to dump JSON to an alternative string type.
+- [Kevin Tonon](https://github.com/ktonon) overworked the C++11 compiler checks in CMake.
+- [Axel Huebl](https://github.com/ax3l) simplified a CMake check and added support for the [Spack package manager](https://spack.io).
+- [Carlos O'Ryan](https://github.com/coryan) fixed a typo.
+- [James Upjohn](https://github.com/jammehcow) fixed a version number in the compilers section.
+- [Chuck Atkins](https://github.com/chuckatkins) adjusted the CMake files to the CMake packaging guidelines
+- [Jan Schöppach](https://github.com/dns13) fixed a typo.
+- [martin-mfg](https://github.com/martin-mfg) fixed a typo.
+- [Matthias Möller](https://github.com/TinyTinni) removed the dependency from `std::stringstream`.
+- [agrianius](https://github.com/agrianius) added code to use alternative string implementations.
+- [Daniel599](https://github.com/Daniel599) allowed to use more algorithms with the `items()` function.
+- [Julius Rakow](https://github.com/jrakow) fixed the Meson include directory and fixed the links to [cppreference.com](cppreference.com).
+- [Sonu Lohani](https://github.com/sonulohani) fixed the compilation with MSVC 2015 in debug mode.
+- [grembo](https://github.com/grembo) fixed the test suite and re-enabled several test cases.
+- [Hyeon Kim](https://github.com/simnalamburt) introduced the macro `JSON_INTERNAL_CATCH` to control the exception handling inside the library.
+- [thyu](https://github.com/thyu) fixed a compiler warning.
+
+Thanks a lot for helping out! Please [let me know](mailto:[email protected]) if I forgot someone.
+
+
+## Used third-party tools
+
+The library itself consists of a single header file licensed under the MIT license. However, it is built, tested, documented, and whatnot using a lot of third-party tools and services. Thanks a lot!
+
+- [**amalgamate.py - Amalgamate C source and header files**](https://github.com/edlund/amalgamate) to create a single header file
+- [**American fuzzy lop**](http://lcamtuf.coredump.cx/afl/) for fuzz testing
+- [**AppVeyor**](https://www.appveyor.com) for [continuous integration](https://ci.appveyor.com/project/nlohmann/json) on Windows
+- [**Artistic Style**](http://astyle.sourceforge.net) for automatic source code identation
+- [**Catch**](https://github.com/philsquared/Catch) for the unit tests
+- [**Clang**](http://clang.llvm.org) for compilation with code sanitizers
+- [**Cmake**](https://cmake.org) for build automation
+- [**Codacity**](https://www.codacy.com) for further [code analysis](https://www.codacy.com/app/nlohmann/json)
+- [**Coveralls**](https://coveralls.io) to measure [code coverage](https://coveralls.io/github/nlohmann/json)
+- [**Coverity Scan**](https://scan.coverity.com) for [static analysis](https://scan.coverity.com/projects/nlohmann-json)
+- [**cppcheck**](http://cppcheck.sourceforge.net) for static analysis
+- [**Doxygen**](http://www.stack.nl/~dimitri/doxygen/) to generate [documentation](https://nlohmann.github.io/json/)
+- [**git-update-ghpages**](https://github.com/rstacruz/git-update-ghpages) to upload the documentation to gh-pages
+- [**GitHub Changelog Generator**](https://github.com/skywinder/github-changelog-generator) to generate the [ChangeLog](https://github.com/nlohmann/json/blob/develop/ChangeLog.md)
+- [**Google Benchmark**](https://github.com/google/benchmark) to implement the benchmarks
+- [**libFuzzer**](http://llvm.org/docs/LibFuzzer.html) to implement fuzz testing for OSS-Fuzz
+- [**OSS-Fuzz**](https://github.com/google/oss-fuzz) for continuous fuzz testing of the library ([project repository](https://github.com/google/oss-fuzz/tree/master/projects/json))
+- [**Probot**](https://probot.github.io) for automating maintainer tasks such as closing stale issues, requesting missing information, or detecting toxic comments.
+- [**send_to_wandbox**](https://github.com/nlohmann/json/blob/develop/doc/scripts/send_to_wandbox.py) to send code examples to [Wandbox](http://melpon.org/wandbox)
+- [**Travis**](https://travis-ci.org) for [continuous integration](https://travis-ci.org/nlohmann/json) on Linux and macOS
+- [**Valgrind**](http://valgrind.org) to check for correct memory management
+- [**Wandbox**](http://melpon.org/wandbox) for [online examples](https://wandbox.org/permlink/TarF5pPn9NtHQjhf)
+
+
+## Projects using JSON for Modern C++
+
+The library is currently used in Apple macOS Sierra and iOS 10. I am not sure what they are using the library for, but I am happy that it runs on so many devices.
+
+
+## Notes
+
+- The code contains numerous debug **assertions** which can be switched off by defining the preprocessor macro `NDEBUG`, see the [documentation of `assert`](https://en.cppreference.com/w/cpp/error/assert). In particular, note [`operator[]`](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_a2e26bd0b0168abb61f67ad5bcd5b9fa1.html#a2e26bd0b0168abb61f67ad5bcd5b9fa1) implements **unchecked access** for const objects: If the given key is not present, the behavior is undefined (think of a dereferenced null pointer) and yields an [assertion failure](https://github.com/nlohmann/json/issues/289) if assertions are switched on. If you are not sure whether an element in an object exists, use checked access with the [`at()` function](https://nlohmann.github.io/json/classnlohmann_1_1basic__json_a674de1ee73e6bf4843fc5dc1351fb726.html#a674de1ee73e6bf4843fc5dc1351fb726).
+- As the exact type of a number is not defined in the [JSON specification](http://rfc7159.net/rfc7159), this library tries to choose the best fitting C++ number type automatically. As a result, the type `double` may be used to store numbers which may yield [**floating-point exceptions**](https://github.com/nlohmann/json/issues/181) in certain rare situations if floating-point exceptions have been unmasked in the calling code. These exceptions are not caused by the library and need to be fixed in the calling code, such as by re-masking the exceptions prior to calling library functions.
+- The library supports **Unicode input** as follows:
+  - Only **UTF-8** encoded input is supported which is the default encoding for JSON according to [RFC 7159](http://rfc7159.net/rfc7159#rfc.section.8.1).
+  - Other encodings such as Latin-1, UTF-16, or UTF-32 are not supported and will yield parse or serialization errors.
+  - [Unicode noncharacters](http://www.unicode.org/faq/private_use.html#nonchar1) will not be replaced by the library.
+  - Invalid surrogates (e.g., incomplete pairs such as `\uDEAD`) will yield parse errors.
+  - The strings stored in the library are UTF-8 encoded. When using the default string type (`std::string`), note that its length/size functions return the number of stored bytes rather than the number of characters or glyphs.
+- The code can be compiled without C++ **runtime type identification** features; that is, you can use the `-fno-rtti` compiler flag.
+- **Exceptions** are used widely within the library. They can, however, be switched off with either using the compiler flag `-fno-exceptions` or by defining the symbol `JSON_NOEXCEPTION`. In this case, exceptions are replaced by an `abort()` call.
+- By default, the library does not preserve the **insertion order of object elements**. This is standards-compliant, as the [JSON standard](https://tools.ietf.org/html/rfc7159.html) defines objects as "an unordered collection of zero or more name/value pairs". If you do want to preserve the insertion order, you can specialize the object type with containers like [`tsl::ordered_map`](https://github.com/Tessil/ordered-map) ([integration](https://github.com/nlohmann/json/issues/546#issuecomment-304447518)) or [`nlohmann::fifo_map`](https://github.com/nlohmann/fifo_map) ([integration](https://github.com/nlohmann/json/issues/485#issuecomment-333652309)).
+
+
+## Execute unit tests
+
+To compile and run the tests, you need to execute
+
+```sh
+$ mkdir build
+$ cd build
+$ cmake ..
+$ cmake --build .
+$ ctest --output-on-failure
+```
+
+For more information, have a look at the file [.travis.yml](https://github.com/nlohmann/json/blob/master/.travis.yml).

controller/thirdparty/json/json.hpp

@@ -0,0 +1,18912 @@
+/*
+    __ _____ _____ _____
+ __|  |   __|     |   | |  JSON for Modern C++
+|  |  |__   |  |  | | | |  version 3.2.0
+|_____|_____|_____|_|___|  https://github.com/nlohmann/json
+
+Licensed under the MIT License <http://opensource.org/licenses/MIT>.
+SPDX-License-Identifier: MIT
+Copyright (c) 2013-2018 Niels Lohmann <http://nlohmann.me>.
+
+Permission is hereby  granted, free of charge, to any  person obtaining a copy
+of this software and associated  documentation files (the "Software"), to deal
+in the Software  without restriction, including without  limitation the rights
+to  use, copy,  modify, merge,  publish, distribute,  sublicense, and/or  sell
+copies  of  the Software,  and  to  permit persons  to  whom  the Software  is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE  IS PROVIDED "AS  IS", WITHOUT WARRANTY  OF ANY KIND,  EXPRESS OR
+IMPLIED,  INCLUDING BUT  NOT  LIMITED TO  THE  WARRANTIES OF  MERCHANTABILITY,
+FITNESS FOR  A PARTICULAR PURPOSE AND  NONINFRINGEMENT. IN NO EVENT  SHALL THE
+AUTHORS  OR COPYRIGHT  HOLDERS  BE  LIABLE FOR  ANY  CLAIM,  DAMAGES OR  OTHER
+LIABILITY, WHETHER IN AN ACTION OF  CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE  OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+*/
+
+#ifndef NLOHMANN_JSON_HPP
+#define NLOHMANN_JSON_HPP
+
+#define NLOHMANN_JSON_VERSION_MAJOR 3
+#define NLOHMANN_JSON_VERSION_MINOR 2
+#define NLOHMANN_JSON_VERSION_PATCH 0
+
+#include <algorithm> // all_of, find, for_each
+#include <cassert> // assert
+#include <ciso646> // and, not, or
+#include <cstddef> // nullptr_t, ptrdiff_t, size_t
+#include <functional> // hash, less
+#include <initializer_list> // initializer_list
+#include <iosfwd> // istream, ostream
+#include <iterator> // iterator_traits, random_access_iterator_tag
+#include <numeric> // accumulate
+#include <string> // string, stoi, to_string
+#include <utility> // declval, forward, move, pair, swap
+
+// #include <nlohmann/json_fwd.hpp>
+#ifndef NLOHMANN_JSON_FWD_HPP
+#define NLOHMANN_JSON_FWD_HPP
+
+#include <cstdint> // int64_t, uint64_t
+#include <map> // map
+#include <memory> // allocator
+#include <string> // string
+#include <vector> // vector
+
+/*!
+@brief namespace for Niels Lohmann
+@see https://github.com/nlohmann
+@since version 1.0.0
+*/
+namespace nlohmann
+{
+/*!
+@brief default JSONSerializer template argument
+
+This serializer ignores the template arguments and uses ADL
+([argument-dependent lookup](https://en.cppreference.com/w/cpp/language/adl))
+for serialization.
+*/
+template<typename T = void, typename SFINAE = void>
+struct adl_serializer;
+
+template<template<typename U, typename V, typename... Args> class ObjectType =
+         std::map,
+         template<typename U, typename... Args> class ArrayType = std::vector,
+         class StringType = std::string, class BooleanType = bool,
+         class NumberIntegerType = std::int64_t,
+         class NumberUnsignedType = std::uint64_t,
+         class NumberFloatType = double,
+         template<typename U> class AllocatorType = std::allocator,
+         template<typename T, typename SFINAE = void> class JSONSerializer =
+         adl_serializer>
+class basic_json;
+
+/*!
+@brief JSON Pointer
+
+A JSON pointer defines a string syntax for identifying a specific value
+within a JSON document. It can be used with functions `at` and
+`operator[]`. Furthermore, JSON pointers are the base for JSON patches.
+
+@sa [RFC 6901](https://tools.ietf.org/html/rfc6901)
+
+@since version 2.0.0
+*/
+template<typename BasicJsonType>
+class json_pointer;
+
+/*!
+@brief default JSON class
+
+This type is the default specialization of the @ref basic_json class which
+uses the standard template types.
+
+@since version 1.0.0
+*/
+using json = basic_json<>;
+}
+
+#endif
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+// This file contains all internal macro definitions
+// You MUST include macro_unscope.hpp at the end of json.hpp to undef all of them
+
+// exclude unsupported compilers
+#if !defined(JSON_SKIP_UNSUPPORTED_COMPILER_CHECK)
+    #if defined(__clang__)
+        #if (__clang_major__ * 10000 + __clang_minor__ * 100 + __clang_patchlevel__) < 30400
+            #error "unsupported Clang version - see https://github.com/nlohmann/json#supported-compilers"
+        #endif
+    #elif defined(__GNUC__) && !(defined(__ICC) || defined(__INTEL_COMPILER))
+        #if (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) < 40900
+            #error "unsupported GCC version - see https://github.com/nlohmann/json#supported-compilers"
+        #endif
+    #endif
+#endif
+
+// disable float-equal warnings on GCC/clang
+#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__)
+    #pragma GCC diagnostic push
+    #pragma GCC diagnostic ignored "-Wfloat-equal"
+#endif
+
+// disable documentation warnings on clang
+#if defined(__clang__)
+    #pragma GCC diagnostic push
+    #pragma GCC diagnostic ignored "-Wdocumentation"
+#endif
+
+// allow for portable deprecation warnings
+#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__)
+    #define JSON_DEPRECATED __attribute__((deprecated))
+#elif defined(_MSC_VER)
+    #define JSON_DEPRECATED __declspec(deprecated)
+#else
+    #define JSON_DEPRECATED
+#endif
+
+// allow to disable exceptions
+#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND)) && !defined(JSON_NOEXCEPTION)
+    #define JSON_THROW(exception) throw exception
+    #define JSON_TRY try
+    #define JSON_CATCH(exception) catch(exception)
+    #define JSON_INTERNAL_CATCH(exception) catch(exception)
+#else
+    #define JSON_THROW(exception) std::abort()
+    #define JSON_TRY if(true)
+    #define JSON_CATCH(exception) if(false)
+    #define JSON_INTERNAL_CATCH(exception) if(false)
+#endif
+
+// override exception macros
+#if defined(JSON_THROW_USER)
+    #undef JSON_THROW
+    #define JSON_THROW JSON_THROW_USER
+#endif
+#if defined(JSON_TRY_USER)
+    #undef JSON_TRY
+    #define JSON_TRY JSON_TRY_USER
+#endif
+#if defined(JSON_CATCH_USER)
+    #undef JSON_CATCH
+    #define JSON_CATCH JSON_CATCH_USER
+    #define JSON_INTERNAL_CATCH JSON_CATCH_USER
+#endif
+#if defined(JSON_INTERNAL_CATCH_USER)
+    #undef JSON_INTERNAL_CATCH
+    #define JSON_INTERNAL_CATCH JSON_INTERNAL_CATCH_USER
+#endif
+
+// manual branch prediction
+#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__)
+    #define JSON_LIKELY(x)      __builtin_expect(!!(x), 1)
+    #define JSON_UNLIKELY(x)    __builtin_expect(!!(x), 0)
+#else
+    #define JSON_LIKELY(x)      x
+    #define JSON_UNLIKELY(x)    x
+#endif
+
+// C++ language standard detection
+#if (defined(__cplusplus) && __cplusplus >= 201703L) || (defined(_HAS_CXX17) && _HAS_CXX17 == 1) // fix for issue #464
+    #define JSON_HAS_CPP_17
+    #define JSON_HAS_CPP_14
+#elif (defined(__cplusplus) && __cplusplus >= 201402L) || (defined(_HAS_CXX14) && _HAS_CXX14 == 1)
+    #define JSON_HAS_CPP_14
+#endif
+
+// Ugly macros to avoid uglier copy-paste when specializing basic_json. They
+// may be removed in the future once the class is split.
+
+#define NLOHMANN_BASIC_JSON_TPL_DECLARATION                                \
+    template<template<typename, typename, typename...> class ObjectType,   \
+             template<typename, typename...> class ArrayType,              \
+             class StringType, class BooleanType, class NumberIntegerType, \
+             class NumberUnsignedType, class NumberFloatType,              \
+             template<typename> class AllocatorType,                       \
+             template<typename, typename = void> class JSONSerializer>
+
+#define NLOHMANN_BASIC_JSON_TPL                                            \
+    basic_json<ObjectType, ArrayType, StringType, BooleanType,             \
+    NumberIntegerType, NumberUnsignedType, NumberFloatType,                \
+    AllocatorType, JSONSerializer>
+
+/*!
+@brief Helper to determine whether there's a key_type for T.
+
+This helper is used to tell associative containers apart from other containers
+such as sequence containers. For instance, `std::map` passes the test as it
+contains a `mapped_type`, whereas `std::vector` fails the test.
+
+@sa http://stackoverflow.com/a/7728728/266378
+@since version 1.0.0, overworked in version 2.0.6
+*/
+#define NLOHMANN_JSON_HAS_HELPER(type)                                        \
+    template<typename T> struct has_##type {                                  \
+    private:                                                                  \
+        template<typename U, typename = typename U::type>                     \
+        static int detect(U &&);                                              \
+        static void detect(...);                                              \
+    public:                                                                   \
+        static constexpr bool value =                                         \
+                std::is_integral<decltype(detect(std::declval<T>()))>::value; \
+    }
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+
+#include <ciso646> // not
+#include <cstddef> // size_t
+#include <type_traits> // conditional, enable_if, false_type, integral_constant, is_constructible, is_integral, is_same, remove_cv, remove_reference, true_type
+
+namespace nlohmann
+{
+namespace detail
+{
+// alias templates to reduce boilerplate
+template<bool B, typename T = void>
+using enable_if_t = typename std::enable_if<B, T>::type;
+
+template<typename T>
+using uncvref_t = typename std::remove_cv<typename std::remove_reference<T>::type>::type;
+
+// implementation of C++14 index_sequence and affiliates
+// source: https://stackoverflow.com/a/32223343
+template<std::size_t... Ints>
+struct index_sequence
+{
+    using type = index_sequence;
+    using value_type = std::size_t;
+    static constexpr std::size_t size() noexcept
+    {
+        return sizeof...(Ints);
+    }
+};
+
+template<class Sequence1, class Sequence2>
+struct merge_and_renumber;
+
+template<std::size_t... I1, std::size_t... I2>
+struct merge_and_renumber<index_sequence<I1...>, index_sequence<I2...>>
+        : index_sequence < I1..., (sizeof...(I1) + I2)... > {};
+
+template<std::size_t N>
+struct make_index_sequence
+    : merge_and_renumber < typename make_index_sequence < N / 2 >::type,
+      typename make_index_sequence < N - N / 2 >::type > {};
+
+template<> struct make_index_sequence<0> : index_sequence<> {};
+template<> struct make_index_sequence<1> : index_sequence<0> {};
+
+template<typename... Ts>
+using index_sequence_for = make_index_sequence<sizeof...(Ts)>;
+
+/*
+Implementation of two C++17 constructs: conjunction, negation. This is needed
+to avoid evaluating all the traits in a condition
+
+For example: not std::is_same<void, T>::value and has_value_type<T>::value
+will not compile when T = void (on MSVC at least). Whereas
+conjunction<negation<std::is_same<void, T>>, has_value_type<T>>::value will
+stop evaluating if negation<...>::value == false
+
+Please note that those constructs must be used with caution, since symbols can
+become very long quickly (which can slow down compilation and cause MSVC
+internal compiler errors). Only use it when you have to (see example ahead).
+*/
+template<class...> struct conjunction : std::true_type {};
+template<class B1> struct conjunction<B1> : B1 {};
+template<class B1, class... Bn>
+struct conjunction<B1, Bn...> : std::conditional<bool(B1::value), conjunction<Bn...>, B1>::type {};
+
+template<class B> struct negation : std::integral_constant<bool, not B::value> {};
+
+// dispatch utility (taken from ranges-v3)
+template<unsigned N> struct priority_tag : priority_tag < N - 1 > {};
+template<> struct priority_tag<0> {};
+
+// taken from ranges-v3
+template<typename T>
+struct static_const
+{
+    static constexpr T value{};
+};
+
+template<typename T>
+constexpr T static_const<T>::value;
+}
+}
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+#include <ciso646> // not
+#include <limits> // numeric_limits
+#include <type_traits> // false_type, is_constructible, is_integral, is_same, true_type
+#include <utility> // declval
+
+// #include <nlohmann/json_fwd.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+namespace nlohmann
+{
+/*!
+@brief detail namespace with internal helper functions
+
+This namespace collects functions that should not be exposed,
+implementations of some @ref basic_json methods, and meta-programming helpers.
+
+@since version 2.1.0
+*/
+namespace detail
+{
+/////////////
+// helpers //
+/////////////
+
+template<typename> struct is_basic_json : std::false_type {};
+
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+struct is_basic_json<NLOHMANN_BASIC_JSON_TPL> : std::true_type {};
+
+////////////////////////
+// has_/is_ functions //
+////////////////////////
+
+// source: https://stackoverflow.com/a/37193089/4116453
+
+template <typename T, typename = void>
+struct is_complete_type : std::false_type {};
+
+template <typename T>
+struct is_complete_type<T, decltype(void(sizeof(T)))> : std::true_type {};
+
+NLOHMANN_JSON_HAS_HELPER(mapped_type);
+NLOHMANN_JSON_HAS_HELPER(key_type);
+NLOHMANN_JSON_HAS_HELPER(value_type);
+NLOHMANN_JSON_HAS_HELPER(iterator);
+
+template<bool B, class RealType, class CompatibleObjectType>
+struct is_compatible_object_type_impl : std::false_type {};
+
+template<class RealType, class CompatibleObjectType>
+struct is_compatible_object_type_impl<true, RealType, CompatibleObjectType>
+{
+    static constexpr auto value =
+        std::is_constructible<typename RealType::key_type, typename CompatibleObjectType::key_type>::value and
+        std::is_constructible<typename RealType::mapped_type, typename CompatibleObjectType::mapped_type>::value;
+};
+
+template<bool B, class RealType, class CompatibleStringType>
+struct is_compatible_string_type_impl : std::false_type {};
+
+template<class RealType, class CompatibleStringType>
+struct is_compatible_string_type_impl<true, RealType, CompatibleStringType>
+{
+    static constexpr auto value =
+        std::is_same<typename RealType::value_type, typename CompatibleStringType::value_type>::value and
+        std::is_constructible<RealType, CompatibleStringType>::value;
+};
+
+template<class BasicJsonType, class CompatibleObjectType>
+struct is_compatible_object_type
+{
+    static auto constexpr value = is_compatible_object_type_impl <
+                                  conjunction<negation<std::is_same<void, CompatibleObjectType>>,
+                                  has_mapped_type<CompatibleObjectType>,
+                                  has_key_type<CompatibleObjectType>>::value,
+                                  typename BasicJsonType::object_t, CompatibleObjectType >::value;
+};
+
+template<class BasicJsonType, class CompatibleStringType>
+struct is_compatible_string_type
+{
+    static auto constexpr value = is_compatible_string_type_impl <
+                                  conjunction<negation<std::is_same<void, CompatibleStringType>>,
+                                  has_value_type<CompatibleStringType>>::value,
+                                  typename BasicJsonType::string_t, CompatibleStringType >::value;
+};
+
+template<typename BasicJsonType, typename T>
+struct is_basic_json_nested_type
+{
+    static auto constexpr value = std::is_same<T, typename BasicJsonType::iterator>::value or
+                                  std::is_same<T, typename BasicJsonType::const_iterator>::value or
+                                  std::is_same<T, typename BasicJsonType::reverse_iterator>::value or
+                                  std::is_same<T, typename BasicJsonType::const_reverse_iterator>::value;
+};
+
+template<class BasicJsonType, class CompatibleArrayType>
+struct is_compatible_array_type
+{
+    static auto constexpr value =
+        conjunction<negation<std::is_same<void, CompatibleArrayType>>,
+        negation<is_compatible_object_type<
+        BasicJsonType, CompatibleArrayType>>,
+        negation<std::is_constructible<typename BasicJsonType::string_t,
+        CompatibleArrayType>>,
+        negation<is_basic_json_nested_type<BasicJsonType, CompatibleArrayType>>,
+        has_value_type<CompatibleArrayType>,
+        has_iterator<CompatibleArrayType>>::value;
+};
+
+template<bool, typename, typename>
+struct is_compatible_integer_type_impl : std::false_type {};
+
+template<typename RealIntegerType, typename CompatibleNumberIntegerType>
+struct is_compatible_integer_type_impl<true, RealIntegerType, CompatibleNumberIntegerType>
+{
+    // is there an assert somewhere on overflows?
+    using RealLimits = std::numeric_limits<RealIntegerType>;
+    using CompatibleLimits = std::numeric_limits<CompatibleNumberIntegerType>;
+
+    static constexpr auto value =
+        std::is_constructible<RealIntegerType, CompatibleNumberIntegerType>::value and
+        CompatibleLimits::is_integer and
+        RealLimits::is_signed == CompatibleLimits::is_signed;
+};
+
+template<typename RealIntegerType, typename CompatibleNumberIntegerType>
+struct is_compatible_integer_type
+{
+    static constexpr auto value =
+        is_compatible_integer_type_impl <
+        std::is_integral<CompatibleNumberIntegerType>::value and
+        not std::is_same<bool, CompatibleNumberIntegerType>::value,
+        RealIntegerType, CompatibleNumberIntegerType > ::value;
+};
+
+// trait checking if JSONSerializer<T>::from_json(json const&, udt&) exists
+template<typename BasicJsonType, typename T>
+struct has_from_json
+{
+  private:
+    // also check the return type of from_json
+    template<typename U, typename = enable_if_t<std::is_same<void, decltype(uncvref_t<U>::from_json(
+                 std::declval<BasicJsonType>(), std::declval<T&>()))>::value>>
+    static int detect(U&&);
+    static void detect(...);
+
+  public:
+    static constexpr bool value = std::is_integral<decltype(
+                                      detect(std::declval<typename BasicJsonType::template json_serializer<T, void>>()))>::value;
+};
+
+// This trait checks if JSONSerializer<T>::from_json(json const&) exists
+// this overload is used for non-default-constructible user-defined-types
+template<typename BasicJsonType, typename T>
+struct has_non_default_from_json
+{
+  private:
+    template <
+        typename U,
+        typename = enable_if_t<std::is_same<
+                                   T, decltype(uncvref_t<U>::from_json(std::declval<BasicJsonType>()))>::value >>
+    static int detect(U&&);
+    static void detect(...);
+
+  public:
+    static constexpr bool value = std::is_integral<decltype(detect(
+                                      std::declval<typename BasicJsonType::template json_serializer<T, void>>()))>::value;
+};
+
+// This trait checks if BasicJsonType::json_serializer<T>::to_json exists
+template<typename BasicJsonType, typename T>
+struct has_to_json
+{
+  private:
+    template<typename U, typename = decltype(uncvref_t<U>::to_json(
+                 std::declval<BasicJsonType&>(), std::declval<T>()))>
+    static int detect(U&&);
+    static void detect(...);
+
+  public:
+    static constexpr bool value = std::is_integral<decltype(detect(
+                                      std::declval<typename BasicJsonType::template json_serializer<T, void>>()))>::value;
+};
+
+template <typename BasicJsonType, typename CompatibleCompleteType>
+struct is_compatible_complete_type
+{
+    static constexpr bool value =
+        not std::is_base_of<std::istream, CompatibleCompleteType>::value and
+        not is_basic_json<CompatibleCompleteType>::value and
+        not is_basic_json_nested_type<BasicJsonType, CompatibleCompleteType>::value and
+        has_to_json<BasicJsonType, CompatibleCompleteType>::value;
+};
+
+template <typename BasicJsonType, typename CompatibleType>
+struct is_compatible_type
+    : conjunction<is_complete_type<CompatibleType>,
+      is_compatible_complete_type<BasicJsonType, CompatibleType>>
+{
+};
+}
+}
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+
+#include <exception> // exception
+#include <stdexcept> // runtime_error
+#include <string> // to_string
+
+namespace nlohmann
+{
+namespace detail
+{
+////////////////
+// exceptions //
+////////////////
+
+/*!
+@brief general exception of the @ref basic_json class
+
+This class is an extension of `std::exception` objects with a member @a id for
+exception ids. It is used as the base class for all exceptions thrown by the
+@ref basic_json class. This class can hence be used as "wildcard" to catch
+exceptions.
+
+Subclasses:
+- @ref parse_error for exceptions indicating a parse error
+- @ref invalid_iterator for exceptions indicating errors with iterators
+- @ref type_error for exceptions indicating executing a member function with
+                  a wrong type
+- @ref out_of_range for exceptions indicating access out of the defined range
+- @ref other_error for exceptions indicating other library errors
+
+@internal
+@note To have nothrow-copy-constructible exceptions, we internally use
+      `std::runtime_error` which can cope with arbitrary-length error messages.
+      Intermediate strings are built with static functions and then passed to
+      the actual constructor.
+@endinternal
+
+@liveexample{The following code shows how arbitrary library exceptions can be
+caught.,exception}
+
+@since version 3.0.0
+*/
+class exception : public std::exception
+{
+  public:
+    /// returns the explanatory string
+    const char* what() const noexcept override
+    {
+        return m.what();
+    }
+
+    /// the id of the exception
+    const int id;
+
+  protected:
+    exception(int id_, const char* what_arg) : id(id_), m(what_arg) {}
+
+    static std::string name(const std::string& ename, int id_)
+    {
+        return "[json.exception." + ename + "." + std::to_string(id_) + "] ";
+    }
+
+  private:
+    /// an exception object as storage for error messages
+    std::runtime_error m;
+};
+
+/*!
+@brief exception indicating a parse error
+
+This exception is thrown by the library when a parse error occurs. Parse errors
+can occur during the deserialization of JSON text, CBOR, MessagePack, as well
+as when using JSON Patch.
+
+Member @a byte holds the byte index of the last read character in the input
+file.
+
+Exceptions have ids 1xx.
+
+name / id                      | example message | description
+------------------------------ | --------------- | -------------------------
+json.exception.parse_error.101 | parse error at 2: unexpected end of input; expected string literal | This error indicates a syntax error while deserializing a JSON text. The error message describes that an unexpected token (character) was encountered, and the member @a byte indicates the error position.
+json.exception.parse_error.102 | parse error at 14: missing or wrong low surrogate | JSON uses the `\uxxxx` format to describe Unicode characters. Code points above above 0xFFFF are split into two `\uxxxx` entries ("surrogate pairs"). This error indicates that the surrogate pair is incomplete or contains an invalid code point.
+json.exception.parse_error.103 | parse error: code points above 0x10FFFF are invalid | Unicode supports code points up to 0x10FFFF. Code points above 0x10FFFF are invalid.
+json.exception.parse_error.104 | parse error: JSON patch must be an array of objects | [RFC 6902](https://tools.ietf.org/html/rfc6902) requires a JSON Patch document to be a JSON document that represents an array of objects.
+json.exception.parse_error.105 | parse error: operation must have string member 'op' | An operation of a JSON Patch document must contain exactly one "op" member, whose value indicates the operation to perform. Its value must be one of "add", "remove", "replace", "move", "copy", or "test"; other values are errors.
+json.exception.parse_error.106 | parse error: array index '01' must not begin with '0' | An array index in a JSON Pointer ([RFC 6901](https://tools.ietf.org/html/rfc6901)) may be `0` or any number without a leading `0`.
+json.exception.parse_error.107 | parse error: JSON pointer must be empty or begin with '/' - was: 'foo' | A JSON Pointer must be a Unicode string containing a sequence of zero or more reference tokens, each prefixed by a `/` character.
+json.exception.parse_error.108 | parse error: escape character '~' must be followed with '0' or '1' | In a JSON Pointer, only `~0` and `~1` are valid escape sequences.
+json.exception.parse_error.109 | parse error: array index 'one' is not a number | A JSON Pointer array index must be a number.
+json.exception.parse_error.110 | parse error at 1: cannot read 2 bytes from vector | When parsing CBOR or MessagePack, the byte vector ends before the complete value has been read.
+json.exception.parse_error.112 | parse error at 1: error reading CBOR; last byte: 0xF8 | Not all types of CBOR or MessagePack are supported. This exception occurs if an unsupported byte was read.
+json.exception.parse_error.113 | parse error at 2: expected a CBOR string; last byte: 0x98 | While parsing a map key, a value that is not a string has been read.
+
+@note For an input with n bytes, 1 is the index of the first character and n+1
+      is the index of the terminating null byte or the end of file. This also
+      holds true when reading a byte vector (CBOR or MessagePack).
+
+@liveexample{The following code shows how a `parse_error` exception can be
+caught.,parse_error}
+
+@sa @ref exception for the base class of the library exceptions
+@sa @ref invalid_iterator for exceptions indicating errors with iterators
+@sa @ref type_error for exceptions indicating executing a member function with
+                    a wrong type
+@sa @ref out_of_range for exceptions indicating access out of the defined range
+@sa @ref other_error for exceptions indicating other library errors
+
+@since version 3.0.0
+*/
+class parse_error : public exception
+{
+  public:
+    /*!
+    @brief create a parse error exception
+    @param[in] id_       the id of the exception
+    @param[in] byte_     the byte index where the error occurred (or 0 if the
+                         position cannot be determined)
+    @param[in] what_arg  the explanatory string
+    @return parse_error object
+    */
+    static parse_error create(int id_, std::size_t byte_, const std::string& what_arg)
+    {
+        std::string w = exception::name("parse_error", id_) + "parse error" +
+                        (byte_ != 0 ? (" at " + std::to_string(byte_)) : "") +
+                        ": " + what_arg;
+        return parse_error(id_, byte_, w.c_str());
+    }
+
+    /*!
+    @brief byte index of the parse error
+
+    The byte index of the last read character in the input file.
+
+    @note For an input with n bytes, 1 is the index of the first character and
+          n+1 is the index of the terminating null byte or the end of file.
+          This also holds true when reading a byte vector (CBOR or MessagePack).
+    */
+    const std::size_t byte;
+
+  private:
+    parse_error(int id_, std::size_t byte_, const char* what_arg)
+        : exception(id_, what_arg), byte(byte_) {}
+};
+
+/*!
+@brief exception indicating errors with iterators
+
+This exception is thrown if iterators passed to a library function do not match
+the expected semantics.
+
+Exceptions have ids 2xx.
+
+name / id                           | example message | description
+----------------------------------- | --------------- | -------------------------
+json.exception.invalid_iterator.201 | iterators are not compatible | The iterators passed to constructor @ref basic_json(InputIT first, InputIT last) are not compatible, meaning they do not belong to the same container. Therefore, the range (@a first, @a last) is invalid.
+json.exception.invalid_iterator.202 | iterator does not fit current value | In an erase or insert function, the passed iterator @a pos does not belong to the JSON value for which the function was called. It hence does not define a valid position for the deletion/insertion.
+json.exception.invalid_iterator.203 | iterators do not fit current value | Either iterator passed to function @ref erase(IteratorType first, IteratorType last) does not belong to the JSON value from which values shall be erased. It hence does not define a valid range to delete values from.
+json.exception.invalid_iterator.204 | iterators out of range | When an iterator range for a primitive type (number, boolean, or string) is passed to a constructor or an erase function, this range has to be exactly (@ref begin(), @ref end()), because this is the only way the single stored value is expressed. All other ranges are invalid.
+json.exception.invalid_iterator.205 | iterator out of range | When an iterator for a primitive type (number, boolean, or string) is passed to an erase function, the iterator has to be the @ref begin() iterator, because it is the only way to address the stored value. All other iterators are invalid.
+json.exception.invalid_iterator.206 | cannot construct with iterators from null | The iterators passed to constructor @ref basic_json(InputIT first, InputIT last) belong to a JSON null value and hence to not define a valid range.
+json.exception.invalid_iterator.207 | cannot use key() for non-object iterators | The key() member function can only be used on iterators belonging to a JSON object, because other types do not have a concept of a key.
+json.exception.invalid_iterator.208 | cannot use operator[] for object iterators | The operator[] to specify a concrete offset cannot be used on iterators belonging to a JSON object, because JSON objects are unordered.
+json.exception.invalid_iterator.209 | cannot use offsets with object iterators | The offset operators (+, -, +=, -=) cannot be used on iterators belonging to a JSON object, because JSON objects are unordered.
+json.exception.invalid_iterator.210 | iterators do not fit | The iterator range passed to the insert function are not compatible, meaning they do not belong to the same container. Therefore, the range (@a first, @a last) is invalid.
+json.exception.invalid_iterator.211 | passed iterators may not belong to container | The iterator range passed to the insert function must not be a subrange of the container to insert to.
+json.exception.invalid_iterator.212 | cannot compare iterators of different containers | When two iterators are compared, they must belong to the same container.
+json.exception.invalid_iterator.213 | cannot compare order of object iterators | The order of object iterators cannot be compared, because JSON objects are unordered.
+json.exception.invalid_iterator.214 | cannot get value | Cannot get value for iterator: Either the iterator belongs to a null value or it is an iterator to a primitive type (number, boolean, or string), but the iterator is different to @ref begin().
+
+@liveexample{The following code shows how an `invalid_iterator` exception can be
+caught.,invalid_iterator}
+
+@sa @ref exception for the base class of the library exceptions
+@sa @ref parse_error for exceptions indicating a parse error
+@sa @ref type_error for exceptions indicating executing a member function with
+                    a wrong type
+@sa @ref out_of_range for exceptions indicating access out of the defined range
+@sa @ref other_error for exceptions indicating other library errors
+
+@since version 3.0.0
+*/
+class invalid_iterator : public exception
+{
+  public:
+    static invalid_iterator create(int id_, const std::string& what_arg)
+    {
+        std::string w = exception::name("invalid_iterator", id_) + what_arg;
+        return invalid_iterator(id_, w.c_str());
+    }
+
+  private:
+    invalid_iterator(int id_, const char* what_arg)
+        : exception(id_, what_arg) {}
+};
+
+/*!
+@brief exception indicating executing a member function with a wrong type
+
+This exception is thrown in case of a type error; that is, a library function is
+executed on a JSON value whose type does not match the expected semantics.
+
+Exceptions have ids 3xx.
+
+name / id                     | example message | description
+----------------------------- | --------------- | -------------------------
+json.exception.type_error.301 | cannot create object from initializer list | To create an object from an initializer list, the initializer list must consist only of a list of pairs whose first element is a string. When this constraint is violated, an array is created instead.
+json.exception.type_error.302 | type must be object, but is array | During implicit or explicit value conversion, the JSON type must be compatible to the target type. For instance, a JSON string can only be converted into string types, but not into numbers or boolean types.
+json.exception.type_error.303 | incompatible ReferenceType for get_ref, actual type is object | To retrieve a reference to a value stored in a @ref basic_json object with @ref get_ref, the type of the reference must match the value type. For instance, for a JSON array, the @a ReferenceType must be @ref array_t&.
+json.exception.type_error.304 | cannot use at() with string | The @ref at() member functions can only be executed for certain JSON types.
+json.exception.type_error.305 | cannot use operator[] with string | The @ref operator[] member functions can only be executed for certain JSON types.
+json.exception.type_error.306 | cannot use value() with string | The @ref value() member functions can only be executed for certain JSON types.
+json.exception.type_error.307 | cannot use erase() with string | The @ref erase() member functions can only be executed for certain JSON types.
+json.exception.type_error.308 | cannot use push_back() with string | The @ref push_back() and @ref operator+= member functions can only be executed for certain JSON types.
+json.exception.type_error.309 | cannot use insert() with | The @ref insert() member functions can only be executed for certain JSON types.
+json.exception.type_error.310 | cannot use swap() with number | The @ref swap() member functions can only be executed for certain JSON types.
+json.exception.type_error.311 | cannot use emplace_back() with string | The @ref emplace_back() member function can only be executed for certain JSON types.
+json.exception.type_error.312 | cannot use update() with string | The @ref update() member functions can only be executed for certain JSON types.
+json.exception.type_error.313 | invalid value to unflatten | The @ref unflatten function converts an object whose keys are JSON Pointers back into an arbitrary nested JSON value. The JSON Pointers must not overlap, because then the resulting value would not be well defined.
+json.exception.type_error.314 | only objects can be unflattened | The @ref unflatten function only works for an object whose keys are JSON Pointers.
+json.exception.type_error.315 | values in object must be primitive | The @ref unflatten function only works for an object whose keys are JSON Pointers and whose values are primitive.
+json.exception.type_error.316 | invalid UTF-8 byte at index 10: 0x7E | The @ref dump function only works with UTF-8 encoded strings; that is, if you assign a `std::string` to a JSON value, make sure it is UTF-8 encoded. |
+
+@liveexample{The following code shows how a `type_error` exception can be
+caught.,type_error}
+
+@sa @ref exception for the base class of the library exceptions
+@sa @ref parse_error for exceptions indicating a parse error
+@sa @ref invalid_iterator for exceptions indicating errors with iterators
+@sa @ref out_of_range for exceptions indicating access out of the defined range
+@sa @ref other_error for exceptions indicating other library errors
+
+@since version 3.0.0
+*/
+class type_error : public exception
+{
+  public:
+    static type_error create(int id_, const std::string& what_arg)
+    {
+        std::string w = exception::name("type_error", id_) + what_arg;
+        return type_error(id_, w.c_str());
+    }
+
+  private:
+    type_error(int id_, const char* what_arg) : exception(id_, what_arg) {}
+};
+
+/*!
+@brief exception indicating access out of the defined range
+
+This exception is thrown in case a library function is called on an input
+parameter that exceeds the expected range, for instance in case of array
+indices or nonexisting object keys.
+
+Exceptions have ids 4xx.
+
+name / id                       | example message | description
+------------------------------- | --------------- | -------------------------
+json.exception.out_of_range.401 | array index 3 is out of range | The provided array index @a i is larger than @a size-1.
+json.exception.out_of_range.402 | array index '-' (3) is out of range | The special array index `-` in a JSON Pointer never describes a valid element of the array, but the index past the end. That is, it can only be used to add elements at this position, but not to read it.
+json.exception.out_of_range.403 | key 'foo' not found | The provided key was not found in the JSON object.
+json.exception.out_of_range.404 | unresolved reference token 'foo' | A reference token in a JSON Pointer could not be resolved.
+json.exception.out_of_range.405 | JSON pointer has no parent | The JSON Patch operations 'remove' and 'add' can not be applied to the root element of the JSON value.
+json.exception.out_of_range.406 | number overflow parsing '10E1000' | A parsed number could not be stored as without changing it to NaN or INF.
+json.exception.out_of_range.407 | number overflow serializing '9223372036854775808' | UBJSON only supports integers numbers up to 9223372036854775807. |
+json.exception.out_of_range.408 | excessive array size: 8658170730974374167 | The size (following `#`) of an UBJSON array or object exceeds the maximal capacity. |
+
+@liveexample{The following code shows how an `out_of_range` exception can be
+caught.,out_of_range}
+
+@sa @ref exception for the base class of the library exceptions
+@sa @ref parse_error for exceptions indicating a parse error
+@sa @ref invalid_iterator for exceptions indicating errors with iterators
+@sa @ref type_error for exceptions indicating executing a member function with
+                    a wrong type
+@sa @ref other_error for exceptions indicating other library errors
+
+@since version 3.0.0
+*/
+class out_of_range : public exception
+{
+  public:
+    static out_of_range create(int id_, const std::string& what_arg)
+    {
+        std::string w = exception::name("out_of_range", id_) + what_arg;
+        return out_of_range(id_, w.c_str());
+    }
+
+  private:
+    out_of_range(int id_, const char* what_arg) : exception(id_, what_arg) {}
+};
+
+/*!
+@brief exception indicating other library errors
+
+This exception is thrown in case of errors that cannot be classified with the
+other exception types.
+
+Exceptions have ids 5xx.
+
+name / id                      | example message | description
+------------------------------ | --------------- | -------------------------
+json.exception.other_error.501 | unsuccessful: {"op":"test","path":"/baz", "value":"bar"} | A JSON Patch operation 'test' failed. The unsuccessful operation is also printed.
+
+@sa @ref exception for the base class of the library exceptions
+@sa @ref parse_error for exceptions indicating a parse error
+@sa @ref invalid_iterator for exceptions indicating errors with iterators
+@sa @ref type_error for exceptions indicating executing a member function with
+                    a wrong type
+@sa @ref out_of_range for exceptions indicating access out of the defined range
+
+@liveexample{The following code shows how an `other_error` exception can be
+caught.,other_error}
+
+@since version 3.0.0
+*/
+class other_error : public exception
+{
+  public:
+    static other_error create(int id_, const std::string& what_arg)
+    {
+        std::string w = exception::name("other_error", id_) + what_arg;
+        return other_error(id_, w.c_str());
+    }
+
+  private:
+    other_error(int id_, const char* what_arg) : exception(id_, what_arg) {}
+};
+}
+}
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+#include <array> // array
+#include <ciso646> // and
+#include <cstddef> // size_t
+#include <cstdint> // uint8_t
+
+namespace nlohmann
+{
+namespace detail
+{
+///////////////////////////
+// JSON type enumeration //
+///////////////////////////
+
+/*!
+@brief the JSON type enumeration
+
+This enumeration collects the different JSON types. It is internally used to
+distinguish the stored values, and the functions @ref basic_json::is_null(),
+@ref basic_json::is_object(), @ref basic_json::is_array(),
+@ref basic_json::is_string(), @ref basic_json::is_boolean(),
+@ref basic_json::is_number() (with @ref basic_json::is_number_integer(),
+@ref basic_json::is_number_unsigned(), and @ref basic_json::is_number_float()),
+@ref basic_json::is_discarded(), @ref basic_json::is_primitive(), and
+@ref basic_json::is_structured() rely on it.
+
+@note There are three enumeration entries (number_integer, number_unsigned, and
+number_float), because the library distinguishes these three types for numbers:
+@ref basic_json::number_unsigned_t is used for unsigned integers,
+@ref basic_json::number_integer_t is used for signed integers, and
+@ref basic_json::number_float_t is used for floating-point numbers or to
+approximate integers which do not fit in the limits of their respective type.
+
+@sa @ref basic_json::basic_json(const value_t value_type) -- create a JSON
+value with the default value for a given type
+
+@since version 1.0.0
+*/
+enum class value_t : std::uint8_t
+{
+    null,             ///< null value
+    object,           ///< object (unordered set of name/value pairs)
+    array,            ///< array (ordered collection of values)
+    string,           ///< string value
+    boolean,          ///< boolean value
+    number_integer,   ///< number value (signed integer)
+    number_unsigned,  ///< number value (unsigned integer)
+    number_float,     ///< number value (floating-point)
+    discarded         ///< discarded by the the parser callback function
+};
+
+/*!
+@brief comparison operator for JSON types
+
+Returns an ordering that is similar to Python:
+- order: null < boolean < number < object < array < string
+- furthermore, each type is not smaller than itself
+- discarded values are not comparable
+
+@since version 1.0.0
+*/
+inline bool operator<(const value_t lhs, const value_t rhs) noexcept
+{
+    static constexpr std::array<std::uint8_t, 8> order = {{
+            0 /* null */, 3 /* object */, 4 /* array */, 5 /* string */,
+            1 /* boolean */, 2 /* integer */, 2 /* unsigned */, 2 /* float */
+        }
+    };
+
+    const auto l_index = static_cast<std::size_t>(lhs);
+    const auto r_index = static_cast<std::size_t>(rhs);
+    return l_index < order.size() and r_index < order.size() and order[l_index] < order[r_index];
+}
+}
+}
+
+// #include <nlohmann/detail/conversions/from_json.hpp>
+
+
+#include <algorithm> // transform
+#include <array> // array
+#include <ciso646> // and, not
+#include <forward_list> // forward_list
+#include <iterator> // inserter, front_inserter, end
+#include <map> // map
+#include <string> // string
+#include <tuple> // tuple, make_tuple
+#include <type_traits> // is_arithmetic, is_same, is_enum, underlying_type, is_convertible
+#include <unordered_map> // unordered_map
+#include <utility> // pair, declval
+#include <valarray> // valarray
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+template<typename BasicJsonType>
+void from_json(const BasicJsonType& j, typename std::nullptr_t& n)
+{
+    if (JSON_UNLIKELY(not j.is_null()))
+    {
+        JSON_THROW(type_error::create(302, "type must be null, but is " + std::string(j.type_name())));
+    }
+    n = nullptr;
+}
+
+// overloads for basic_json template parameters
+template<typename BasicJsonType, typename ArithmeticType,
+         enable_if_t<std::is_arithmetic<ArithmeticType>::value and
+                     not std::is_same<ArithmeticType, typename BasicJsonType::boolean_t>::value,
+                     int> = 0>
+void get_arithmetic_value(const BasicJsonType& j, ArithmeticType& val)
+{
+    switch (static_cast<value_t>(j))
+    {
+        case value_t::number_unsigned:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_unsigned_t*>());
+            break;
+        }
+        case value_t::number_integer:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_integer_t*>());
+            break;
+        }
+        case value_t::number_float:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_float_t*>());
+            break;
+        }
+
+        default:
+            JSON_THROW(type_error::create(302, "type must be number, but is " + std::string(j.type_name())));
+    }
+}
+
+template<typename BasicJsonType>
+void from_json(const BasicJsonType& j, typename BasicJsonType::boolean_t& b)
+{
+    if (JSON_UNLIKELY(not j.is_boolean()))
+    {
+        JSON_THROW(type_error::create(302, "type must be boolean, but is " + std::string(j.type_name())));
+    }
+    b = *j.template get_ptr<const typename BasicJsonType::boolean_t*>();
+}
+
+template<typename BasicJsonType>
+void from_json(const BasicJsonType& j, typename BasicJsonType::string_t& s)
+{
+    if (JSON_UNLIKELY(not j.is_string()))
+    {
+        JSON_THROW(type_error::create(302, "type must be string, but is " + std::string(j.type_name())));
+    }
+    s = *j.template get_ptr<const typename BasicJsonType::string_t*>();
+}
+
+template <
+    typename BasicJsonType, typename CompatibleStringType,
+    enable_if_t <
+        is_compatible_string_type<BasicJsonType, CompatibleStringType>::value and
+        not std::is_same<typename BasicJsonType::string_t,
+                         CompatibleStringType>::value,
+        int > = 0 >
+void from_json(const BasicJsonType& j, CompatibleStringType& s)
+{
+    if (JSON_UNLIKELY(not j.is_string()))
+    {
+        JSON_THROW(type_error::create(302, "type must be string, but is " + std::string(j.type_name())));
+    }
+
+    s = *j.template get_ptr<const typename BasicJsonType::string_t*>();
+}
+
+template<typename BasicJsonType>
+void from_json(const BasicJsonType& j, typename BasicJsonType::number_float_t& val)
+{
+    get_arithmetic_value(j, val);
+}
+
+template<typename BasicJsonType>
+void from_json(const BasicJsonType& j, typename BasicJsonType::number_unsigned_t& val)
+{
+    get_arithmetic_value(j, val);
+}
+
+template<typename BasicJsonType>
+void from_json(const BasicJsonType& j, typename BasicJsonType::number_integer_t& val)
+{
+    get_arithmetic_value(j, val);
+}
+
+template<typename BasicJsonType, typename EnumType,
+         enable_if_t<std::is_enum<EnumType>::value, int> = 0>
+void from_json(const BasicJsonType& j, EnumType& e)
+{
+    typename std::underlying_type<EnumType>::type val;
+    get_arithmetic_value(j, val);
+    e = static_cast<EnumType>(val);
+}
+
+template<typename BasicJsonType>
+void from_json(const BasicJsonType& j, typename BasicJsonType::array_t& arr)
+{
+    if (JSON_UNLIKELY(not j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name())));
+    }
+    arr = *j.template get_ptr<const typename BasicJsonType::array_t*>();
+}
+
+// forward_list doesn't have an insert method
+template<typename BasicJsonType, typename T, typename Allocator,
+         enable_if_t<std::is_convertible<BasicJsonType, T>::value, int> = 0>
+void from_json(const BasicJsonType& j, std::forward_list<T, Allocator>& l)
+{
+    if (JSON_UNLIKELY(not j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name())));
+    }
+    std::transform(j.rbegin(), j.rend(),
+                   std::front_inserter(l), [](const BasicJsonType & i)
+    {
+        return i.template get<T>();
+    });
+}
+
+// valarray doesn't have an insert method
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_convertible<BasicJsonType, T>::value, int> = 0>
+void from_json(const BasicJsonType& j, std::valarray<T>& l)
+{
+    if (JSON_UNLIKELY(not j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name())));
+    }
+    l.resize(j.size());
+    std::copy(j.m_value.array->begin(), j.m_value.array->end(), std::begin(l));
+}
+
+template<typename BasicJsonType, typename CompatibleArrayType>
+void from_json_array_impl(const BasicJsonType& j, CompatibleArrayType& arr, priority_tag<0> /*unused*/)
+{
+    using std::end;
+
+    std::transform(j.begin(), j.end(),
+                   std::inserter(arr, end(arr)), [](const BasicJsonType & i)
+    {
+        // get<BasicJsonType>() returns *this, this won't call a from_json
+        // method when value_type is BasicJsonType
+        return i.template get<typename CompatibleArrayType::value_type>();
+    });
+}
+
+template<typename BasicJsonType, typename CompatibleArrayType>
+auto from_json_array_impl(const BasicJsonType& j, CompatibleArrayType& arr, priority_tag<1> /*unused*/)
+-> decltype(
+    arr.reserve(std::declval<typename CompatibleArrayType::size_type>()),
+    void())
+{
+    using std::end;
+
+    arr.reserve(j.size());
+    std::transform(j.begin(), j.end(),
+                   std::inserter(arr, end(arr)), [](const BasicJsonType & i)
+    {
+        // get<BasicJsonType>() returns *this, this won't call a from_json
+        // method when value_type is BasicJsonType
+        return i.template get<typename CompatibleArrayType::value_type>();
+    });
+}
+
+template<typename BasicJsonType, typename T, std::size_t N>
+void from_json_array_impl(const BasicJsonType& j, std::array<T, N>& arr, priority_tag<2> /*unused*/)
+{
+    for (std::size_t i = 0; i < N; ++i)
+    {
+        arr[i] = j.at(i).template get<T>();
+    }
+}
+
+template <
+    typename BasicJsonType, typename CompatibleArrayType,
+    enable_if_t <
+        is_compatible_array_type<BasicJsonType, CompatibleArrayType>::value and
+        not std::is_same<typename BasicJsonType::array_t,
+                         CompatibleArrayType>::value and
+        std::is_constructible <
+            BasicJsonType, typename CompatibleArrayType::value_type >::value,
+        int > = 0 >
+void from_json(const BasicJsonType& j, CompatibleArrayType& arr)
+{
+    if (JSON_UNLIKELY(not j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, "type must be array, but is " +
+                                      std::string(j.type_name())));
+    }
+
+    from_json_array_impl(j, arr, priority_tag<2> {});
+}
+
+template<typename BasicJsonType, typename CompatibleObjectType,
+         enable_if_t<is_compatible_object_type<BasicJsonType, CompatibleObjectType>::value, int> = 0>
+void from_json(const BasicJsonType& j, CompatibleObjectType& obj)
+{
+    if (JSON_UNLIKELY(not j.is_object()))
+    {
+        JSON_THROW(type_error::create(302, "type must be object, but is " + std::string(j.type_name())));
+    }
+
+    auto inner_object = j.template get_ptr<const typename BasicJsonType::object_t*>();
+    using value_type = typename CompatibleObjectType::value_type;
+    std::transform(
+        inner_object->begin(), inner_object->end(),
+        std::inserter(obj, obj.begin()),
+        [](typename BasicJsonType::object_t::value_type const & p)
+    {
+        return value_type(p.first, p.second.template get<typename CompatibleObjectType::mapped_type>());
+    });
+}
+
+// overload for arithmetic types, not chosen for basic_json template arguments
+// (BooleanType, etc..); note: Is it really necessary to provide explicit
+// overloads for boolean_t etc. in case of a custom BooleanType which is not
+// an arithmetic type?
+template<typename BasicJsonType, typename ArithmeticType,
+         enable_if_t <
+             std::is_arithmetic<ArithmeticType>::value and
+             not std::is_same<ArithmeticType, typename BasicJsonType::number_unsigned_t>::value and
+             not std::is_same<ArithmeticType, typename BasicJsonType::number_integer_t>::value and
+             not std::is_same<ArithmeticType, typename BasicJsonType::number_float_t>::value and
+             not std::is_same<ArithmeticType, typename BasicJsonType::boolean_t>::value,
+             int> = 0>
+void from_json(const BasicJsonType& j, ArithmeticType& val)
+{
+    switch (static_cast<value_t>(j))
+    {
+        case value_t::number_unsigned:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_unsigned_t*>());
+            break;
+        }
+        case value_t::number_integer:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_integer_t*>());
+            break;
+        }
+        case value_t::number_float:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::number_float_t*>());
+            break;
+        }
+        case value_t::boolean:
+        {
+            val = static_cast<ArithmeticType>(*j.template get_ptr<const typename BasicJsonType::boolean_t*>());
+            break;
+        }
+
+        default:
+            JSON_THROW(type_error::create(302, "type must be number, but is " + std::string(j.type_name())));
+    }
+}
+
+template<typename BasicJsonType, typename A1, typename A2>
+void from_json(const BasicJsonType& j, std::pair<A1, A2>& p)
+{
+    p = {j.at(0).template get<A1>(), j.at(1).template get<A2>()};
+}
+
+template<typename BasicJsonType, typename Tuple, std::size_t... Idx>
+void from_json_tuple_impl(const BasicJsonType& j, Tuple& t, index_sequence<Idx...>)
+{
+    t = std::make_tuple(j.at(Idx).template get<typename std::tuple_element<Idx, Tuple>::type>()...);
+}
+
+template<typename BasicJsonType, typename... Args>
+void from_json(const BasicJsonType& j, std::tuple<Args...>& t)
+{
+    from_json_tuple_impl(j, t, index_sequence_for<Args...> {});
+}
+
+template <typename BasicJsonType, typename Key, typename Value, typename Compare, typename Allocator,
+          typename = enable_if_t<not std::is_constructible<
+                                     typename BasicJsonType::string_t, Key>::value>>
+void from_json(const BasicJsonType& j, std::map<Key, Value, Compare, Allocator>& m)
+{
+    if (JSON_UNLIKELY(not j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name())));
+    }
+    for (const auto& p : j)
+    {
+        if (JSON_UNLIKELY(not p.is_array()))
+        {
+            JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(p.type_name())));
+        }
+        m.emplace(p.at(0).template get<Key>(), p.at(1).template get<Value>());
+    }
+}
+
+template <typename BasicJsonType, typename Key, typename Value, typename Hash, typename KeyEqual, typename Allocator,
+          typename = enable_if_t<not std::is_constructible<
+                                     typename BasicJsonType::string_t, Key>::value>>
+void from_json(const BasicJsonType& j, std::unordered_map<Key, Value, Hash, KeyEqual, Allocator>& m)
+{
+    if (JSON_UNLIKELY(not j.is_array()))
+    {
+        JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(j.type_name())));
+    }
+    for (const auto& p : j)
+    {
+        if (JSON_UNLIKELY(not p.is_array()))
+        {
+            JSON_THROW(type_error::create(302, "type must be array, but is " + std::string(p.type_name())));
+        }
+        m.emplace(p.at(0).template get<Key>(), p.at(1).template get<Value>());
+    }
+}
+
+struct from_json_fn
+{
+  private:
+    template<typename BasicJsonType, typename T>
+    auto call(const BasicJsonType& j, T& val, priority_tag<1> /*unused*/) const
+    noexcept(noexcept(from_json(j, val)))
+    -> decltype(from_json(j, val), void())
+    {
+        return from_json(j, val);
+    }
+
+    template<typename BasicJsonType, typename T>
+    void call(const BasicJsonType& /*unused*/, T& /*unused*/, priority_tag<0> /*unused*/) const noexcept
+    {
+        static_assert(sizeof(BasicJsonType) == 0,
+                      "could not find from_json() method in T's namespace");
+#ifdef _MSC_VER
+        // MSVC does not show a stacktrace for the above assert
+        using decayed = uncvref_t<T>;
+        static_assert(sizeof(typename decayed::force_msvc_stacktrace) == 0,
+                      "forcing MSVC stacktrace to show which T we're talking about.");
+#endif
+    }
+
+  public:
+    template<typename BasicJsonType, typename T>
+    void operator()(const BasicJsonType& j, T& val) const
+    noexcept(noexcept(std::declval<from_json_fn>().call(j, val, priority_tag<1> {})))
+    {
+        return call(j, val, priority_tag<1> {});
+    }
+};
+}
+
+/// namespace to hold default `from_json` function
+/// to see why this is required:
+/// http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4381.html
+namespace
+{
+constexpr const auto& from_json = detail::static_const<detail::from_json_fn>::value;
+}
+}
+
+// #include <nlohmann/detail/conversions/to_json.hpp>
+
+
+#include <ciso646> // or, and, not
+#include <iterator> // begin, end
+#include <tuple> // tuple, get
+#include <type_traits> // is_same, is_constructible, is_floating_point, is_enum, underlying_type
+#include <utility> // move, forward, declval, pair
+#include <valarray> // valarray
+#include <vector> // vector
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+// #include <nlohmann/detail/iterators/iteration_proxy.hpp>
+
+
+#include <cstddef> // size_t
+#include <string> // string, to_string
+#include <iterator> // input_iterator_tag
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+/// proxy class for the items() function
+template<typename IteratorType> class iteration_proxy
+{
+  private:
+    /// helper class for iteration
+    class iteration_proxy_internal
+    {
+      public:
+        using difference_type = std::ptrdiff_t;
+        using value_type = iteration_proxy_internal;
+        using pointer = iteration_proxy_internal*;
+        using reference = iteration_proxy_internal&;
+        using iterator_category = std::input_iterator_tag;
+
+      private:
+        /// the iterator
+        IteratorType anchor;
+        /// an index for arrays (used to create key names)
+        std::size_t array_index = 0;
+        /// last stringified array index
+        mutable std::size_t array_index_last = 0;
+        /// a string representation of the array index
+        mutable std::string array_index_str = "0";
+        /// an empty string (to return a reference for primitive values)
+        const std::string empty_str = "";
+
+      public:
+        explicit iteration_proxy_internal(IteratorType it) noexcept : anchor(it) {}
+
+        iteration_proxy_internal(const iteration_proxy_internal&) = default;
+        iteration_proxy_internal& operator=(const iteration_proxy_internal&) = default;
+
+        /// dereference operator (needed for range-based for)
+        iteration_proxy_internal& operator*()
+        {
+            return *this;
+        }
+
+        /// increment operator (needed for range-based for)
+        iteration_proxy_internal& operator++()
+        {
+            ++anchor;
+            ++array_index;
+
+            return *this;
+        }
+
+        /// equality operator (needed for InputIterator)
+        bool operator==(const iteration_proxy_internal& o) const noexcept
+        {
+            return anchor == o.anchor;
+        }
+
+        /// inequality operator (needed for range-based for)
+        bool operator!=(const iteration_proxy_internal& o) const noexcept
+        {
+            return anchor != o.anchor;
+        }
+
+        /// return key of the iterator
+        const std::string& key() const
+        {
+            assert(anchor.m_object != nullptr);
+
+            switch (anchor.m_object->type())
+            {
+                // use integer array index as key
+                case value_t::array:
+                {
+                    if (array_index != array_index_last)
+                    {
+                        array_index_str = std::to_string(array_index);
+                        array_index_last = array_index;
+                    }
+                    return array_index_str;
+                }
+
+                // use key from the object
+                case value_t::object:
+                    return anchor.key();
+
+                // use an empty key for all primitive types
+                default:
+                    return empty_str;
+            }
+        }
+
+        /// return value of the iterator
+        typename IteratorType::reference value() const
+        {
+            return anchor.value();
+        }
+    };
+
+    /// the container to iterate
+    typename IteratorType::reference container;
+
+  public:
+    /// construct iteration proxy from a container
+    explicit iteration_proxy(typename IteratorType::reference cont) noexcept
+        : container(cont) {}
+
+    /// return iterator begin (needed for range-based for)
+    iteration_proxy_internal begin() noexcept
+    {
+        return iteration_proxy_internal(container.begin());
+    }
+
+    /// return iterator end (needed for range-based for)
+    iteration_proxy_internal end() noexcept
+    {
+        return iteration_proxy_internal(container.end());
+    }
+};
+}
+}
+
+
+namespace nlohmann
+{
+namespace detail
+{
+//////////////////
+// constructors //
+//////////////////
+
+template<value_t> struct external_constructor;
+
+template<>
+struct external_constructor<value_t::boolean>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::boolean_t b) noexcept
+    {
+        j.m_type = value_t::boolean;
+        j.m_value = b;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::string>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::string_t& s)
+    {
+        j.m_type = value_t::string;
+        j.m_value = s;
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::string_t&& s)
+    {
+        j.m_type = value_t::string;
+        j.m_value = std::move(s);
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType, typename CompatibleStringType,
+             enable_if_t<not std::is_same<CompatibleStringType, typename BasicJsonType::string_t>::value,
+                         int> = 0>
+    static void construct(BasicJsonType& j, const CompatibleStringType& str)
+    {
+        j.m_type = value_t::string;
+        j.m_value.string = j.template create<typename BasicJsonType::string_t>(str);
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::number_float>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::number_float_t val) noexcept
+    {
+        j.m_type = value_t::number_float;
+        j.m_value = val;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::number_unsigned>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::number_unsigned_t val) noexcept
+    {
+        j.m_type = value_t::number_unsigned;
+        j.m_value = val;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::number_integer>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::number_integer_t val) noexcept
+    {
+        j.m_type = value_t::number_integer;
+        j.m_value = val;
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::array>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::array_t& arr)
+    {
+        j.m_type = value_t::array;
+        j.m_value = arr;
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::array_t&& arr)
+    {
+        j.m_type = value_t::array;
+        j.m_value = std::move(arr);
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType, typename CompatibleArrayType,
+             enable_if_t<not std::is_same<CompatibleArrayType, typename BasicJsonType::array_t>::value,
+                         int> = 0>
+    static void construct(BasicJsonType& j, const CompatibleArrayType& arr)
+    {
+        using std::begin;
+        using std::end;
+        j.m_type = value_t::array;
+        j.m_value.array = j.template create<typename BasicJsonType::array_t>(begin(arr), end(arr));
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const std::vector<bool>& arr)
+    {
+        j.m_type = value_t::array;
+        j.m_value = value_t::array;
+        j.m_value.array->reserve(arr.size());
+        for (const bool x : arr)
+        {
+            j.m_value.array->push_back(x);
+        }
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType, typename T,
+             enable_if_t<std::is_convertible<T, BasicJsonType>::value, int> = 0>
+    static void construct(BasicJsonType& j, const std::valarray<T>& arr)
+    {
+        j.m_type = value_t::array;
+        j.m_value = value_t::array;
+        j.m_value.array->resize(arr.size());
+        std::copy(std::begin(arr), std::end(arr), j.m_value.array->begin());
+        j.assert_invariant();
+    }
+};
+
+template<>
+struct external_constructor<value_t::object>
+{
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, const typename BasicJsonType::object_t& obj)
+    {
+        j.m_type = value_t::object;
+        j.m_value = obj;
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType>
+    static void construct(BasicJsonType& j, typename BasicJsonType::object_t&& obj)
+    {
+        j.m_type = value_t::object;
+        j.m_value = std::move(obj);
+        j.assert_invariant();
+    }
+
+    template<typename BasicJsonType, typename CompatibleObjectType,
+             enable_if_t<not std::is_same<CompatibleObjectType, typename BasicJsonType::object_t>::value, int> = 0>
+    static void construct(BasicJsonType& j, const CompatibleObjectType& obj)
+    {
+        using std::begin;
+        using std::end;
+
+        j.m_type = value_t::object;
+        j.m_value.object = j.template create<typename BasicJsonType::object_t>(begin(obj), end(obj));
+        j.assert_invariant();
+    }
+};
+
+/////////////
+// to_json //
+/////////////
+
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_same<T, typename BasicJsonType::boolean_t>::value, int> = 0>
+void to_json(BasicJsonType& j, T b) noexcept
+{
+    external_constructor<value_t::boolean>::construct(j, b);
+}
+
+template<typename BasicJsonType, typename CompatibleString,
+         enable_if_t<std::is_constructible<typename BasicJsonType::string_t, CompatibleString>::value, int> = 0>
+void to_json(BasicJsonType& j, const CompatibleString& s)
+{
+    external_constructor<value_t::string>::construct(j, s);
+}
+
+template<typename BasicJsonType>
+void to_json(BasicJsonType& j, typename BasicJsonType::string_t&& s)
+{
+    external_constructor<value_t::string>::construct(j, std::move(s));
+}
+
+template<typename BasicJsonType, typename FloatType,
+         enable_if_t<std::is_floating_point<FloatType>::value, int> = 0>
+void to_json(BasicJsonType& j, FloatType val) noexcept
+{
+    external_constructor<value_t::number_float>::construct(j, static_cast<typename BasicJsonType::number_float_t>(val));
+}
+
+template<typename BasicJsonType, typename CompatibleNumberUnsignedType,
+         enable_if_t<is_compatible_integer_type<typename BasicJsonType::number_unsigned_t, CompatibleNumberUnsignedType>::value, int> = 0>
+void to_json(BasicJsonType& j, CompatibleNumberUnsignedType val) noexcept
+{
+    external_constructor<value_t::number_unsigned>::construct(j, static_cast<typename BasicJsonType::number_unsigned_t>(val));
+}
+
+template<typename BasicJsonType, typename CompatibleNumberIntegerType,
+         enable_if_t<is_compatible_integer_type<typename BasicJsonType::number_integer_t, CompatibleNumberIntegerType>::value, int> = 0>
+void to_json(BasicJsonType& j, CompatibleNumberIntegerType val) noexcept
+{
+    external_constructor<value_t::number_integer>::construct(j, static_cast<typename BasicJsonType::number_integer_t>(val));
+}
+
+template<typename BasicJsonType, typename EnumType,
+         enable_if_t<std::is_enum<EnumType>::value, int> = 0>
+void to_json(BasicJsonType& j, EnumType e) noexcept
+{
+    using underlying_type = typename std::underlying_type<EnumType>::type;
+    external_constructor<value_t::number_integer>::construct(j, static_cast<underlying_type>(e));
+}
+
+template<typename BasicJsonType>
+void to_json(BasicJsonType& j, const std::vector<bool>& e)
+{
+    external_constructor<value_t::array>::construct(j, e);
+}
+
+template<typename BasicJsonType, typename CompatibleArrayType,
+         enable_if_t<is_compatible_array_type<BasicJsonType, CompatibleArrayType>::value or
+                     std::is_same<typename BasicJsonType::array_t, CompatibleArrayType>::value,
+                     int> = 0>
+void to_json(BasicJsonType& j, const CompatibleArrayType& arr)
+{
+    external_constructor<value_t::array>::construct(j, arr);
+}
+
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_convertible<T, BasicJsonType>::value, int> = 0>
+void to_json(BasicJsonType& j, const std::valarray<T>& arr)
+{
+    external_constructor<value_t::array>::construct(j, std::move(arr));
+}
+
+template<typename BasicJsonType>
+void to_json(BasicJsonType& j, typename BasicJsonType::array_t&& arr)
+{
+    external_constructor<value_t::array>::construct(j, std::move(arr));
+}
+
+template<typename BasicJsonType, typename CompatibleObjectType,
+         enable_if_t<is_compatible_object_type<BasicJsonType, CompatibleObjectType>::value, int> = 0>
+void to_json(BasicJsonType& j, const CompatibleObjectType& obj)
+{
+    external_constructor<value_t::object>::construct(j, obj);
+}
+
+template<typename BasicJsonType>
+void to_json(BasicJsonType& j, typename BasicJsonType::object_t&& obj)
+{
+    external_constructor<value_t::object>::construct(j, std::move(obj));
+}
+
+template<typename BasicJsonType, typename T, std::size_t N,
+         enable_if_t<not std::is_constructible<typename BasicJsonType::string_t, T (&)[N]>::value, int> = 0>
+void to_json(BasicJsonType& j, T (&arr)[N])
+{
+    external_constructor<value_t::array>::construct(j, arr);
+}
+
+template<typename BasicJsonType, typename... Args>
+void to_json(BasicJsonType& j, const std::pair<Args...>& p)
+{
+    j = {p.first, p.second};
+}
+
+// for https://github.com/nlohmann/json/pull/1134
+template<typename BasicJsonType, typename T,
+         enable_if_t<std::is_same<T, typename iteration_proxy<typename BasicJsonType::iterator>::iteration_proxy_internal>::value, int> = 0>
+void to_json(BasicJsonType& j, T b) noexcept
+{
+    j = {{b.key(), b.value()}};
+}
+
+template<typename BasicJsonType, typename Tuple, std::size_t... Idx>
+void to_json_tuple_impl(BasicJsonType& j, const Tuple& t, index_sequence<Idx...>)
+{
+    j = {std::get<Idx>(t)...};
+}
+
+template<typename BasicJsonType, typename... Args>
+void to_json(BasicJsonType& j, const std::tuple<Args...>& t)
+{
+    to_json_tuple_impl(j, t, index_sequence_for<Args...> {});
+}
+
+struct to_json_fn
+{
+  private:
+    template<typename BasicJsonType, typename T>
+    auto call(BasicJsonType& j, T&& val, priority_tag<1> /*unused*/) const noexcept(noexcept(to_json(j, std::forward<T>(val))))
+    -> decltype(to_json(j, std::forward<T>(val)), void())
+    {
+        return to_json(j, std::forward<T>(val));
+    }
+
+    template<typename BasicJsonType, typename T>
+    void call(BasicJsonType& /*unused*/, T&& /*unused*/, priority_tag<0> /*unused*/) const noexcept
+    {
+        static_assert(sizeof(BasicJsonType) == 0,
+                      "could not find to_json() method in T's namespace");
+
+#ifdef _MSC_VER
+        // MSVC does not show a stacktrace for the above assert
+        using decayed = uncvref_t<T>;
+        static_assert(sizeof(typename decayed::force_msvc_stacktrace) == 0,
+                      "forcing MSVC stacktrace to show which T we're talking about.");
+#endif
+    }
+
+  public:
+    template<typename BasicJsonType, typename T>
+    void operator()(BasicJsonType& j, T&& val) const
+    noexcept(noexcept(std::declval<to_json_fn>().call(j, std::forward<T>(val), priority_tag<1> {})))
+    {
+        return call(j, std::forward<T>(val), priority_tag<1> {});
+    }
+};
+}
+
+/// namespace to hold default `to_json` function
+namespace
+{
+constexpr const auto& to_json = detail::static_const<detail::to_json_fn>::value;
+}
+}
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+
+#include <cassert> // assert
+#include <cstddef> // size_t
+#include <cstring> // strlen
+#include <istream> // istream
+#include <iterator> // begin, end, iterator_traits, random_access_iterator_tag, distance, next
+#include <memory> // shared_ptr, make_shared, addressof
+#include <numeric> // accumulate
+#include <string> // string, char_traits
+#include <type_traits> // enable_if, is_base_of, is_pointer, is_integral, remove_pointer
+#include <utility> // pair, declval
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+/// the supported input formats
+enum class input_format_t { json, cbor, msgpack, ubjson };
+
+////////////////////
+// input adapters //
+////////////////////
+
+/*!
+@brief abstract input adapter interface
+
+Produces a stream of std::char_traits<char>::int_type characters from a
+std::istream, a buffer, or some other input type. Accepts the return of
+exactly one non-EOF character for future input. The int_type characters
+returned consist of all valid char values as positive values (typically
+unsigned char), plus an EOF value outside that range, specified by the value
+of the function std::char_traits<char>::eof(). This value is typically -1, but
+could be any arbitrary value which is not a valid char value.
+*/
+struct input_adapter_protocol
+{
+    /// get a character [0,255] or std::char_traits<char>::eof().
+    virtual std::char_traits<char>::int_type get_character() = 0;
+    virtual ~input_adapter_protocol() = default;
+};
+
+/// a type to simplify interfaces
+using input_adapter_t = std::shared_ptr<input_adapter_protocol>;
+
+/*!
+Input adapter for a (caching) istream. Ignores a UFT Byte Order Mark at
+beginning of input. Does not support changing the underlying std::streambuf
+in mid-input. Maintains underlying std::istream and std::streambuf to support
+subsequent use of standard std::istream operations to process any input
+characters following those used in parsing the JSON input.  Clears the
+std::istream flags; any input errors (e.g., EOF) will be detected by the first
+subsequent call for input from the std::istream.
+*/
+class input_stream_adapter : public input_adapter_protocol
+{
+  public:
+    ~input_stream_adapter() override
+    {
+        // clear stream flags; we use underlying streambuf I/O, do not
+        // maintain ifstream flags
+        is.clear();
+    }
+
+    explicit input_stream_adapter(std::istream& i)
+        : is(i), sb(*i.rdbuf())
+    {}
+
+    // delete because of pointer members
+    input_stream_adapter(const input_stream_adapter&) = delete;
+    input_stream_adapter& operator=(input_stream_adapter&) = delete;
+
+    // std::istream/std::streambuf use std::char_traits<char>::to_int_type, to
+    // ensure that std::char_traits<char>::eof() and the character 0xFF do not
+    // end up as the same value, eg. 0xFFFFFFFF.
+    std::char_traits<char>::int_type get_character() override
+    {
+        return sb.sbumpc();
+    }
+
+  private:
+    /// the associated input stream
+    std::istream& is;
+    std::streambuf& sb;
+};
+
+/// input adapter for buffer input
+class input_buffer_adapter : public input_adapter_protocol
+{
+  public:
+    input_buffer_adapter(const char* b, const std::size_t l)
+        : cursor(b), limit(b + l)
+    {}
+
+    // delete because of pointer members
+    input_buffer_adapter(const input_buffer_adapter&) = delete;
+    input_buffer_adapter& operator=(input_buffer_adapter&) = delete;
+
+    std::char_traits<char>::int_type get_character() noexcept override
+    {
+        if (JSON_LIKELY(cursor < limit))
+        {
+            return std::char_traits<char>::to_int_type(*(cursor++));
+        }
+
+        return std::char_traits<char>::eof();
+    }
+
+  private:
+    /// pointer to the current character
+    const char* cursor;
+    /// pointer past the last character
+    const char* const limit;
+};
+
+template<typename WideStringType>
+class wide_string_input_adapter : public input_adapter_protocol
+{
+  public:
+    explicit wide_string_input_adapter(const WideStringType& w) : str(w) {}
+
+    std::char_traits<char>::int_type get_character() noexcept override
+    {
+        // check if buffer needs to be filled
+        if (utf8_bytes_index == utf8_bytes_filled)
+        {
+            if (sizeof(typename WideStringType::value_type) == 2)
+            {
+                fill_buffer_utf16();
+            }
+            else
+            {
+                fill_buffer_utf32();
+            }
+
+            assert(utf8_bytes_filled > 0);
+            assert(utf8_bytes_index == 0);
+        }
+
+        // use buffer
+        assert(utf8_bytes_filled > 0);
+        assert(utf8_bytes_index < utf8_bytes_filled);
+        return utf8_bytes[utf8_bytes_index++];
+    }
+
+  private:
+    void fill_buffer_utf16()
+    {
+        utf8_bytes_index = 0;
+
+        if (current_wchar == str.size())
+        {
+            utf8_bytes[0] = std::char_traits<char>::eof();
+            utf8_bytes_filled = 1;
+        }
+        else
+        {
+            // get the current character
+            const int wc = static_cast<int>(str[current_wchar++]);
+
+            // UTF-16 to UTF-8 encoding
+            if (wc < 0x80)
+            {
+                utf8_bytes[0] = wc;
+                utf8_bytes_filled = 1;
+            }
+            else if (wc <= 0x7FF)
+            {
+                utf8_bytes[0] = 0xC0 | ((wc >> 6));
+                utf8_bytes[1] = 0x80 | (wc & 0x3F);
+                utf8_bytes_filled = 2;
+            }
+            else if (0xD800 > wc or wc >= 0xE000)
+            {
+                utf8_bytes[0] = 0xE0 | ((wc >> 12));
+                utf8_bytes[1] = 0x80 | ((wc >> 6) & 0x3F);
+                utf8_bytes[2] = 0x80 | (wc & 0x3F);
+                utf8_bytes_filled = 3;
+            }
+            else
+            {
+                if (current_wchar < str.size())
+                {
+                    const int wc2 = static_cast<int>(str[current_wchar++]);
+                    const int charcode = 0x10000 + (((wc & 0x3FF) << 10) | (wc2 & 0x3FF));
+                    utf8_bytes[0] = 0xf0 | (charcode >> 18);
+                    utf8_bytes[1] = 0x80 | ((charcode >> 12) & 0x3F);
+                    utf8_bytes[2] = 0x80 | ((charcode >> 6) & 0x3F);
+                    utf8_bytes[3] = 0x80 | (charcode & 0x3F);
+                    utf8_bytes_filled = 4;
+                }
+                else
+                {
+                    // unknown character
+                    ++current_wchar;
+                    utf8_bytes[0] = wc;
+                    utf8_bytes_filled = 1;
+                }
+            }
+        }
+    }
+
+    void fill_buffer_utf32()
+    {
+        utf8_bytes_index = 0;
+
+        if (current_wchar == str.size())
+        {
+            utf8_bytes[0] = std::char_traits<char>::eof();
+            utf8_bytes_filled = 1;
+        }
+        else
+        {
+            // get the current character
+            const int wc = static_cast<int>(str[current_wchar++]);
+
+            // UTF-32 to UTF-8 encoding
+            if (wc < 0x80)
+            {
+                utf8_bytes[0] = wc;
+                utf8_bytes_filled = 1;
+            }
+            else if (wc <= 0x7FF)
+            {
+                utf8_bytes[0] = 0xC0 | ((wc >> 6) & 0x1F);
+                utf8_bytes[1] = 0x80 | (wc & 0x3F);
+                utf8_bytes_filled = 2;
+            }
+            else if (wc <= 0xFFFF)
+            {
+                utf8_bytes[0] = 0xE0 | ((wc >> 12) & 0x0F);
+                utf8_bytes[1] = 0x80 | ((wc >> 6) & 0x3F);
+                utf8_bytes[2] = 0x80 | (wc & 0x3F);
+                utf8_bytes_filled = 3;
+            }
+            else if (wc <= 0x10FFFF)
+            {
+                utf8_bytes[0] = 0xF0 | ((wc >> 18 ) & 0x07);
+                utf8_bytes[1] = 0x80 | ((wc >> 12) & 0x3F);
+                utf8_bytes[2] = 0x80 | ((wc >> 6) & 0x3F);
+                utf8_bytes[3] = 0x80 | (wc & 0x3F);
+                utf8_bytes_filled = 4;
+            }
+            else
+            {
+                // unknown character
+                utf8_bytes[0] = wc;
+                utf8_bytes_filled = 1;
+            }
+        }
+    }
+
+  private:
+    /// the wstring to process
+    const WideStringType& str;
+
+    /// index of the current wchar in str
+    std::size_t current_wchar = 0;
+
+    /// a buffer for UTF-8 bytes
+    std::array<std::char_traits<char>::int_type, 4> utf8_bytes = {{0, 0, 0, 0}};
+
+    /// index to the utf8_codes array for the next valid byte
+    std::size_t utf8_bytes_index = 0;
+    /// number of valid bytes in the utf8_codes array
+    std::size_t utf8_bytes_filled = 0;
+};
+
+class input_adapter
+{
+  public:
+    // native support
+
+    /// input adapter for input stream
+    input_adapter(std::istream& i)
+        : ia(std::make_shared<input_stream_adapter>(i)) {}
+
+    /// input adapter for input stream
+    input_adapter(std::istream&& i)
+        : ia(std::make_shared<input_stream_adapter>(i)) {}
+
+    input_adapter(const std::wstring& ws)
+        : ia(std::make_shared<wide_string_input_adapter<std::wstring>>(ws)) {}
+
+    input_adapter(const std::u16string& ws)
+        : ia(std::make_shared<wide_string_input_adapter<std::u16string>>(ws)) {}
+
+    input_adapter(const std::u32string& ws)
+        : ia(std::make_shared<wide_string_input_adapter<std::u32string>>(ws)) {}
+
+    /// input adapter for buffer
+    template<typename CharT,
+             typename std::enable_if<
+                 std::is_pointer<CharT>::value and
+                 std::is_integral<typename std::remove_pointer<CharT>::type>::value and
+                 sizeof(typename std::remove_pointer<CharT>::type) == 1,
+                 int>::type = 0>
+    input_adapter(CharT b, std::size_t l)
+        : ia(std::make_shared<input_buffer_adapter>(reinterpret_cast<const char*>(b), l)) {}
+
+    // derived support
+
+    /// input adapter for string literal
+    template<typename CharT,
+             typename std::enable_if<
+                 std::is_pointer<CharT>::value and
+                 std::is_integral<typename std::remove_pointer<CharT>::type>::value and
+                 sizeof(typename std::remove_pointer<CharT>::type) == 1,
+                 int>::type = 0>
+    input_adapter(CharT b)
+        : input_adapter(reinterpret_cast<const char*>(b),
+                        std::strlen(reinterpret_cast<const char*>(b))) {}
+
+    /// input adapter for iterator range with contiguous storage
+    template<class IteratorType,
+             typename std::enable_if<
+                 std::is_same<typename std::iterator_traits<IteratorType>::iterator_category, std::random_access_iterator_tag>::value,
+                 int>::type = 0>
+    input_adapter(IteratorType first, IteratorType last)
+    {
+        // assertion to check that the iterator range is indeed contiguous,
+        // see http://stackoverflow.com/a/35008842/266378 for more discussion
+        assert(std::accumulate(
+                   first, last, std::pair<bool, int>(true, 0),
+                   [&first](std::pair<bool, int> res, decltype(*first) val)
+        {
+            res.first &= (val == *(std::next(std::addressof(*first), res.second++)));
+            return res;
+        }).first);
+
+        // assertion to check that each element is 1 byte long
+        static_assert(
+            sizeof(typename std::iterator_traits<IteratorType>::value_type) == 1,
+            "each element in the iterator range must have the size of 1 byte");
+
+        const auto len = static_cast<size_t>(std::distance(first, last));
+        if (JSON_LIKELY(len > 0))
+        {
+            // there is at least one element: use the address of first
+            ia = std::make_shared<input_buffer_adapter>(reinterpret_cast<const char*>(&(*first)), len);
+        }
+        else
+        {
+            // the address of first cannot be used: use nullptr
+            ia = std::make_shared<input_buffer_adapter>(nullptr, len);
+        }
+    }
+
+    /// input adapter for array
+    template<class T, std::size_t N>
+    input_adapter(T (&array)[N])
+        : input_adapter(std::begin(array), std::end(array)) {}
+
+    /// input adapter for contiguous container
+    template<class ContiguousContainer, typename
+             std::enable_if<not std::is_pointer<ContiguousContainer>::value and
+                            std::is_base_of<std::random_access_iterator_tag, typename std::iterator_traits<decltype(std::begin(std::declval<ContiguousContainer const>()))>::iterator_category>::value,
+                            int>::type = 0>
+    input_adapter(const ContiguousContainer& c)
+        : input_adapter(std::begin(c), std::end(c)) {}
+
+    operator input_adapter_t()
+    {
+        return ia;
+    }
+
+  private:
+    /// the actual adapter
+    input_adapter_t ia = nullptr;
+};
+}
+}
+
+// #include <nlohmann/detail/input/lexer.hpp>
+
+
+#include <clocale> // localeconv
+#include <cstddef> // size_t
+#include <cstdlib> // strtof, strtod, strtold, strtoll, strtoull
+#include <cstdio> // snprintf
+#include <initializer_list> // initializer_list
+#include <string> // char_traits, string
+#include <vector> // vector
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+///////////
+// lexer //
+///////////
+
+/*!
+@brief lexical analysis
+
+This class organizes the lexical analysis during JSON deserialization.
+*/
+template<typename BasicJsonType>
+class lexer
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+
+  public:
+    /// token types for the parser
+    enum class token_type
+    {
+        uninitialized,    ///< indicating the scanner is uninitialized
+        literal_true,     ///< the `true` literal
+        literal_false,    ///< the `false` literal
+        literal_null,     ///< the `null` literal
+        value_string,     ///< a string -- use get_string() for actual value
+        value_unsigned,   ///< an unsigned integer -- use get_number_unsigned() for actual value
+        value_integer,    ///< a signed integer -- use get_number_integer() for actual value
+        value_float,      ///< an floating point number -- use get_number_float() for actual value
+        begin_array,      ///< the character for array begin `[`
+        begin_object,     ///< the character for object begin `{`
+        end_array,        ///< the character for array end `]`
+        end_object,       ///< the character for object end `}`
+        name_separator,   ///< the name separator `:`
+        value_separator,  ///< the value separator `,`
+        parse_error,      ///< indicating a parse error
+        end_of_input,     ///< indicating the end of the input buffer
+        literal_or_value  ///< a literal or the begin of a value (only for diagnostics)
+    };
+
+    /// return name of values of type token_type (only used for errors)
+    static const char* token_type_name(const token_type t) noexcept
+    {
+        switch (t)
+        {
+            case token_type::uninitialized:
+                return "<uninitialized>";
+            case token_type::literal_true:
+                return "true literal";
+            case token_type::literal_false:
+                return "false literal";
+            case token_type::literal_null:
+                return "null literal";
+            case token_type::value_string:
+                return "string literal";
+            case lexer::token_type::value_unsigned:
+            case lexer::token_type::value_integer:
+            case lexer::token_type::value_float:
+                return "number literal";
+            case token_type::begin_array:
+                return "'['";
+            case token_type::begin_object:
+                return "'{'";
+            case token_type::end_array:
+                return "']'";
+            case token_type::end_object:
+                return "'}'";
+            case token_type::name_separator:
+                return "':'";
+            case token_type::value_separator:
+                return "','";
+            case token_type::parse_error:
+                return "<parse error>";
+            case token_type::end_of_input:
+                return "end of input";
+            case token_type::literal_or_value:
+                return "'[', '{', or a literal";
+            // LCOV_EXCL_START
+            default: // catch non-enum values
+                return "unknown token";
+                // LCOV_EXCL_STOP
+        }
+    }
+
+    explicit lexer(detail::input_adapter_t&& adapter)
+        : ia(std::move(adapter)), decimal_point_char(get_decimal_point()) {}
+
+    // delete because of pointer members
+    lexer(const lexer&) = delete;
+    lexer& operator=(lexer&) = delete;
+
+  private:
+    /////////////////////
+    // locales
+    /////////////////////
+
+    /// return the locale-dependent decimal point
+    static char get_decimal_point() noexcept
+    {
+        const auto loc = localeconv();
+        assert(loc != nullptr);
+        return (loc->decimal_point == nullptr) ? '.' : *(loc->decimal_point);
+    }
+
+    /////////////////////
+    // scan functions
+    /////////////////////
+
+    /*!
+    @brief get codepoint from 4 hex characters following `\u`
+
+    For input "\u c1 c2 c3 c4" the codepoint is:
+      (c1 * 0x1000) + (c2 * 0x0100) + (c3 * 0x0010) + c4
+    = (c1 << 12) + (c2 << 8) + (c3 << 4) + (c4 << 0)
+
+    Furthermore, the possible characters '0'..'9', 'A'..'F', and 'a'..'f'
+    must be converted to the integers 0x0..0x9, 0xA..0xF, 0xA..0xF, resp. The
+    conversion is done by subtracting the offset (0x30, 0x37, and 0x57)
+    between the ASCII value of the character and the desired integer value.
+
+    @return codepoint (0x0000..0xFFFF) or -1 in case of an error (e.g. EOF or
+            non-hex character)
+    */
+    int get_codepoint()
+    {
+        // this function only makes sense after reading `\u`
+        assert(current == 'u');
+        int codepoint = 0;
+
+        const auto factors = { 12, 8, 4, 0 };
+        for (const auto factor : factors)
+        {
+            get();
+
+            if (current >= '0' and current <= '9')
+            {
+                codepoint += ((current - 0x30) << factor);
+            }
+            else if (current >= 'A' and current <= 'F')
+            {
+                codepoint += ((current - 0x37) << factor);
+            }
+            else if (current >= 'a' and current <= 'f')
+            {
+                codepoint += ((current - 0x57) << factor);
+            }
+            else
+            {
+                return -1;
+            }
+        }
+
+        assert(0x0000 <= codepoint and codepoint <= 0xFFFF);
+        return codepoint;
+    }
+
+    /*!
+    @brief check if the next byte(s) are inside a given range
+
+    Adds the current byte and, for each passed range, reads a new byte and
+    checks if it is inside the range. If a violation was detected, set up an
+    error message and return false. Otherwise, return true.
+
+    @param[in] ranges  list of integers; interpreted as list of pairs of
+                       inclusive lower and upper bound, respectively
+
+    @pre The passed list @a ranges must have 2, 4, or 6 elements; that is,
+         1, 2, or 3 pairs. This precondition is enforced by an assertion.
+
+    @return true if and only if no range violation was detected
+    */
+    bool next_byte_in_range(std::initializer_list<int> ranges)
+    {
+        assert(ranges.size() == 2 or ranges.size() == 4 or ranges.size() == 6);
+        add(current);
+
+        for (auto range = ranges.begin(); range != ranges.end(); ++range)
+        {
+            get();
+            if (JSON_LIKELY(*range <= current and current <= *(++range)))
+            {
+                add(current);
+            }
+            else
+            {
+                error_message = "invalid string: ill-formed UTF-8 byte";
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    /*!
+    @brief scan a string literal
+
+    This function scans a string according to Sect. 7 of RFC 7159. While
+    scanning, bytes are escaped and copied into buffer token_buffer. Then the
+    function returns successfully, token_buffer is *not* null-terminated (as it
+    may contain \0 bytes), and token_buffer.size() is the number of bytes in the
+    string.
+
+    @return token_type::value_string if string could be successfully scanned,
+            token_type::parse_error otherwise
+
+    @note In case of errors, variable error_message contains a textual
+          description.
+    */
+    token_type scan_string()
+    {
+        // reset token_buffer (ignore opening quote)
+        reset();
+
+        // we entered the function by reading an open quote
+        assert(current == '\"');
+
+        while (true)
+        {
+            // get next character
+            switch (get())
+            {
+                // end of file while parsing string
+                case std::char_traits<char>::eof():
+                {
+                    error_message = "invalid string: missing closing quote";
+                    return token_type::parse_error;
+                }
+
+                // closing quote
+                case '\"':
+                {
+                    return token_type::value_string;
+                }
+
+                // escapes
+                case '\\':
+                {
+                    switch (get())
+                    {
+                        // quotation mark
+                        case '\"':
+                            add('\"');
+                            break;
+                        // reverse solidus
+                        case '\\':
+                            add('\\');
+                            break;
+                        // solidus
+                        case '/':
+                            add('/');
+                            break;
+                        // backspace
+                        case 'b':
+                            add('\b');
+                            break;
+                        // form feed
+                        case 'f':
+                            add('\f');
+                            break;
+                        // line feed
+                        case 'n':
+                            add('\n');
+                            break;
+                        // carriage return
+                        case 'r':
+                            add('\r');
+                            break;
+                        // tab
+                        case 't':
+                            add('\t');
+                            break;
+
+                        // unicode escapes
+                        case 'u':
+                        {
+                            const int codepoint1 = get_codepoint();
+                            int codepoint = codepoint1; // start with codepoint1
+
+                            if (JSON_UNLIKELY(codepoint1 == -1))
+                            {
+                                error_message = "invalid string: '\\u' must be followed by 4 hex digits";
+                                return token_type::parse_error;
+                            }
+
+                            // check if code point is a high surrogate
+                            if (0xD800 <= codepoint1 and codepoint1 <= 0xDBFF)
+                            {
+                                // expect next \uxxxx entry
+                                if (JSON_LIKELY(get() == '\\' and get() == 'u'))
+                                {
+                                    const int codepoint2 = get_codepoint();
+
+                                    if (JSON_UNLIKELY(codepoint2 == -1))
+                                    {
+                                        error_message = "invalid string: '\\u' must be followed by 4 hex digits";
+                                        return token_type::parse_error;
+                                    }
+
+                                    // check if codepoint2 is a low surrogate
+                                    if (JSON_LIKELY(0xDC00 <= codepoint2 and codepoint2 <= 0xDFFF))
+                                    {
+                                        // overwrite codepoint
+                                        codepoint =
+                                            // high surrogate occupies the most significant 22 bits
+                                            (codepoint1 << 10)
+                                            // low surrogate occupies the least significant 15 bits
+                                            + codepoint2
+                                            // there is still the 0xD800, 0xDC00 and 0x10000 noise
+                                            // in the result so we have to subtract with:
+                                            // (0xD800 << 10) + DC00 - 0x10000 = 0x35FDC00
+                                            - 0x35FDC00;
+                                    }
+                                    else
+                                    {
+                                        error_message = "invalid string: surrogate U+DC00..U+DFFF must be followed by U+DC00..U+DFFF";
+                                        return token_type::parse_error;
+                                    }
+                                }
+                                else
+                                {
+                                    error_message = "invalid string: surrogate U+DC00..U+DFFF must be followed by U+DC00..U+DFFF";
+                                    return token_type::parse_error;
+                                }
+                            }
+                            else
+                            {
+                                if (JSON_UNLIKELY(0xDC00 <= codepoint1 and codepoint1 <= 0xDFFF))
+                                {
+                                    error_message = "invalid string: surrogate U+DC00..U+DFFF must follow U+D800..U+DBFF";
+                                    return token_type::parse_error;
+                                }
+                            }
+
+                            // result of the above calculation yields a proper codepoint
+                            assert(0x00 <= codepoint and codepoint <= 0x10FFFF);
+
+                            // translate codepoint into bytes
+                            if (codepoint < 0x80)
+                            {
+                                // 1-byte characters: 0xxxxxxx (ASCII)
+                                add(codepoint);
+                            }
+                            else if (codepoint <= 0x7FF)
+                            {
+                                // 2-byte characters: 110xxxxx 10xxxxxx
+                                add(0xC0 | (codepoint >> 6));
+                                add(0x80 | (codepoint & 0x3F));
+                            }
+                            else if (codepoint <= 0xFFFF)
+                            {
+                                // 3-byte characters: 1110xxxx 10xxxxxx 10xxxxxx
+                                add(0xE0 | (codepoint >> 12));
+                                add(0x80 | ((codepoint >> 6) & 0x3F));
+                                add(0x80 | (codepoint & 0x3F));
+                            }
+                            else
+                            {
+                                // 4-byte characters: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
+                                add(0xF0 | (codepoint >> 18));
+                                add(0x80 | ((codepoint >> 12) & 0x3F));
+                                add(0x80 | ((codepoint >> 6) & 0x3F));
+                                add(0x80 | (codepoint & 0x3F));
+                            }
+
+                            break;
+                        }
+
+                        // other characters after escape
+                        default:
+                            error_message = "invalid string: forbidden character after backslash";
+                            return token_type::parse_error;
+                    }
+
+                    break;
+                }
+
+                // invalid control characters
+                case 0x00:
+                case 0x01:
+                case 0x02:
+                case 0x03:
+                case 0x04:
+                case 0x05:
+                case 0x06:
+                case 0x07:
+                case 0x08:
+                case 0x09:
+                case 0x0A:
+                case 0x0B:
+                case 0x0C:
+                case 0x0D:
+                case 0x0E:
+                case 0x0F:
+                case 0x10:
+                case 0x11:
+                case 0x12:
+                case 0x13:
+                case 0x14:
+                case 0x15:
+                case 0x16:
+                case 0x17:
+                case 0x18:
+                case 0x19:
+                case 0x1A:
+                case 0x1B:
+                case 0x1C:
+                case 0x1D:
+                case 0x1E:
+                case 0x1F:
+                {
+                    error_message = "invalid string: control character must be escaped";
+                    return token_type::parse_error;
+                }
+
+                // U+0020..U+007F (except U+0022 (quote) and U+005C (backspace))
+                case 0x20:
+                case 0x21:
+                case 0x23:
+                case 0x24:
+                case 0x25:
+                case 0x26:
+                case 0x27:
+                case 0x28:
+                case 0x29:
+                case 0x2A:
+                case 0x2B:
+                case 0x2C:
+                case 0x2D:
+                case 0x2E:
+                case 0x2F:
+                case 0x30:
+                case 0x31:
+                case 0x32:
+                case 0x33:
+                case 0x34:
+                case 0x35:
+                case 0x36:
+                case 0x37:
+                case 0x38:
+                case 0x39:
+                case 0x3A:
+                case 0x3B:
+                case 0x3C:
+                case 0x3D:
+                case 0x3E:
+                case 0x3F:
+                case 0x40:
+                case 0x41:
+                case 0x42:
+                case 0x43:
+                case 0x44:
+                case 0x45:
+                case 0x46:
+                case 0x47:
+                case 0x48:
+                case 0x49:
+                case 0x4A:
+                case 0x4B:
+                case 0x4C:
+                case 0x4D:
+                case 0x4E:
+                case 0x4F:
+                case 0x50:
+                case 0x51:
+                case 0x52:
+                case 0x53:
+                case 0x54:
+                case 0x55:
+                case 0x56:
+                case 0x57:
+                case 0x58:
+                case 0x59:
+                case 0x5A:
+                case 0x5B:
+                case 0x5D:
+                case 0x5E:
+                case 0x5F:
+                case 0x60:
+                case 0x61:
+                case 0x62:
+                case 0x63:
+                case 0x64:
+                case 0x65:
+                case 0x66:
+                case 0x67:
+                case 0x68:
+                case 0x69:
+                case 0x6A:
+                case 0x6B:
+                case 0x6C:
+                case 0x6D:
+                case 0x6E:
+                case 0x6F:
+                case 0x70:
+                case 0x71:
+                case 0x72:
+                case 0x73:
+                case 0x74:
+                case 0x75:
+                case 0x76:
+                case 0x77:
+                case 0x78:
+                case 0x79:
+                case 0x7A:
+                case 0x7B:
+                case 0x7C:
+                case 0x7D:
+                case 0x7E:
+                case 0x7F:
+                {
+                    add(current);
+                    break;
+                }
+
+                // U+0080..U+07FF: bytes C2..DF 80..BF
+                case 0xC2:
+                case 0xC3:
+                case 0xC4:
+                case 0xC5:
+                case 0xC6:
+                case 0xC7:
+                case 0xC8:
+                case 0xC9:
+                case 0xCA:
+                case 0xCB:
+                case 0xCC:
+                case 0xCD:
+                case 0xCE:
+                case 0xCF:
+                case 0xD0:
+                case 0xD1:
+                case 0xD2:
+                case 0xD3:
+                case 0xD4:
+                case 0xD5:
+                case 0xD6:
+                case 0xD7:
+                case 0xD8:
+                case 0xD9:
+                case 0xDA:
+                case 0xDB:
+                case 0xDC:
+                case 0xDD:
+                case 0xDE:
+                case 0xDF:
+                {
+                    if (JSON_UNLIKELY(not next_byte_in_range({0x80, 0xBF})))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+0800..U+0FFF: bytes E0 A0..BF 80..BF
+                case 0xE0:
+                {
+                    if (JSON_UNLIKELY(not (next_byte_in_range({0xA0, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+1000..U+CFFF: bytes E1..EC 80..BF 80..BF
+                // U+E000..U+FFFF: bytes EE..EF 80..BF 80..BF
+                case 0xE1:
+                case 0xE2:
+                case 0xE3:
+                case 0xE4:
+                case 0xE5:
+                case 0xE6:
+                case 0xE7:
+                case 0xE8:
+                case 0xE9:
+                case 0xEA:
+                case 0xEB:
+                case 0xEC:
+                case 0xEE:
+                case 0xEF:
+                {
+                    if (JSON_UNLIKELY(not (next_byte_in_range({0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+D000..U+D7FF: bytes ED 80..9F 80..BF
+                case 0xED:
+                {
+                    if (JSON_UNLIKELY(not (next_byte_in_range({0x80, 0x9F, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+10000..U+3FFFF F0 90..BF 80..BF 80..BF
+                case 0xF0:
+                {
+                    if (JSON_UNLIKELY(not (next_byte_in_range({0x90, 0xBF, 0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+40000..U+FFFFF F1..F3 80..BF 80..BF 80..BF
+                case 0xF1:
+                case 0xF2:
+                case 0xF3:
+                {
+                    if (JSON_UNLIKELY(not (next_byte_in_range({0x80, 0xBF, 0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // U+100000..U+10FFFF F4 80..8F 80..BF 80..BF
+                case 0xF4:
+                {
+                    if (JSON_UNLIKELY(not (next_byte_in_range({0x80, 0x8F, 0x80, 0xBF, 0x80, 0xBF}))))
+                    {
+                        return token_type::parse_error;
+                    }
+                    break;
+                }
+
+                // remaining bytes (80..C1 and F5..FF) are ill-formed
+                default:
+                {
+                    error_message = "invalid string: ill-formed UTF-8 byte";
+                    return token_type::parse_error;
+                }
+            }
+        }
+    }
+
+    static void strtof(float& f, const char* str, char** endptr) noexcept
+    {
+        f = std::strtof(str, endptr);
+    }
+
+    static void strtof(double& f, const char* str, char** endptr) noexcept
+    {
+        f = std::strtod(str, endptr);
+    }
+
+    static void strtof(long double& f, const char* str, char** endptr) noexcept
+    {
+        f = std::strtold(str, endptr);
+    }
+
+    /*!
+    @brief scan a number literal
+
+    This function scans a string according to Sect. 6 of RFC 7159.
+
+    The function is realized with a deterministic finite state machine derived
+    from the grammar described in RFC 7159. Starting in state "init", the
+    input is read and used to determined the next state. Only state "done"
+    accepts the number. State "error" is a trap state to model errors. In the
+    table below, "anything" means any character but the ones listed before.
+
+    state    | 0        | 1-9      | e E      | +       | -       | .        | anything
+    ---------|----------|----------|----------|---------|---------|----------|-----------
+    init     | zero     | any1     | [error]  | [error] | minus   | [error]  | [error]
+    minus    | zero     | any1     | [error]  | [error] | [error] | [error]  | [error]
+    zero     | done     | done     | exponent | done    | done    | decimal1 | done
+    any1     | any1     | any1     | exponent | done    | done    | decimal1 | done
+    decimal1 | decimal2 | [error]  | [error]  | [error] | [error] | [error]  | [error]
+    decimal2 | decimal2 | decimal2 | exponent | done    | done    | done     | done
+    exponent | any2     | any2     | [error]  | sign    | sign    | [error]  | [error]
+    sign     | any2     | any2     | [error]  | [error] | [error] | [error]  | [error]
+    any2     | any2     | any2     | done     | done    | done    | done     | done
+
+    The state machine is realized with one label per state (prefixed with
+    "scan_number_") and `goto` statements between them. The state machine
+    contains cycles, but any cycle can be left when EOF is read. Therefore,
+    the function is guaranteed to terminate.
+
+    During scanning, the read bytes are stored in token_buffer. This string is
+    then converted to a signed integer, an unsigned integer, or a
+    floating-point number.
+
+    @return token_type::value_unsigned, token_type::value_integer, or
+            token_type::value_float if number could be successfully scanned,
+            token_type::parse_error otherwise
+
+    @note The scanner is independent of the current locale. Internally, the
+          locale's decimal point is used instead of `.` to work with the
+          locale-dependent converters.
+    */
+    token_type scan_number()
+    {
+        // reset token_buffer to store the number's bytes
+        reset();
+
+        // the type of the parsed number; initially set to unsigned; will be
+        // changed if minus sign, decimal point or exponent is read
+        token_type number_type = token_type::value_unsigned;
+
+        // state (init): we just found out we need to scan a number
+        switch (current)
+        {
+            case '-':
+            {
+                add(current);
+                goto scan_number_minus;
+            }
+
+            case '0':
+            {
+                add(current);
+                goto scan_number_zero;
+            }
+
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any1;
+            }
+
+            // LCOV_EXCL_START
+            default:
+            {
+                // all other characters are rejected outside scan_number()
+                assert(false);
+            }
+                // LCOV_EXCL_STOP
+        }
+
+scan_number_minus:
+        // state: we just parsed a leading minus sign
+        number_type = token_type::value_integer;
+        switch (get())
+        {
+            case '0':
+            {
+                add(current);
+                goto scan_number_zero;
+            }
+
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any1;
+            }
+
+            default:
+            {
+                error_message = "invalid number; expected digit after '-'";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_zero:
+        // state: we just parse a zero (maybe with a leading minus sign)
+        switch (get())
+        {
+            case '.':
+            {
+                add(decimal_point_char);
+                goto scan_number_decimal1;
+            }
+
+            case 'e':
+            case 'E':
+            {
+                add(current);
+                goto scan_number_exponent;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_any1:
+        // state: we just parsed a number 0-9 (maybe with a leading minus sign)
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any1;
+            }
+
+            case '.':
+            {
+                add(decimal_point_char);
+                goto scan_number_decimal1;
+            }
+
+            case 'e':
+            case 'E':
+            {
+                add(current);
+                goto scan_number_exponent;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_decimal1:
+        // state: we just parsed a decimal point
+        number_type = token_type::value_float;
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_decimal2;
+            }
+
+            default:
+            {
+                error_message = "invalid number; expected digit after '.'";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_decimal2:
+        // we just parsed at least one number after a decimal point
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_decimal2;
+            }
+
+            case 'e':
+            case 'E':
+            {
+                add(current);
+                goto scan_number_exponent;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_exponent:
+        // we just parsed an exponent
+        number_type = token_type::value_float;
+        switch (get())
+        {
+            case '+':
+            case '-':
+            {
+                add(current);
+                goto scan_number_sign;
+            }
+
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any2;
+            }
+
+            default:
+            {
+                error_message =
+                    "invalid number; expected '+', '-', or digit after exponent";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_sign:
+        // we just parsed an exponent sign
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any2;
+            }
+
+            default:
+            {
+                error_message = "invalid number; expected digit after exponent sign";
+                return token_type::parse_error;
+            }
+        }
+
+scan_number_any2:
+        // we just parsed a number after the exponent or exponent sign
+        switch (get())
+        {
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+            {
+                add(current);
+                goto scan_number_any2;
+            }
+
+            default:
+                goto scan_number_done;
+        }
+
+scan_number_done:
+        // unget the character after the number (we only read it to know that
+        // we are done scanning a number)
+        unget();
+
+        char* endptr = nullptr;
+        errno = 0;
+
+        // try to parse integers first and fall back to floats
+        if (number_type == token_type::value_unsigned)
+        {
+            const auto x = std::strtoull(token_buffer.data(), &endptr, 10);
+
+            // we checked the number format before
+            assert(endptr == token_buffer.data() + token_buffer.size());
+
+            if (errno == 0)
+            {
+                value_unsigned = static_cast<number_unsigned_t>(x);
+                if (value_unsigned == x)
+                {
+                    return token_type::value_unsigned;
+                }
+            }
+        }
+        else if (number_type == token_type::value_integer)
+        {
+            const auto x = std::strtoll(token_buffer.data(), &endptr, 10);
+
+            // we checked the number format before
+            assert(endptr == token_buffer.data() + token_buffer.size());
+
+            if (errno == 0)
+            {
+                value_integer = static_cast<number_integer_t>(x);
+                if (value_integer == x)
+                {
+                    return token_type::value_integer;
+                }
+            }
+        }
+
+        // this code is reached if we parse a floating-point number or if an
+        // integer conversion above failed
+        strtof(value_float, token_buffer.data(), &endptr);
+
+        // we checked the number format before
+        assert(endptr == token_buffer.data() + token_buffer.size());
+
+        return token_type::value_float;
+    }
+
+    /*!
+    @param[in] literal_text  the literal text to expect
+    @param[in] length        the length of the passed literal text
+    @param[in] return_type   the token type to return on success
+    */
+    token_type scan_literal(const char* literal_text, const std::size_t length,
+                            token_type return_type)
+    {
+        assert(current == literal_text[0]);
+        for (std::size_t i = 1; i < length; ++i)
+        {
+            if (JSON_UNLIKELY(get() != literal_text[i]))
+            {
+                error_message = "invalid literal";
+                return token_type::parse_error;
+            }
+        }
+        return return_type;
+    }
+
+    /////////////////////
+    // input management
+    /////////////////////
+
+    /// reset token_buffer; current character is beginning of token
+    void reset() noexcept
+    {
+        token_buffer.clear();
+        token_string.clear();
+        token_string.push_back(std::char_traits<char>::to_char_type(current));
+    }
+
+    /*
+    @brief get next character from the input
+
+    This function provides the interface to the used input adapter. It does
+    not throw in case the input reached EOF, but returns a
+    `std::char_traits<char>::eof()` in that case.  Stores the scanned characters
+    for use in error messages.
+
+    @return character read from the input
+    */
+    std::char_traits<char>::int_type get()
+    {
+        ++chars_read;
+        if (next_unget)
+        {
+            // just reset the next_unget variable and work with current
+            next_unget = false;
+        }
+        else
+        {
+            current = ia->get_character();
+        }
+
+        if (JSON_LIKELY(current != std::char_traits<char>::eof()))
+        {
+            token_string.push_back(std::char_traits<char>::to_char_type(current));
+        }
+        return current;
+    }
+
+    /*!
+    @brief unget current character (read it again on next get)
+
+    We implement unget by setting variable next_unget to true. The input is not
+    changed - we just simulate ungetting by modifying chars_read and
+    token_string. The next call to get() will behave as if the unget character
+    is read again.
+    */
+    void unget()
+    {
+        next_unget = true;
+        --chars_read;
+        if (JSON_LIKELY(current != std::char_traits<char>::eof()))
+        {
+            assert(token_string.size() != 0);
+            token_string.pop_back();
+        }
+    }
+
+    /// add a character to token_buffer
+    void add(int c)
+    {
+        token_buffer.push_back(std::char_traits<char>::to_char_type(c));
+    }
+
+  public:
+    /////////////////////
+    // value getters
+    /////////////////////
+
+    /// return integer value
+    constexpr number_integer_t get_number_integer() const noexcept
+    {
+        return value_integer;
+    }
+
+    /// return unsigned integer value
+    constexpr number_unsigned_t get_number_unsigned() const noexcept
+    {
+        return value_unsigned;
+    }
+
+    /// return floating-point value
+    constexpr number_float_t get_number_float() const noexcept
+    {
+        return value_float;
+    }
+
+    /// return current string value (implicitly resets the token; useful only once)
+    string_t& get_string()
+    {
+        return token_buffer;
+    }
+
+    /////////////////////
+    // diagnostics
+    /////////////////////
+
+    /// return position of last read token
+    constexpr std::size_t get_position() const noexcept
+    {
+        return chars_read;
+    }
+
+    /// return the last read token (for errors only).  Will never contain EOF
+    /// (an arbitrary value that is not a valid char value, often -1), because
+    /// 255 may legitimately occur.  May contain NUL, which should be escaped.
+    std::string get_token_string() const
+    {
+        // escape control characters
+        std::string result;
+        for (const auto c : token_string)
+        {
+            if ('\x00' <= c and c <= '\x1F')
+            {
+                // escape control characters
+                char cs[9];
+                snprintf(cs, 9, "<U+%.4X>", static_cast<unsigned char>(c));
+                result += cs;
+            }
+            else
+            {
+                // add character as is
+                result.push_back(c);
+            }
+        }
+
+        return result;
+    }
+
+    /// return syntax error message
+    constexpr const char* get_error_message() const noexcept
+    {
+        return error_message;
+    }
+
+    /////////////////////
+    // actual scanner
+    /////////////////////
+
+    /*!
+    @brief skip the UTF-8 byte order mark
+    @return true iff there is no BOM or the correct BOM has been skipped
+    */
+    bool skip_bom()
+    {
+        if (get() == 0xEF)
+        {
+            if (get() == 0xBB and get() == 0xBF)
+            {
+                // we completely parsed the BOM
+                return true;
+            }
+            else
+            {
+                // after reading 0xEF, an unexpected character followed
+                return false;
+            }
+        }
+        else
+        {
+            // the first character is not the beginning of the BOM; unget it to
+            // process is later
+            unget();
+            return true;
+        }
+    }
+
+    token_type scan()
+    {
+        // initially, skip the BOM
+        if (chars_read == 0 and not skip_bom())
+        {
+            error_message = "invalid BOM; must be 0xEF 0xBB 0xBF if given";
+            return token_type::parse_error;
+        }
+
+        // read next character and ignore whitespace
+        do
+        {
+            get();
+        }
+        while (current == ' ' or current == '\t' or current == '\n' or current == '\r');
+
+        switch (current)
+        {
+            // structural characters
+            case '[':
+                return token_type::begin_array;
+            case ']':
+                return token_type::end_array;
+            case '{':
+                return token_type::begin_object;
+            case '}':
+                return token_type::end_object;
+            case ':':
+                return token_type::name_separator;
+            case ',':
+                return token_type::value_separator;
+
+            // literals
+            case 't':
+                return scan_literal("true", 4, token_type::literal_true);
+            case 'f':
+                return scan_literal("false", 5, token_type::literal_false);
+            case 'n':
+                return scan_literal("null", 4, token_type::literal_null);
+
+            // string
+            case '\"':
+                return scan_string();
+
+            // number
+            case '-':
+            case '0':
+            case '1':
+            case '2':
+            case '3':
+            case '4':
+            case '5':
+            case '6':
+            case '7':
+            case '8':
+            case '9':
+                return scan_number();
+
+            // end of input (the null byte is needed when parsing from
+            // string literals)
+            case '\0':
+            case std::char_traits<char>::eof():
+                return token_type::end_of_input;
+
+            // error
+            default:
+                error_message = "invalid literal";
+                return token_type::parse_error;
+        }
+    }
+
+  private:
+    /// input adapter
+    detail::input_adapter_t ia = nullptr;
+
+    /// the current character
+    std::char_traits<char>::int_type current = std::char_traits<char>::eof();
+
+    /// whether the next get() call should just return current
+    bool next_unget = false;
+
+    /// the number of characters read
+    std::size_t chars_read = 0;
+
+    /// raw input token string (for error messages)
+    std::vector<char> token_string {};
+
+    /// buffer for variable-length tokens (numbers, strings)
+    string_t token_buffer {};
+
+    /// a description of occurred lexer errors
+    const char* error_message = "";
+
+    // number values
+    number_integer_t value_integer = 0;
+    number_unsigned_t value_unsigned = 0;
+    number_float_t value_float = 0;
+
+    /// the decimal point
+    const char decimal_point_char = '.';
+};
+}
+}
+
+// #include <nlohmann/detail/input/parser.hpp>
+
+
+#include <cassert> // assert
+#include <cmath> // isfinite
+#include <cstdint> // uint8_t
+#include <functional> // function
+#include <string> // string
+#include <utility> // move
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/is_sax.hpp>
+
+
+#include <cstdint> // size_t
+#include <utility> // declval
+
+// #include <nlohmann/detail/meta/detected.hpp>
+
+
+#include <type_traits>
+
+// #include <nlohmann/detail/meta/void_t.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+template <typename...>
+using void_t = void;
+}
+}
+
+
+// http://en.cppreference.com/w/cpp/experimental/is_detected
+namespace nlohmann
+{
+namespace detail
+{
+struct nonesuch
+{
+    nonesuch() = delete;
+    ~nonesuch() = delete;
+    nonesuch(nonesuch const&) = delete;
+    void operator=(nonesuch const&) = delete;
+};
+
+template <class Default,
+          class AlwaysVoid,
+          template <class...> class Op,
+          class... Args>
+struct detector
+{
+    using value_t = std::false_type;
+    using type = Default;
+};
+
+template <class Default, template <class...> class Op, class... Args>
+struct detector<Default, void_t<Op<Args...>>, Op, Args...>
+{
+    using value_t = std::true_type;
+    using type = Op<Args...>;
+};
+
+template <template <class...> class Op, class... Args>
+using is_detected = typename detector<nonesuch, void, Op, Args...>::value_t;
+
+template <template <class...> class Op, class... Args>
+using detected_t = typename detector<nonesuch, void, Op, Args...>::type;
+
+template <class Default, template <class...> class Op, class... Args>
+using detected_or = detector<Default, void, Op, Args...>;
+
+template <class Default, template <class...> class Op, class... Args>
+using detected_or_t = typename detected_or<Default, Op, Args...>::type;
+
+template <class Expected, template <class...> class Op, class... Args>
+using is_detected_exact = std::is_same<Expected, detected_t<Op, Args...>>;
+
+template <class To, template <class...> class Op, class... Args>
+using is_detected_convertible =
+    std::is_convertible<detected_t<Op, Args...>, To>;
+}
+}
+
+// #include <nlohmann/detail/meta/type_traits.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+template <typename T>
+using null_function_t = decltype(std::declval<T&>().null());
+
+template <typename T>
+using boolean_function_t =
+    decltype(std::declval<T&>().boolean(std::declval<bool>()));
+
+template <typename T, typename Integer>
+using number_integer_function_t =
+    decltype(std::declval<T&>().number_integer(std::declval<Integer>()));
+
+template <typename T, typename Unsigned>
+using number_unsigned_function_t =
+    decltype(std::declval<T&>().number_unsigned(std::declval<Unsigned>()));
+
+template <typename T, typename Float, typename String>
+using number_float_function_t = decltype(std::declval<T&>().number_float(
+                                    std::declval<Float>(), std::declval<const String&>()));
+
+template <typename T, typename String>
+using string_function_t =
+    decltype(std::declval<T&>().string(std::declval<String&>()));
+
+template <typename T>
+using start_object_function_t =
+    decltype(std::declval<T&>().start_object(std::declval<std::size_t>()));
+
+template <typename T, typename String>
+using key_function_t =
+    decltype(std::declval<T&>().key(std::declval<String&>()));
+
+template <typename T>
+using end_object_function_t = decltype(std::declval<T&>().end_object());
+
+template <typename T>
+using start_array_function_t =
+    decltype(std::declval<T&>().start_array(std::declval<std::size_t>()));
+
+template <typename T>
+using end_array_function_t = decltype(std::declval<T&>().end_array());
+
+template <typename T, typename Exception>
+using parse_error_function_t = decltype(std::declval<T&>().parse_error(
+        std::declval<std::size_t>(), std::declval<const std::string&>(),
+        std::declval<const Exception&>()));
+
+template <typename SAX, typename BasicJsonType>
+struct is_sax
+{
+  private:
+    static_assert(is_basic_json<BasicJsonType>::value,
+                  "BasicJsonType must be of type basic_json<...>");
+
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using exception_t = typename BasicJsonType::exception;
+
+  public:
+    static constexpr bool value =
+        is_detected_exact<bool, null_function_t, SAX>::value &&
+        is_detected_exact<bool, boolean_function_t, SAX>::value &&
+        is_detected_exact<bool, number_integer_function_t, SAX,
+        number_integer_t>::value &&
+        is_detected_exact<bool, number_unsigned_function_t, SAX,
+        number_unsigned_t>::value &&
+        is_detected_exact<bool, number_float_function_t, SAX, number_float_t,
+        string_t>::value &&
+        is_detected_exact<bool, string_function_t, SAX, string_t>::value &&
+        is_detected_exact<bool, start_object_function_t, SAX>::value &&
+        is_detected_exact<bool, key_function_t, SAX, string_t>::value &&
+        is_detected_exact<bool, end_object_function_t, SAX>::value &&
+        is_detected_exact<bool, start_array_function_t, SAX>::value &&
+        is_detected_exact<bool, end_array_function_t, SAX>::value &&
+        is_detected_exact<bool, parse_error_function_t, SAX, exception_t>::value;
+};
+
+template <typename SAX, typename BasicJsonType>
+struct is_sax_static_asserts
+{
+  private:
+    static_assert(is_basic_json<BasicJsonType>::value,
+                  "BasicJsonType must be of type basic_json<...>");
+
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using exception_t = typename BasicJsonType::exception;
+
+  public:
+    static_assert(is_detected_exact<bool, null_function_t, SAX>::value,
+                  "Missing/invalid function: bool null()");
+    static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,
+                  "Missing/invalid function: bool boolean(bool)");
+    static_assert(is_detected_exact<bool, boolean_function_t, SAX>::value,
+                  "Missing/invalid function: bool boolean(bool)");
+    static_assert(
+        is_detected_exact<bool, number_integer_function_t, SAX,
+        number_integer_t>::value,
+        "Missing/invalid function: bool number_integer(number_integer_t)");
+    static_assert(
+        is_detected_exact<bool, number_unsigned_function_t, SAX,
+        number_unsigned_t>::value,
+        "Missing/invalid function: bool number_unsigned(number_unsigned_t)");
+    static_assert(is_detected_exact<bool, number_float_function_t, SAX,
+                  number_float_t, string_t>::value,
+                  "Missing/invalid function: bool number_float(number_float_t, const string_t&)");
+    static_assert(
+        is_detected_exact<bool, string_function_t, SAX, string_t>::value,
+        "Missing/invalid function: bool string(string_t&)");
+    static_assert(is_detected_exact<bool, start_object_function_t, SAX>::value,
+                  "Missing/invalid function: bool start_object(std::size_t)");
+    static_assert(is_detected_exact<bool, key_function_t, SAX, string_t>::value,
+                  "Missing/invalid function: bool key(string_t&)");
+    static_assert(is_detected_exact<bool, end_object_function_t, SAX>::value,
+                  "Missing/invalid function: bool end_object()");
+    static_assert(is_detected_exact<bool, start_array_function_t, SAX>::value,
+                  "Missing/invalid function: bool start_array(std::size_t)");
+    static_assert(is_detected_exact<bool, end_array_function_t, SAX>::value,
+                  "Missing/invalid function: bool end_array()");
+    static_assert(
+        is_detected_exact<bool, parse_error_function_t, SAX, exception_t>::value,
+        "Missing/invalid function: bool parse_error(std::size_t, const "
+        "std::string&, const exception&)");
+};
+}
+}
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+// #include <nlohmann/detail/input/json_sax.hpp>
+
+
+#include <cstddef>
+#include <string>
+#include <vector>
+
+// #include <nlohmann/detail/input/parser.hpp>
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+
+namespace nlohmann
+{
+
+/*!
+@brief SAX interface
+
+This class describes the SAX interface used by @ref nlohmann::json::sax_parse.
+Each function is called in different situations while the input is parsed. The
+boolean return value informs the parser whether to continue processing the
+input.
+*/
+template<typename BasicJsonType>
+struct json_sax
+{
+    /// type for (signed) integers
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    /// type for unsigned integers
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    /// type for floating-point numbers
+    using number_float_t = typename BasicJsonType::number_float_t;
+    /// type for strings
+    using string_t = typename BasicJsonType::string_t;
+
+    /*!
+    @brief a null value was read
+    @return whether parsing should proceed
+    */
+    virtual bool null() = 0;
+
+    /*!
+    @brief a boolean value was read
+    @param[in] val  boolean value
+    @return whether parsing should proceed
+    */
+    virtual bool boolean(bool val) = 0;
+
+    /*!
+    @brief an integer number was read
+    @param[in] val  integer value
+    @return whether parsing should proceed
+    */
+    virtual bool number_integer(number_integer_t val) = 0;
+
+    /*!
+    @brief an unsigned integer number was read
+    @param[in] val  unsigned integer value
+    @return whether parsing should proceed
+    */
+    virtual bool number_unsigned(number_unsigned_t val) = 0;
+
+    /*!
+    @brief an floating-point number was read
+    @param[in] val  floating-point value
+    @param[in] s    raw token value
+    @return whether parsing should proceed
+    */
+    virtual bool number_float(number_float_t val, const string_t& s) = 0;
+
+    /*!
+    @brief a string was read
+    @param[in] val  string value
+    @return whether parsing should proceed
+    @note It is safe to move the passed string.
+    */
+    virtual bool string(string_t& val) = 0;
+
+    /*!
+    @brief the beginning of an object was read
+    @param[in] elements  number of object elements or -1 if unknown
+    @return whether parsing should proceed
+    @note binary formats may report the number of elements
+    */
+    virtual bool start_object(std::size_t elements) = 0;
+
+    /*!
+    @brief an object key was read
+    @param[in] val  object key
+    @return whether parsing should proceed
+    @note It is safe to move the passed string.
+    */
+    virtual bool key(string_t& val) = 0;
+
+    /*!
+    @brief the end of an object was read
+    @return whether parsing should proceed
+    */
+    virtual bool end_object() = 0;
+
+    /*!
+    @brief the beginning of an array was read
+    @param[in] elements  number of array elements or -1 if unknown
+    @return whether parsing should proceed
+    @note binary formats may report the number of elements
+    */
+    virtual bool start_array(std::size_t elements) = 0;
+
+    /*!
+    @brief the end of an array was read
+    @return whether parsing should proceed
+    */
+    virtual bool end_array() = 0;
+
+    /*!
+    @brief a parse error occurred
+    @param[in] position    the position in the input where the error occurs
+    @param[in] last_token  the last read token
+    @param[in] error_msg   a detailed error message
+    @return whether parsing should proceed (must return false)
+    */
+    virtual bool parse_error(std::size_t position,
+                             const std::string& last_token,
+                             const detail::exception& ex) = 0;
+
+    virtual ~json_sax() = default;
+};
+
+
+namespace detail
+{
+/*!
+@brief SAX implementation to create a JSON value from SAX events
+
+This class implements the @ref json_sax interface and processes the SAX events
+to create a JSON value which makes it basically a DOM parser. The structure or
+hierarchy of the JSON value is managed by the stack `ref_stack` which contains
+a pointer to the respective array or object for each recursion depth.
+
+After successful parsing, the value that is passed by reference to the
+constructor contains the parsed value.
+
+@tparam BasicJsonType  the JSON type
+*/
+template<typename BasicJsonType>
+class json_sax_dom_parser
+{
+  public:
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+
+    /*!
+    @param[in, out] r  reference to a JSON value that is manipulated while
+                       parsing
+    @param[in] allow_exceptions_  whether parse errors yield exceptions
+    */
+    explicit json_sax_dom_parser(BasicJsonType& r, const bool allow_exceptions_ = true)
+        : root(r), allow_exceptions(allow_exceptions_)
+    {}
+
+    bool null()
+    {
+        handle_value(nullptr);
+        return true;
+    }
+
+    bool boolean(bool val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_integer(number_integer_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_unsigned(number_unsigned_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_float(number_float_t val, const string_t&)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool string(string_t& val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool start_object(std::size_t len)
+    {
+        ref_stack.push_back(handle_value(BasicJsonType::value_t::object));
+
+        if (JSON_UNLIKELY(len != std::size_t(-1) and len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408,
+                                            "excessive object size: " + std::to_string(len)));
+        }
+
+        return true;
+    }
+
+    bool key(string_t& val)
+    {
+        // add null at given key and store the reference for later
+        object_element = &(ref_stack.back()->m_value.object->operator[](val));
+        return true;
+    }
+
+    bool end_object()
+    {
+        ref_stack.pop_back();
+        return true;
+    }
+
+    bool start_array(std::size_t len)
+    {
+        ref_stack.push_back(handle_value(BasicJsonType::value_t::array));
+
+        if (JSON_UNLIKELY(len != std::size_t(-1) and len > ref_stack.back()->max_size()))
+        {
+            JSON_THROW(out_of_range::create(408,
+                                            "excessive array size: " + std::to_string(len)));
+        }
+
+        return true;
+    }
+
+    bool end_array()
+    {
+        ref_stack.pop_back();
+        return true;
+    }
+
+    bool parse_error(std::size_t, const std::string&,
+                     const detail::exception& ex)
+    {
+        errored = true;
+        if (allow_exceptions)
+        {
+            // determine the proper exception type from the id
+            switch ((ex.id / 100) % 100)
+            {
+                case 1:
+                    JSON_THROW(*reinterpret_cast<const detail::parse_error*>(&ex));
+                case 4:
+                    JSON_THROW(*reinterpret_cast<const detail::out_of_range*>(&ex));
+                // LCOV_EXCL_START
+                case 2:
+                    JSON_THROW(*reinterpret_cast<const detail::invalid_iterator*>(&ex));
+                case 3:
+                    JSON_THROW(*reinterpret_cast<const detail::type_error*>(&ex));
+                case 5:
+                    JSON_THROW(*reinterpret_cast<const detail::other_error*>(&ex));
+                default:
+                    assert(false);
+                    // LCOV_EXCL_STOP
+            }
+        }
+        return false;
+    }
+
+    constexpr bool is_errored() const
+    {
+        return errored;
+    }
+
+  private:
+    /*!
+    @invariant If the ref stack is empty, then the passed value will be the new
+               root.
+    @invariant If the ref stack contains a value, then it is an array or an
+               object to which we can add elements
+    */
+    template<typename Value>
+    BasicJsonType* handle_value(Value&& v)
+    {
+        if (ref_stack.empty())
+        {
+            root = BasicJsonType(std::forward<Value>(v));
+            return &root;
+        }
+        else
+        {
+            assert(ref_stack.back()->is_array() or ref_stack.back()->is_object());
+            if (ref_stack.back()->is_array())
+            {
+                ref_stack.back()->m_value.array->emplace_back(std::forward<Value>(v));
+                return &(ref_stack.back()->m_value.array->back());
+            }
+            else
+            {
+                assert(object_element);
+                *object_element = BasicJsonType(std::forward<Value>(v));
+                return object_element;
+            }
+        }
+    }
+
+    /// the parsed JSON value
+    BasicJsonType& root;
+    /// stack to model hierarchy of values
+    std::vector<BasicJsonType*> ref_stack;
+    /// helper to hold the reference for the next object element
+    BasicJsonType* object_element = nullptr;
+    /// whether a syntax error occurred
+    bool errored = false;
+    /// whether to throw exceptions in case of errors
+    const bool allow_exceptions = true;
+};
+
+template<typename BasicJsonType>
+class json_sax_dom_callback_parser
+{
+  public:
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using parser_callback_t = typename BasicJsonType::parser_callback_t;
+    using parse_event_t = typename BasicJsonType::parse_event_t;
+
+    json_sax_dom_callback_parser(BasicJsonType& r,
+                                 const parser_callback_t cb,
+                                 const bool allow_exceptions_ = true)
+        : root(r), callback(cb), allow_exceptions(allow_exceptions_)
+    {
+        keep_stack.push_back(true);
+    }
+
+    bool null()
+    {
+        handle_value(nullptr);
+        return true;
+    }
+
+    bool boolean(bool val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_integer(number_integer_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_unsigned(number_unsigned_t val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool number_float(number_float_t val, const string_t&)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool string(string_t& val)
+    {
+        handle_value(val);
+        return true;
+    }
+
+    bool start_object(std::size_t len)
+    {
+        // check callback for object start
+        const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::object_start, discarded);
+        keep_stack.push_back(keep);
+
+        auto val = handle_value(BasicJsonType::value_t::object, true);
+        ref_stack.push_back(val.second);
+
+        // check object limit
+        if (ref_stack.back())
+        {
+            if (JSON_UNLIKELY(len != std::size_t(-1) and len > ref_stack.back()->max_size()))
+            {
+                JSON_THROW(out_of_range::create(408,
+                                                "excessive object size: " + std::to_string(len)));
+            }
+        }
+
+        return true;
+    }
+
+    bool key(string_t& val)
+    {
+        BasicJsonType k = BasicJsonType(val);
+
+        // check callback for key
+        const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::key, k);
+        key_keep_stack.push_back(keep);
+
+        // add discarded value at given key and store the reference for later
+        if (keep and ref_stack.back())
+        {
+            object_element = &(ref_stack.back()->m_value.object->operator[](val) = discarded);
+        }
+
+        return true;
+    }
+
+    bool end_object()
+    {
+        if (ref_stack.back())
+        {
+            if (not callback(static_cast<int>(ref_stack.size()) - 1, parse_event_t::object_end, *ref_stack.back()))
+            {
+                // discard object
+                *ref_stack.back() = discarded;
+            }
+        }
+
+        assert(not ref_stack.empty());
+        assert(not keep_stack.empty());
+        ref_stack.pop_back();
+        keep_stack.pop_back();
+
+        if (not ref_stack.empty() and ref_stack.back())
+        {
+            // remove discarded value
+            if (ref_stack.back()->is_object())
+            {
+                for (auto it = ref_stack.back()->begin(); it != ref_stack.back()->end(); ++it)
+                {
+                    if (it->is_discarded())
+                    {
+                        ref_stack.back()->erase(it);
+                        break;
+                    }
+                }
+            }
+        }
+
+        return true;
+    }
+
+    bool start_array(std::size_t len)
+    {
+        const bool keep = callback(static_cast<int>(ref_stack.size()), parse_event_t::array_start, discarded);
+        keep_stack.push_back(keep);
+
+        auto val = handle_value(BasicJsonType::value_t::array, true);
+        ref_stack.push_back(val.second);
+
+        // check array limit
+        if (ref_stack.back())
+        {
+            if (JSON_UNLIKELY(len != std::size_t(-1) and len > ref_stack.back()->max_size()))
+            {
+                JSON_THROW(out_of_range::create(408,
+                                                "excessive array size: " + std::to_string(len)));
+            }
+        }
+
+        return true;
+    }
+
+    bool end_array()
+    {
+        bool keep = true;
+
+        if (ref_stack.back())
+        {
+            keep = callback(static_cast<int>(ref_stack.size()) - 1, parse_event_t::array_end, *ref_stack.back());
+            if (not keep)
+            {
+                // discard array
+                *ref_stack.back() = discarded;
+            }
+        }
+
+        assert(not ref_stack.empty());
+        assert(not keep_stack.empty());
+        ref_stack.pop_back();
+        keep_stack.pop_back();
+
+        // remove discarded value
+        if (not keep and not ref_stack.empty())
+        {
+            if (ref_stack.back()->is_array())
+            {
+                ref_stack.back()->m_value.array->pop_back();
+            }
+        }
+
+        return true;
+    }
+
+    bool parse_error(std::size_t, const std::string&,
+                     const detail::exception& ex)
+    {
+        errored = true;
+        if (allow_exceptions)
+        {
+            // determine the proper exception type from the id
+            switch ((ex.id / 100) % 100)
+            {
+                case 1:
+                    JSON_THROW(*reinterpret_cast<const detail::parse_error*>(&ex));
+                case 4:
+                    JSON_THROW(*reinterpret_cast<const detail::out_of_range*>(&ex));
+                // LCOV_EXCL_START
+                case 2:
+                    JSON_THROW(*reinterpret_cast<const detail::invalid_iterator*>(&ex));
+                case 3:
+                    JSON_THROW(*reinterpret_cast<const detail::type_error*>(&ex));
+                case 5:
+                    JSON_THROW(*reinterpret_cast<const detail::other_error*>(&ex));
+                default:
+                    assert(false);
+                    // LCOV_EXCL_STOP
+            }
+        }
+        return false;
+    }
+
+    constexpr bool is_errored() const
+    {
+        return errored;
+    }
+
+  private:
+    /*!
+    @param[in] v  value to add to the JSON value we build during parsing
+    @param[in] skip_callback  whether we should skip calling the callback
+               function; this is required after start_array() and
+               start_object() SAX events, because otherwise we would call the
+               callback function with an empty array or object, respectively.
+
+    @invariant If the ref stack is empty, then the passed value will be the new
+               root.
+    @invariant If the ref stack contains a value, then it is an array or an
+               object to which we can add elements
+
+    @return pair of boolean (whether value should be kept) and pointer (to the
+            passed value in the ref_stack hierarchy; nullptr if not kept)
+    */
+    template<typename Value>
+    std::pair<bool, BasicJsonType*> handle_value(Value&& v, const bool skip_callback = false)
+    {
+        assert(not keep_stack.empty());
+
+        // do not handle this value if we know it would be added to a discarded
+        // container
+        if (not keep_stack.back())
+        {
+            return {false, nullptr};
+        }
+
+        // create value
+        auto value = BasicJsonType(std::forward<Value>(v));
+
+        // check callback
+        const bool keep = skip_callback or callback(static_cast<int>(ref_stack.size()), parse_event_t::value, value);
+
+        // do not handle this value if we just learnt it shall be discarded
+        if (not keep)
+        {
+            return {false, nullptr};
+        }
+
+        if (ref_stack.empty())
+        {
+            root = std::move(value);
+            return {true, &root};
+        }
+        else
+        {
+            // skip this value if we already decided to skip the parent
+            // (https://github.com/nlohmann/json/issues/971#issuecomment-413678360)
+            if (not ref_stack.back())
+            {
+                return {false, nullptr};
+            }
+
+            assert(ref_stack.back()->is_array() or ref_stack.back()->is_object());
+            if (ref_stack.back()->is_array())
+            {
+                ref_stack.back()->m_value.array->push_back(std::move(value));
+                return {true, &(ref_stack.back()->m_value.array->back())};
+            }
+            else
+            {
+                // check if we should store an element for the current key
+                assert(not key_keep_stack.empty());
+                const bool store_element = key_keep_stack.back();
+                key_keep_stack.pop_back();
+
+                if (not store_element)
+                {
+                    return {false, nullptr};
+                }
+
+                assert(object_element);
+                *object_element = std::move(value);
+                return {true, object_element};
+            }
+        }
+    }
+
+    /// the parsed JSON value
+    BasicJsonType& root;
+    /// stack to model hierarchy of values
+    std::vector<BasicJsonType*> ref_stack;
+    /// stack to manage which values to keep
+    std::vector<bool> keep_stack;
+    /// stack to manage which object keys to keep
+    std::vector<bool> key_keep_stack;
+    /// helper to hold the reference for the next object element
+    BasicJsonType* object_element = nullptr;
+    /// whether a syntax error occurred
+    bool errored = false;
+    /// callback function
+    const parser_callback_t callback = nullptr;
+    /// whether to throw exceptions in case of errors
+    const bool allow_exceptions = true;
+    /// a discarded value for the callback
+    BasicJsonType discarded = BasicJsonType::value_t::discarded;
+};
+
+template<typename BasicJsonType>
+class json_sax_acceptor
+{
+  public:
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+
+    bool null()
+    {
+        return true;
+    }
+
+    bool boolean(bool)
+    {
+        return true;
+    }
+
+    bool number_integer(number_integer_t)
+    {
+        return true;
+    }
+
+    bool number_unsigned(number_unsigned_t)
+    {
+        return true;
+    }
+
+    bool number_float(number_float_t, const string_t&)
+    {
+        return true;
+    }
+
+    bool string(string_t&)
+    {
+        return true;
+    }
+
+    bool start_object(std::size_t = std::size_t(-1))
+    {
+        return true;
+    }
+
+    bool key(string_t&)
+    {
+        return true;
+    }
+
+    bool end_object()
+    {
+        return true;
+    }
+
+    bool start_array(std::size_t = std::size_t(-1))
+    {
+        return true;
+    }
+
+    bool end_array()
+    {
+        return true;
+    }
+
+    bool parse_error(std::size_t, const std::string&, const detail::exception&)
+    {
+        return false;
+    }
+};
+}
+
+}
+
+// #include <nlohmann/detail/input/lexer.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+////////////
+// parser //
+////////////
+
+/*!
+@brief syntax analysis
+
+This class implements a recursive decent parser.
+*/
+template<typename BasicJsonType>
+class parser
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using lexer_t = lexer<BasicJsonType>;
+    using token_type = typename lexer_t::token_type;
+
+  public:
+    enum class parse_event_t : uint8_t
+    {
+        /// the parser read `{` and started to process a JSON object
+        object_start,
+        /// the parser read `}` and finished processing a JSON object
+        object_end,
+        /// the parser read `[` and started to process a JSON array
+        array_start,
+        /// the parser read `]` and finished processing a JSON array
+        array_end,
+        /// the parser read a key of a value in an object
+        key,
+        /// the parser finished reading a JSON value
+        value
+    };
+
+    using parser_callback_t =
+        std::function<bool(int depth, parse_event_t event, BasicJsonType& parsed)>;
+
+    /// a parser reading from an input adapter
+    explicit parser(detail::input_adapter_t&& adapter,
+                    const parser_callback_t cb = nullptr,
+                    const bool allow_exceptions_ = true)
+        : callback(cb), m_lexer(std::move(adapter)), allow_exceptions(allow_exceptions_)
+    {
+        // read first token
+        get_token();
+    }
+
+    /*!
+    @brief public parser interface
+
+    @param[in] strict      whether to expect the last token to be EOF
+    @param[in,out] result  parsed JSON value
+
+    @throw parse_error.101 in case of an unexpected token
+    @throw parse_error.102 if to_unicode fails or surrogate error
+    @throw parse_error.103 if to_unicode fails
+    */
+    void parse(const bool strict, BasicJsonType& result)
+    {
+        if (callback)
+        {
+            json_sax_dom_callback_parser<BasicJsonType> sdp(result, callback, allow_exceptions);
+            sax_parse_internal(&sdp);
+            result.assert_invariant();
+
+            // in strict mode, input must be completely read
+            if (strict and (get_token() != token_type::end_of_input))
+            {
+                sdp.parse_error(m_lexer.get_position(),
+                                m_lexer.get_token_string(),
+                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_of_input)));
+            }
+
+            // in case of an error, return discarded value
+            if (sdp.is_errored())
+            {
+                result = value_t::discarded;
+                return;
+            }
+
+            // set top-level value to null if it was discarded by the callback
+            // function
+            if (result.is_discarded())
+            {
+                result = nullptr;
+            }
+        }
+        else
+        {
+            json_sax_dom_parser<BasicJsonType> sdp(result, allow_exceptions);
+            sax_parse_internal(&sdp);
+            result.assert_invariant();
+
+            // in strict mode, input must be completely read
+            if (strict and (get_token() != token_type::end_of_input))
+            {
+                sdp.parse_error(m_lexer.get_position(),
+                                m_lexer.get_token_string(),
+                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_of_input)));
+            }
+
+            // in case of an error, return discarded value
+            if (sdp.is_errored())
+            {
+                result = value_t::discarded;
+                return;
+            }
+        }
+    }
+
+    /*!
+    @brief public accept interface
+
+    @param[in] strict  whether to expect the last token to be EOF
+    @return whether the input is a proper JSON text
+    */
+    bool accept(const bool strict = true)
+    {
+        json_sax_acceptor<BasicJsonType> sax_acceptor;
+        return sax_parse(&sax_acceptor, strict);
+    }
+
+    template <typename SAX>
+    bool sax_parse(SAX* sax, const bool strict = true)
+    {
+        (void)detail::is_sax_static_asserts<SAX, BasicJsonType> {};
+        const bool result = sax_parse_internal(sax);
+
+        // strict mode: next byte must be EOF
+        if (result and strict and (get_token() != token_type::end_of_input))
+        {
+            return sax->parse_error(m_lexer.get_position(),
+                                    m_lexer.get_token_string(),
+                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_of_input)));
+        }
+
+        return result;
+    }
+
+  private:
+    template <typename SAX>
+    bool sax_parse_internal(SAX* sax)
+    {
+        // stack to remember the hieararchy of structured values we are parsing
+        // true = array; false = object
+        std::vector<bool> states;
+        // value to avoid a goto (see comment where set to true)
+        bool skip_to_state_evaluation = false;
+
+        while (true)
+        {
+            if (not skip_to_state_evaluation)
+            {
+                // invariant: get_token() was called before each iteration
+                switch (last_token)
+                {
+                    case token_type::begin_object:
+                    {
+                        if (JSON_UNLIKELY(not sax->start_object(std::size_t(-1))))
+                        {
+                            return false;
+                        }
+
+                        // closing } -> we are done
+                        if (get_token() == token_type::end_object)
+                        {
+                            if (JSON_UNLIKELY(not sax->end_object()))
+                            {
+                                return false;
+                            }
+                            break;
+                        }
+
+                        // parse key
+                        if (JSON_UNLIKELY(last_token != token_type::value_string))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::value_string)));
+                        }
+                        else
+                        {
+                            if (JSON_UNLIKELY(not sax->key(m_lexer.get_string())))
+                            {
+                                return false;
+                            }
+                        }
+
+                        // parse separator (:)
+                        if (JSON_UNLIKELY(get_token() != token_type::name_separator))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::name_separator)));
+                        }
+
+                        // remember we are now inside an object
+                        states.push_back(false);
+
+                        // parse values
+                        get_token();
+                        continue;
+                    }
+
+                    case token_type::begin_array:
+                    {
+                        if (JSON_UNLIKELY(not sax->start_array(std::size_t(-1))))
+                        {
+                            return false;
+                        }
+
+                        // closing ] -> we are done
+                        if (get_token() == token_type::end_array)
+                        {
+                            if (JSON_UNLIKELY(not sax->end_array()))
+                            {
+                                return false;
+                            }
+                            break;
+                        }
+
+                        // remember we are now inside an array
+                        states.push_back(true);
+
+                        // parse values (no need to call get_token)
+                        continue;
+                    }
+
+                    case token_type::value_float:
+                    {
+                        const auto res = m_lexer.get_number_float();
+
+                        if (JSON_UNLIKELY(not std::isfinite(res)))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    out_of_range::create(406, "number overflow parsing '" + m_lexer.get_token_string() + "'"));
+                        }
+                        else
+                        {
+                            if (JSON_UNLIKELY(not sax->number_float(res, m_lexer.get_string())))
+                            {
+                                return false;
+                            }
+                            break;
+                        }
+                    }
+
+                    case token_type::literal_false:
+                    {
+                        if (JSON_UNLIKELY(not sax->boolean(false)))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::literal_null:
+                    {
+                        if (JSON_UNLIKELY(not sax->null()))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::literal_true:
+                    {
+                        if (JSON_UNLIKELY(not sax->boolean(true)))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::value_integer:
+                    {
+                        if (JSON_UNLIKELY(not sax->number_integer(m_lexer.get_number_integer())))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::value_string:
+                    {
+                        if (JSON_UNLIKELY(not sax->string(m_lexer.get_string())))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::value_unsigned:
+                    {
+                        if (JSON_UNLIKELY(not sax->number_unsigned(m_lexer.get_number_unsigned())))
+                        {
+                            return false;
+                        }
+                        break;
+                    }
+
+                    case token_type::parse_error:
+                    {
+                        // using "uninitialized" to avoid "expected" message
+                        return sax->parse_error(m_lexer.get_position(),
+                                                m_lexer.get_token_string(),
+                                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::uninitialized)));
+                    }
+
+                    default: // the last token was unexpected
+                    {
+                        return sax->parse_error(m_lexer.get_position(),
+                                                m_lexer.get_token_string(),
+                                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::literal_or_value)));
+                    }
+                }
+            }
+            else
+            {
+                skip_to_state_evaluation = false;
+            }
+
+            // we reached this line after we successfully parsed a value
+            if (states.empty())
+            {
+                // empty stack: we reached the end of the hieararchy: done
+                return true;
+            }
+            else
+            {
+                if (states.back())  // array
+                {
+                    // comma -> next value
+                    if (get_token() == token_type::value_separator)
+                    {
+                        // parse a new value
+                        get_token();
+                        continue;
+                    }
+
+                    // closing ]
+                    if (JSON_LIKELY(last_token == token_type::end_array))
+                    {
+                        if (JSON_UNLIKELY(not sax->end_array()))
+                        {
+                            return false;
+                        }
+
+                        // We are done with this array. Before we can parse a
+                        // new value, we need to evaluate the new state first.
+                        // By setting skip_to_state_evaluation to false, we
+                        // are effectively jumping to the beginning of this if.
+                        assert(not states.empty());
+                        states.pop_back();
+                        skip_to_state_evaluation = true;
+                        continue;
+                    }
+                    else
+                    {
+                        return sax->parse_error(m_lexer.get_position(),
+                                                m_lexer.get_token_string(),
+                                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_array)));
+                    }
+                }
+                else  // object
+                {
+                    // comma -> next value
+                    if (get_token() == token_type::value_separator)
+                    {
+                        // parse key
+                        if (JSON_UNLIKELY(get_token() != token_type::value_string))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::value_string)));
+                        }
+                        else
+                        {
+                            if (JSON_UNLIKELY(not sax->key(m_lexer.get_string())))
+                            {
+                                return false;
+                            }
+                        }
+
+                        // parse separator (:)
+                        if (JSON_UNLIKELY(get_token() != token_type::name_separator))
+                        {
+                            return sax->parse_error(m_lexer.get_position(),
+                                                    m_lexer.get_token_string(),
+                                                    parse_error::create(101, m_lexer.get_position(), exception_message(token_type::name_separator)));
+                        }
+
+                        // parse values
+                        get_token();
+                        continue;
+                    }
+
+                    // closing }
+                    if (JSON_LIKELY(last_token == token_type::end_object))
+                    {
+                        if (JSON_UNLIKELY(not sax->end_object()))
+                        {
+                            return false;
+                        }
+
+                        // We are done with this object. Before we can parse a
+                        // new value, we need to evaluate the new state first.
+                        // By setting skip_to_state_evaluation to false, we
+                        // are effectively jumping to the beginning of this if.
+                        assert(not states.empty());
+                        states.pop_back();
+                        skip_to_state_evaluation = true;
+                        continue;
+                    }
+                    else
+                    {
+                        return sax->parse_error(m_lexer.get_position(),
+                                                m_lexer.get_token_string(),
+                                                parse_error::create(101, m_lexer.get_position(), exception_message(token_type::end_object)));
+                    }
+                }
+            }
+        }
+    }
+
+    /// get next token from lexer
+    token_type get_token()
+    {
+        return (last_token = m_lexer.scan());
+    }
+
+    std::string exception_message(const token_type expected)
+    {
+        std::string error_msg = "syntax error - ";
+        if (last_token == token_type::parse_error)
+        {
+            error_msg += std::string(m_lexer.get_error_message()) + "; last read: '" +
+                         m_lexer.get_token_string() + "'";
+        }
+        else
+        {
+            error_msg += "unexpected " + std::string(lexer_t::token_type_name(last_token));
+        }
+
+        if (expected != token_type::uninitialized)
+        {
+            error_msg += "; expected " + std::string(lexer_t::token_type_name(expected));
+        }
+
+        return error_msg;
+    }
+
+  private:
+    /// callback function
+    const parser_callback_t callback = nullptr;
+    /// the type of the last read token
+    token_type last_token = token_type::uninitialized;
+    /// the lexer
+    lexer_t m_lexer;
+    /// whether to throw exceptions in case of errors
+    const bool allow_exceptions = true;
+};
+}
+}
+
+// #include <nlohmann/detail/iterators/primitive_iterator.hpp>
+
+
+#include <cstddef> // ptrdiff_t
+#include <limits>  // numeric_limits
+
+namespace nlohmann
+{
+namespace detail
+{
+/*
+@brief an iterator for primitive JSON types
+
+This class models an iterator for primitive JSON types (boolean, number,
+string). It's only purpose is to allow the iterator/const_iterator classes
+to "iterate" over primitive values. Internally, the iterator is modeled by
+a `difference_type` variable. Value begin_value (`0`) models the begin,
+end_value (`1`) models past the end.
+*/
+class primitive_iterator_t
+{
+  private:
+    using difference_type = std::ptrdiff_t;
+    static constexpr difference_type begin_value = 0;
+    static constexpr difference_type end_value = begin_value + 1;
+
+    /// iterator as signed integer type
+    difference_type m_it = (std::numeric_limits<std::ptrdiff_t>::min)();
+
+  public:
+    constexpr difference_type get_value() const noexcept
+    {
+        return m_it;
+    }
+
+    /// set iterator to a defined beginning
+    void set_begin() noexcept
+    {
+        m_it = begin_value;
+    }
+
+    /// set iterator to a defined past the end
+    void set_end() noexcept
+    {
+        m_it = end_value;
+    }
+
+    /// return whether the iterator can be dereferenced
+    constexpr bool is_begin() const noexcept
+    {
+        return m_it == begin_value;
+    }
+
+    /// return whether the iterator is at end
+    constexpr bool is_end() const noexcept
+    {
+        return m_it == end_value;
+    }
+
+    friend constexpr bool operator==(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
+    {
+        return lhs.m_it == rhs.m_it;
+    }
+
+    friend constexpr bool operator<(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
+    {
+        return lhs.m_it < rhs.m_it;
+    }
+
+    primitive_iterator_t operator+(difference_type n) noexcept
+    {
+        auto result = *this;
+        result += n;
+        return result;
+    }
+
+    friend constexpr difference_type operator-(primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
+    {
+        return lhs.m_it - rhs.m_it;
+    }
+
+    primitive_iterator_t& operator++() noexcept
+    {
+        ++m_it;
+        return *this;
+    }
+
+    primitive_iterator_t const operator++(int) noexcept
+    {
+        auto result = *this;
+        ++m_it;
+        return result;
+    }
+
+    primitive_iterator_t& operator--() noexcept
+    {
+        --m_it;
+        return *this;
+    }
+
+    primitive_iterator_t const operator--(int) noexcept
+    {
+        auto result = *this;
+        --m_it;
+        return result;
+    }
+
+    primitive_iterator_t& operator+=(difference_type n) noexcept
+    {
+        m_it += n;
+        return *this;
+    }
+
+    primitive_iterator_t& operator-=(difference_type n) noexcept
+    {
+        m_it -= n;
+        return *this;
+    }
+};
+}
+}
+
+// #include <nlohmann/detail/iterators/internal_iterator.hpp>
+
+
+// #include <nlohmann/detail/iterators/primitive_iterator.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+/*!
+@brief an iterator value
+
+@note This structure could easily be a union, but MSVC currently does not allow
+unions members with complex constructors, see https://github.com/nlohmann/json/pull/105.
+*/
+template<typename BasicJsonType> struct internal_iterator
+{
+    /// iterator for JSON objects
+    typename BasicJsonType::object_t::iterator object_iterator {};
+    /// iterator for JSON arrays
+    typename BasicJsonType::array_t::iterator array_iterator {};
+    /// generic iterator for all other types
+    primitive_iterator_t primitive_iterator {};
+};
+}
+}
+
+// #include <nlohmann/detail/iterators/iter_impl.hpp>
+
+
+#include <ciso646> // not
+#include <iterator> // iterator, random_access_iterator_tag, bidirectional_iterator_tag, advance, next
+#include <type_traits> // conditional, is_const, remove_const
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/iterators/internal_iterator.hpp>
+
+// #include <nlohmann/detail/iterators/primitive_iterator.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+// forward declare, to be able to friend it later on
+template<typename IteratorType> class iteration_proxy;
+
+/*!
+@brief a template for a bidirectional iterator for the @ref basic_json class
+
+This class implements a both iterators (iterator and const_iterator) for the
+@ref basic_json class.
+
+@note An iterator is called *initialized* when a pointer to a JSON value has
+      been set (e.g., by a constructor or a copy assignment). If the iterator is
+      default-constructed, it is *uninitialized* and most methods are undefined.
+      **The library uses assertions to detect calls on uninitialized iterators.**
+
+@requirement The class satisfies the following concept requirements:
+-
+[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator):
+  The iterator that can be moved can be moved in both directions (i.e.
+  incremented and decremented).
+
+@since version 1.0.0, simplified in version 2.0.9, change to bidirectional
+       iterators in version 3.0.0 (see https://github.com/nlohmann/json/issues/593)
+*/
+template<typename BasicJsonType>
+class iter_impl
+{
+    /// allow basic_json to access private members
+    friend iter_impl<typename std::conditional<std::is_const<BasicJsonType>::value, typename std::remove_const<BasicJsonType>::type, const BasicJsonType>::type>;
+    friend BasicJsonType;
+    friend iteration_proxy<iter_impl>;
+
+    using object_t = typename BasicJsonType::object_t;
+    using array_t = typename BasicJsonType::array_t;
+    // make sure BasicJsonType is basic_json or const basic_json
+    static_assert(is_basic_json<typename std::remove_const<BasicJsonType>::type>::value,
+                  "iter_impl only accepts (const) basic_json");
+
+  public:
+
+    /// The std::iterator class template (used as a base class to provide typedefs) is deprecated in C++17.
+    /// The C++ Standard has never required user-defined iterators to derive from std::iterator.
+    /// A user-defined iterator should provide publicly accessible typedefs named
+    /// iterator_category, value_type, difference_type, pointer, and reference.
+    /// Note that value_type is required to be non-const, even for constant iterators.
+    using iterator_category = std::bidirectional_iterator_tag;
+
+    /// the type of the values when the iterator is dereferenced
+    using value_type = typename BasicJsonType::value_type;
+    /// a type to represent differences between iterators
+    using difference_type = typename BasicJsonType::difference_type;
+    /// defines a pointer to the type iterated over (value_type)
+    using pointer = typename std::conditional<std::is_const<BasicJsonType>::value,
+          typename BasicJsonType::const_pointer,
+          typename BasicJsonType::pointer>::type;
+    /// defines a reference to the type iterated over (value_type)
+    using reference =
+        typename std::conditional<std::is_const<BasicJsonType>::value,
+        typename BasicJsonType::const_reference,
+        typename BasicJsonType::reference>::type;
+
+    /// default constructor
+    iter_impl() = default;
+
+    /*!
+    @brief constructor for a given JSON instance
+    @param[in] object  pointer to a JSON object for this iterator
+    @pre object != nullptr
+    @post The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    explicit iter_impl(pointer object) noexcept : m_object(object)
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                m_it.object_iterator = typename object_t::iterator();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_it.array_iterator = typename array_t::iterator();
+                break;
+            }
+
+            default:
+            {
+                m_it.primitive_iterator = primitive_iterator_t();
+                break;
+            }
+        }
+    }
+
+    /*!
+    @note The conventional copy constructor and copy assignment are implicitly
+          defined. Combined with the following converting constructor and
+          assignment, they support: (1) copy from iterator to iterator, (2)
+          copy from const iterator to const iterator, and (3) conversion from
+          iterator to const iterator. However conversion from const iterator
+          to iterator is not defined.
+    */
+
+    /*!
+    @brief converting constructor
+    @param[in] other  non-const iterator to copy from
+    @note It is not checked whether @a other is initialized.
+    */
+    iter_impl(const iter_impl<typename std::remove_const<BasicJsonType>::type>& other) noexcept
+        : m_object(other.m_object), m_it(other.m_it) {}
+
+    /*!
+    @brief converting assignment
+    @param[in,out] other  non-const iterator to copy from
+    @return const/non-const iterator
+    @note It is not checked whether @a other is initialized.
+    */
+    iter_impl& operator=(const iter_impl<typename std::remove_const<BasicJsonType>::type>& other) noexcept
+    {
+        m_object = other.m_object;
+        m_it = other.m_it;
+        return *this;
+    }
+
+  private:
+    /*!
+    @brief set the iterator to the first value
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    void set_begin() noexcept
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                m_it.object_iterator = m_object->m_value.object->begin();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_it.array_iterator = m_object->m_value.array->begin();
+                break;
+            }
+
+            case value_t::null:
+            {
+                // set to end so begin()==end() is true: null is empty
+                m_it.primitive_iterator.set_end();
+                break;
+            }
+
+            default:
+            {
+                m_it.primitive_iterator.set_begin();
+                break;
+            }
+        }
+    }
+
+    /*!
+    @brief set the iterator past the last value
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    void set_end() noexcept
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                m_it.object_iterator = m_object->m_value.object->end();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_it.array_iterator = m_object->m_value.array->end();
+                break;
+            }
+
+            default:
+            {
+                m_it.primitive_iterator.set_end();
+                break;
+            }
+        }
+    }
+
+  public:
+    /*!
+    @brief return a reference to the value pointed to by the iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    reference operator*() const
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                assert(m_it.object_iterator != m_object->m_value.object->end());
+                return m_it.object_iterator->second;
+            }
+
+            case value_t::array:
+            {
+                assert(m_it.array_iterator != m_object->m_value.array->end());
+                return *m_it.array_iterator;
+            }
+
+            case value_t::null:
+                JSON_THROW(invalid_iterator::create(214, "cannot get value"));
+
+            default:
+            {
+                if (JSON_LIKELY(m_it.primitive_iterator.is_begin()))
+                {
+                    return *m_object;
+                }
+
+                JSON_THROW(invalid_iterator::create(214, "cannot get value"));
+            }
+        }
+    }
+
+    /*!
+    @brief dereference the iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    pointer operator->() const
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                assert(m_it.object_iterator != m_object->m_value.object->end());
+                return &(m_it.object_iterator->second);
+            }
+
+            case value_t::array:
+            {
+                assert(m_it.array_iterator != m_object->m_value.array->end());
+                return &*m_it.array_iterator;
+            }
+
+            default:
+            {
+                if (JSON_LIKELY(m_it.primitive_iterator.is_begin()))
+                {
+                    return m_object;
+                }
+
+                JSON_THROW(invalid_iterator::create(214, "cannot get value"));
+            }
+        }
+    }
+
+    /*!
+    @brief post-increment (it++)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl const operator++(int)
+    {
+        auto result = *this;
+        ++(*this);
+        return result;
+    }
+
+    /*!
+    @brief pre-increment (++it)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator++()
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                std::advance(m_it.object_iterator, 1);
+                break;
+            }
+
+            case value_t::array:
+            {
+                std::advance(m_it.array_iterator, 1);
+                break;
+            }
+
+            default:
+            {
+                ++m_it.primitive_iterator;
+                break;
+            }
+        }
+
+        return *this;
+    }
+
+    /*!
+    @brief post-decrement (it--)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl const operator--(int)
+    {
+        auto result = *this;
+        --(*this);
+        return result;
+    }
+
+    /*!
+    @brief pre-decrement (--it)
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator--()
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+            {
+                std::advance(m_it.object_iterator, -1);
+                break;
+            }
+
+            case value_t::array:
+            {
+                std::advance(m_it.array_iterator, -1);
+                break;
+            }
+
+            default:
+            {
+                --m_it.primitive_iterator;
+                break;
+            }
+        }
+
+        return *this;
+    }
+
+    /*!
+    @brief  comparison: equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator==(const iter_impl& other) const
+    {
+        // if objects are not the same, the comparison is undefined
+        if (JSON_UNLIKELY(m_object != other.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers"));
+        }
+
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                return (m_it.object_iterator == other.m_it.object_iterator);
+
+            case value_t::array:
+                return (m_it.array_iterator == other.m_it.array_iterator);
+
+            default:
+                return (m_it.primitive_iterator == other.m_it.primitive_iterator);
+        }
+    }
+
+    /*!
+    @brief  comparison: not equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator!=(const iter_impl& other) const
+    {
+        return not operator==(other);
+    }
+
+    /*!
+    @brief  comparison: smaller
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator<(const iter_impl& other) const
+    {
+        // if objects are not the same, the comparison is undefined
+        if (JSON_UNLIKELY(m_object != other.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(212, "cannot compare iterators of different containers"));
+        }
+
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(213, "cannot compare order of object iterators"));
+
+            case value_t::array:
+                return (m_it.array_iterator < other.m_it.array_iterator);
+
+            default:
+                return (m_it.primitive_iterator < other.m_it.primitive_iterator);
+        }
+    }
+
+    /*!
+    @brief  comparison: less than or equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator<=(const iter_impl& other) const
+    {
+        return not other.operator < (*this);
+    }
+
+    /*!
+    @brief  comparison: greater than
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator>(const iter_impl& other) const
+    {
+        return not operator<=(other);
+    }
+
+    /*!
+    @brief  comparison: greater than or equal
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    bool operator>=(const iter_impl& other) const
+    {
+        return not operator<(other);
+    }
+
+    /*!
+    @brief  add to iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator+=(difference_type i)
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators"));
+
+            case value_t::array:
+            {
+                std::advance(m_it.array_iterator, i);
+                break;
+            }
+
+            default:
+            {
+                m_it.primitive_iterator += i;
+                break;
+            }
+        }
+
+        return *this;
+    }
+
+    /*!
+    @brief  subtract from iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl& operator-=(difference_type i)
+    {
+        return operator+=(-i);
+    }
+
+    /*!
+    @brief  add to iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator+(difference_type i) const
+    {
+        auto result = *this;
+        result += i;
+        return result;
+    }
+
+    /*!
+    @brief  addition of distance and iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    friend iter_impl operator+(difference_type i, const iter_impl& it)
+    {
+        auto result = it;
+        result += i;
+        return result;
+    }
+
+    /*!
+    @brief  subtract from iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    iter_impl operator-(difference_type i) const
+    {
+        auto result = *this;
+        result -= i;
+        return result;
+    }
+
+    /*!
+    @brief  return difference
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    difference_type operator-(const iter_impl& other) const
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(209, "cannot use offsets with object iterators"));
+
+            case value_t::array:
+                return m_it.array_iterator - other.m_it.array_iterator;
+
+            default:
+                return m_it.primitive_iterator - other.m_it.primitive_iterator;
+        }
+    }
+
+    /*!
+    @brief  access to successor
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    reference operator[](difference_type n) const
+    {
+        assert(m_object != nullptr);
+
+        switch (m_object->m_type)
+        {
+            case value_t::object:
+                JSON_THROW(invalid_iterator::create(208, "cannot use operator[] for object iterators"));
+
+            case value_t::array:
+                return *std::next(m_it.array_iterator, n);
+
+            case value_t::null:
+                JSON_THROW(invalid_iterator::create(214, "cannot get value"));
+
+            default:
+            {
+                if (JSON_LIKELY(m_it.primitive_iterator.get_value() == -n))
+                {
+                    return *m_object;
+                }
+
+                JSON_THROW(invalid_iterator::create(214, "cannot get value"));
+            }
+        }
+    }
+
+    /*!
+    @brief  return the key of an object iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    const typename object_t::key_type& key() const
+    {
+        assert(m_object != nullptr);
+
+        if (JSON_LIKELY(m_object->is_object()))
+        {
+            return m_it.object_iterator->first;
+        }
+
+        JSON_THROW(invalid_iterator::create(207, "cannot use key() for non-object iterators"));
+    }
+
+    /*!
+    @brief  return the value of an iterator
+    @pre The iterator is initialized; i.e. `m_object != nullptr`.
+    */
+    reference value() const
+    {
+        return operator*();
+    }
+
+  private:
+    /// associated JSON instance
+    pointer m_object = nullptr;
+    /// the actual iterator of the associated instance
+    internal_iterator<typename std::remove_const<BasicJsonType>::type> m_it;
+};
+}
+}
+
+// #include <nlohmann/detail/iterators/iteration_proxy.hpp>
+
+// #include <nlohmann/detail/iterators/json_reverse_iterator.hpp>
+
+
+#include <cstddef> // ptrdiff_t
+#include <iterator> // reverse_iterator
+#include <utility> // declval
+
+namespace nlohmann
+{
+namespace detail
+{
+//////////////////////
+// reverse_iterator //
+//////////////////////
+
+/*!
+@brief a template for a reverse iterator class
+
+@tparam Base the base iterator type to reverse. Valid types are @ref
+iterator (to create @ref reverse_iterator) and @ref const_iterator (to
+create @ref const_reverse_iterator).
+
+@requirement The class satisfies the following concept requirements:
+-
+[BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator):
+  The iterator that can be moved can be moved in both directions (i.e.
+  incremented and decremented).
+- [OutputIterator](https://en.cppreference.com/w/cpp/named_req/OutputIterator):
+  It is possible to write to the pointed-to element (only if @a Base is
+  @ref iterator).
+
+@since version 1.0.0
+*/
+template<typename Base>
+class json_reverse_iterator : public std::reverse_iterator<Base>
+{
+  public:
+    using difference_type = std::ptrdiff_t;
+    /// shortcut to the reverse iterator adapter
+    using base_iterator = std::reverse_iterator<Base>;
+    /// the reference type for the pointed-to element
+    using reference = typename Base::reference;
+
+    /// create reverse iterator from iterator
+    explicit json_reverse_iterator(const typename base_iterator::iterator_type& it) noexcept
+        : base_iterator(it) {}
+
+    /// create reverse iterator from base class
+    explicit json_reverse_iterator(const base_iterator& it) noexcept : base_iterator(it) {}
+
+    /// post-increment (it++)
+    json_reverse_iterator const operator++(int)
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator++(1));
+    }
+
+    /// pre-increment (++it)
+    json_reverse_iterator& operator++()
+    {
+        return static_cast<json_reverse_iterator&>(base_iterator::operator++());
+    }
+
+    /// post-decrement (it--)
+    json_reverse_iterator const operator--(int)
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator--(1));
+    }
+
+    /// pre-decrement (--it)
+    json_reverse_iterator& operator--()
+    {
+        return static_cast<json_reverse_iterator&>(base_iterator::operator--());
+    }
+
+    /// add to iterator
+    json_reverse_iterator& operator+=(difference_type i)
+    {
+        return static_cast<json_reverse_iterator&>(base_iterator::operator+=(i));
+    }
+
+    /// add to iterator
+    json_reverse_iterator operator+(difference_type i) const
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator+(i));
+    }
+
+    /// subtract from iterator
+    json_reverse_iterator operator-(difference_type i) const
+    {
+        return static_cast<json_reverse_iterator>(base_iterator::operator-(i));
+    }
+
+    /// return difference
+    difference_type operator-(const json_reverse_iterator& other) const
+    {
+        return base_iterator(*this) - base_iterator(other);
+    }
+
+    /// access to successor
+    reference operator[](difference_type n) const
+    {
+        return *(this->operator+(n));
+    }
+
+    /// return the key of an object iterator
+    auto key() const -> decltype(std::declval<Base>().key())
+    {
+        auto it = --this->base();
+        return it.key();
+    }
+
+    /// return the value of an iterator
+    reference value() const
+    {
+        auto it = --this->base();
+        return it.operator * ();
+    }
+};
+}
+}
+
+// #include <nlohmann/detail/output/output_adapters.hpp>
+
+
+#include <algorithm> // copy
+#include <cstddef> // size_t
+#include <ios> // streamsize
+#include <iterator> // back_inserter
+#include <memory> // shared_ptr, make_shared
+#include <ostream> // basic_ostream
+#include <string> // basic_string
+#include <vector> // vector
+
+namespace nlohmann
+{
+namespace detail
+{
+/// abstract output adapter interface
+template<typename CharType> struct output_adapter_protocol
+{
+    virtual void write_character(CharType c) = 0;
+    virtual void write_characters(const CharType* s, std::size_t length) = 0;
+    virtual ~output_adapter_protocol() = default;
+};
+
+/// a type to simplify interfaces
+template<typename CharType>
+using output_adapter_t = std::shared_ptr<output_adapter_protocol<CharType>>;
+
+/// output adapter for byte vectors
+template<typename CharType>
+class output_vector_adapter : public output_adapter_protocol<CharType>
+{
+  public:
+    explicit output_vector_adapter(std::vector<CharType>& vec) : v(vec) {}
+
+    void write_character(CharType c) override
+    {
+        v.push_back(c);
+    }
+
+    void write_characters(const CharType* s, std::size_t length) override
+    {
+        std::copy(s, s + length, std::back_inserter(v));
+    }
+
+  private:
+    std::vector<CharType>& v;
+};
+
+/// output adapter for output streams
+template<typename CharType>
+class output_stream_adapter : public output_adapter_protocol<CharType>
+{
+  public:
+    explicit output_stream_adapter(std::basic_ostream<CharType>& s) : stream(s) {}
+
+    void write_character(CharType c) override
+    {
+        stream.put(c);
+    }
+
+    void write_characters(const CharType* s, std::size_t length) override
+    {
+        stream.write(s, static_cast<std::streamsize>(length));
+    }
+
+  private:
+    std::basic_ostream<CharType>& stream;
+};
+
+/// output adapter for basic_string
+template<typename CharType, typename StringType = std::basic_string<CharType>>
+class output_string_adapter : public output_adapter_protocol<CharType>
+{
+  public:
+    explicit output_string_adapter(StringType& s) : str(s) {}
+
+    void write_character(CharType c) override
+    {
+        str.push_back(c);
+    }
+
+    void write_characters(const CharType* s, std::size_t length) override
+    {
+        str.append(s, length);
+    }
+
+  private:
+    StringType& str;
+};
+
+template<typename CharType, typename StringType = std::basic_string<CharType>>
+class output_adapter
+{
+  public:
+    output_adapter(std::vector<CharType>& vec)
+        : oa(std::make_shared<output_vector_adapter<CharType>>(vec)) {}
+
+    output_adapter(std::basic_ostream<CharType>& s)
+        : oa(std::make_shared<output_stream_adapter<CharType>>(s)) {}
+
+    output_adapter(StringType& s)
+        : oa(std::make_shared<output_string_adapter<CharType, StringType>>(s)) {}
+
+    operator output_adapter_t<CharType>()
+    {
+        return oa;
+    }
+
+  private:
+    output_adapter_t<CharType> oa = nullptr;
+};
+}
+}
+
+// #include <nlohmann/detail/input/binary_reader.hpp>
+
+
+#include <algorithm> // generate_n
+#include <array> // array
+#include <cassert> // assert
+#include <cmath> // ldexp
+#include <cstddef> // size_t
+#include <cstdint> // uint8_t, uint16_t, uint32_t, uint64_t
+#include <cstdio> // snprintf
+#include <cstring> // memcpy
+#include <iterator> // back_inserter
+#include <limits> // numeric_limits
+#include <string> // char_traits, string
+#include <utility> // make_pair, move
+
+// #include <nlohmann/detail/input/input_adapters.hpp>
+
+// #include <nlohmann/detail/input/json_sax.hpp>
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/is_sax.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+///////////////////
+// binary reader //
+///////////////////
+
+/*!
+@brief deserialization of CBOR, MessagePack, and UBJSON values
+*/
+template<typename BasicJsonType, typename SAX = json_sax_dom_parser<BasicJsonType>>
+class binary_reader
+{
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using string_t = typename BasicJsonType::string_t;
+    using json_sax_t = SAX;
+
+  public:
+    /*!
+    @brief create a binary reader
+
+    @param[in] adapter  input adapter to read from
+    */
+    explicit binary_reader(input_adapter_t adapter) : ia(std::move(adapter))
+    {
+        (void)detail::is_sax_static_asserts<SAX, BasicJsonType> {};
+        assert(ia);
+    }
+
+    /*!
+    @param[in] format  the binary format to parse
+    @param[in] sax_    a SAX event processor
+    @param[in] strict  whether to expect the input to be consumed completed
+
+    @return
+    */
+    bool sax_parse(const input_format_t format,
+                   json_sax_t* sax_,
+                   const bool strict = true)
+    {
+        sax = sax_;
+        bool result = false;
+
+        switch (format)
+        {
+            case input_format_t::cbor:
+                result = parse_cbor_internal();
+                break;
+
+            case input_format_t::msgpack:
+                result = parse_msgpack_internal();
+                break;
+
+            case input_format_t::ubjson:
+                result = parse_ubjson_internal();
+                break;
+
+            // LCOV_EXCL_START
+            default:
+                assert(false);
+                // LCOV_EXCL_STOP
+        }
+
+        // strict mode: next byte must be EOF
+        if (result and strict)
+        {
+            if (format == input_format_t::ubjson)
+            {
+                get_ignore_noop();
+            }
+            else
+            {
+                get();
+            }
+
+            if (JSON_UNLIKELY(current != std::char_traits<char>::eof()))
+            {
+                return sax->parse_error(chars_read, get_token_string(), parse_error::create(110, chars_read, "expected end of input"));
+            }
+        }
+
+        return result;
+    }
+
+    /*!
+    @brief determine system byte order
+
+    @return true if and only if system's byte order is little endian
+
+    @note from http://stackoverflow.com/a/1001328/266378
+    */
+    static constexpr bool little_endianess(int num = 1) noexcept
+    {
+        return (*reinterpret_cast<char*>(&num) == 1);
+    }
+
+  private:
+    /*!
+    @param[in] get_char  whether a new character should be retrieved from the
+                         input (true, default) or whether the last read
+                         character should be considered instead
+
+    @return whether a valid CBOR value was passed to the SAX parser
+    */
+    bool parse_cbor_internal(const bool get_char = true)
+    {
+        switch (get_char ? get() : current)
+        {
+            // EOF
+            case std::char_traits<char>::eof():
+                return unexpect_eof();
+
+            // Integer 0x00..0x17 (0..23)
+            case 0x00:
+            case 0x01:
+            case 0x02:
+            case 0x03:
+            case 0x04:
+            case 0x05:
+            case 0x06:
+            case 0x07:
+            case 0x08:
+            case 0x09:
+            case 0x0A:
+            case 0x0B:
+            case 0x0C:
+            case 0x0D:
+            case 0x0E:
+            case 0x0F:
+            case 0x10:
+            case 0x11:
+            case 0x12:
+            case 0x13:
+            case 0x14:
+            case 0x15:
+            case 0x16:
+            case 0x17:
+                return sax->number_unsigned(static_cast<number_unsigned_t>(current));
+
+            case 0x18: // Unsigned integer (one-byte uint8_t follows)
+            {
+                uint8_t number;
+                return get_number(number) and sax->number_unsigned(number);
+            }
+
+            case 0x19: // Unsigned integer (two-byte uint16_t follows)
+            {
+                uint16_t number;
+                return get_number(number) and sax->number_unsigned(number);
+            }
+
+            case 0x1A: // Unsigned integer (four-byte uint32_t follows)
+            {
+                uint32_t number;
+                return get_number(number) and sax->number_unsigned(number);
+            }
+
+            case 0x1B: // Unsigned integer (eight-byte uint64_t follows)
+            {
+                uint64_t number;
+                return get_number(number) and sax->number_unsigned(number);
+            }
+
+            // Negative integer -1-0x00..-1-0x17 (-1..-24)
+            case 0x20:
+            case 0x21:
+            case 0x22:
+            case 0x23:
+            case 0x24:
+            case 0x25:
+            case 0x26:
+            case 0x27:
+            case 0x28:
+            case 0x29:
+            case 0x2A:
+            case 0x2B:
+            case 0x2C:
+            case 0x2D:
+            case 0x2E:
+            case 0x2F:
+            case 0x30:
+            case 0x31:
+            case 0x32:
+            case 0x33:
+            case 0x34:
+            case 0x35:
+            case 0x36:
+            case 0x37:
+                return sax->number_integer(static_cast<int8_t>(0x20 - 1 - current));
+
+            case 0x38: // Negative integer (one-byte uint8_t follows)
+            {
+                uint8_t number;
+                return get_number(number) and sax->number_integer(static_cast<number_integer_t>(-1) - number);
+            }
+
+            case 0x39: // Negative integer -1-n (two-byte uint16_t follows)
+            {
+                uint16_t number;
+                return get_number(number) and sax->number_integer(static_cast<number_integer_t>(-1) - number);
+            }
+
+            case 0x3A: // Negative integer -1-n (four-byte uint32_t follows)
+            {
+                uint32_t number;
+                return get_number(number) and sax->number_integer(static_cast<number_integer_t>(-1) - number);
+            }
+
+            case 0x3B: // Negative integer -1-n (eight-byte uint64_t follows)
+            {
+                uint64_t number;
+                return get_number(number) and sax->number_integer(static_cast<number_integer_t>(-1)
+                        - static_cast<number_integer_t>(number));
+            }
+
+            // UTF-8 string (0x00..0x17 bytes follow)
+            case 0x60:
+            case 0x61:
+            case 0x62:
+            case 0x63:
+            case 0x64:
+            case 0x65:
+            case 0x66:
+            case 0x67:
+            case 0x68:
+            case 0x69:
+            case 0x6A:
+            case 0x6B:
+            case 0x6C:
+            case 0x6D:
+            case 0x6E:
+            case 0x6F:
+            case 0x70:
+            case 0x71:
+            case 0x72:
+            case 0x73:
+            case 0x74:
+            case 0x75:
+            case 0x76:
+            case 0x77:
+            case 0x78: // UTF-8 string (one-byte uint8_t for n follows)
+            case 0x79: // UTF-8 string (two-byte uint16_t for n follow)
+            case 0x7A: // UTF-8 string (four-byte uint32_t for n follow)
+            case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow)
+            case 0x7F: // UTF-8 string (indefinite length)
+            {
+                string_t s;
+                return get_cbor_string(s) and sax->string(s);
+            }
+
+            // array (0x00..0x17 data items follow)
+            case 0x80:
+            case 0x81:
+            case 0x82:
+            case 0x83:
+            case 0x84:
+            case 0x85:
+            case 0x86:
+            case 0x87:
+            case 0x88:
+            case 0x89:
+            case 0x8A:
+            case 0x8B:
+            case 0x8C:
+            case 0x8D:
+            case 0x8E:
+            case 0x8F:
+            case 0x90:
+            case 0x91:
+            case 0x92:
+            case 0x93:
+            case 0x94:
+            case 0x95:
+            case 0x96:
+            case 0x97:
+                return get_cbor_array(static_cast<std::size_t>(current & 0x1F));
+
+            case 0x98: // array (one-byte uint8_t for n follows)
+            {
+                uint8_t len;
+                return get_number(len) and get_cbor_array(static_cast<std::size_t>(len));
+            }
+
+            case 0x99: // array (two-byte uint16_t for n follow)
+            {
+                uint16_t len;
+                return get_number(len) and get_cbor_array(static_cast<std::size_t>(len));
+            }
+
+            case 0x9A: // array (four-byte uint32_t for n follow)
+            {
+                uint32_t len;
+                return get_number(len) and get_cbor_array(static_cast<std::size_t>(len));
+            }
+
+            case 0x9B: // array (eight-byte uint64_t for n follow)
+            {
+                uint64_t len;
+                return get_number(len) and get_cbor_array(static_cast<std::size_t>(len));
+            }
+
+            case 0x9F: // array (indefinite length)
+                return get_cbor_array(std::size_t(-1));
+
+            // map (0x00..0x17 pairs of data items follow)
+            case 0xA0:
+            case 0xA1:
+            case 0xA2:
+            case 0xA3:
+            case 0xA4:
+            case 0xA5:
+            case 0xA6:
+            case 0xA7:
+            case 0xA8:
+            case 0xA9:
+            case 0xAA:
+            case 0xAB:
+            case 0xAC:
+            case 0xAD:
+            case 0xAE:
+            case 0xAF:
+            case 0xB0:
+            case 0xB1:
+            case 0xB2:
+            case 0xB3:
+            case 0xB4:
+            case 0xB5:
+            case 0xB6:
+            case 0xB7:
+                return get_cbor_object(static_cast<std::size_t>(current & 0x1F));
+
+            case 0xB8: // map (one-byte uint8_t for n follows)
+            {
+                uint8_t len;
+                return get_number(len) and get_cbor_object(static_cast<std::size_t>(len));
+            }
+
+            case 0xB9: // map (two-byte uint16_t for n follow)
+            {
+                uint16_t len;
+                return get_number(len) and get_cbor_object(static_cast<std::size_t>(len));
+            }
+
+            case 0xBA: // map (four-byte uint32_t for n follow)
+            {
+                uint32_t len;
+                return get_number(len) and get_cbor_object(static_cast<std::size_t>(len));
+            }
+
+            case 0xBB: // map (eight-byte uint64_t for n follow)
+            {
+                uint64_t len;
+                return get_number(len) and get_cbor_object(static_cast<std::size_t>(len));
+            }
+
+            case 0xBF: // map (indefinite length)
+                return get_cbor_object(std::size_t(-1));
+
+            case 0xF4: // false
+                return sax->boolean(false);
+
+            case 0xF5: // true
+                return sax->boolean(true);
+
+            case 0xF6: // null
+                return sax->null();
+
+            case 0xF9: // Half-Precision Float (two-byte IEEE 754)
+            {
+                const int byte1 = get();
+                if (JSON_UNLIKELY(not unexpect_eof()))
+                {
+                    return false;
+                }
+                const int byte2 = get();
+                if (JSON_UNLIKELY(not unexpect_eof()))
+                {
+                    return false;
+                }
+
+                // code from RFC 7049, Appendix D, Figure 3:
+                // As half-precision floating-point numbers were only added
+                // to IEEE 754 in 2008, today's programming platforms often
+                // still only have limited support for them. It is very
+                // easy to include at least decoding support for them even
+                // without such support. An example of a small decoder for
+                // half-precision floating-point numbers in the C language
+                // is shown in Fig. 3.
+                const int half = (byte1 << 8) + byte2;
+                const double val = [&half]
+                {
+                    const int exp = (half >> 10) & 0x1F;
+                    const int mant = half & 0x3FF;
+                    assert(0 <= exp and exp <= 32);
+                    assert(0 <= mant and mant <= 1024);
+                    switch (exp)
+                    {
+                        case 0:
+                            return std::ldexp(mant, -24);
+                        case 31:
+                            return (mant == 0)
+                            ? std::numeric_limits<double>::infinity()
+                            : std::numeric_limits<double>::quiet_NaN();
+                        default:
+                            return std::ldexp(mant + 1024, exp - 25);
+                    }
+                }();
+                return sax->number_float((half & 0x8000) != 0
+                                         ? static_cast<number_float_t>(-val)
+                                         : static_cast<number_float_t>(val), "");
+            }
+
+            case 0xFA: // Single-Precision Float (four-byte IEEE 754)
+            {
+                float number;
+                return get_number(number) and sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0xFB: // Double-Precision Float (eight-byte IEEE 754)
+            {
+                double number;
+                return get_number(number) and sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            default: // anything else (0xFF is handled inside the other types)
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, "error reading CBOR; last byte: 0x" + last_token));
+            }
+        }
+    }
+
+    /*!
+    @return whether a valid MessagePack value was passed to the SAX parser
+    */
+    bool parse_msgpack_internal()
+    {
+        switch (get())
+        {
+            // EOF
+            case std::char_traits<char>::eof():
+                return unexpect_eof();
+
+            // positive fixint
+            case 0x00:
+            case 0x01:
+            case 0x02:
+            case 0x03:
+            case 0x04:
+            case 0x05:
+            case 0x06:
+            case 0x07:
+            case 0x08:
+            case 0x09:
+            case 0x0A:
+            case 0x0B:
+            case 0x0C:
+            case 0x0D:
+            case 0x0E:
+            case 0x0F:
+            case 0x10:
+            case 0x11:
+            case 0x12:
+            case 0x13:
+            case 0x14:
+            case 0x15:
+            case 0x16:
+            case 0x17:
+            case 0x18:
+            case 0x19:
+            case 0x1A:
+            case 0x1B:
+            case 0x1C:
+            case 0x1D:
+            case 0x1E:
+            case 0x1F:
+            case 0x20:
+            case 0x21:
+            case 0x22:
+            case 0x23:
+            case 0x24:
+            case 0x25:
+            case 0x26:
+            case 0x27:
+            case 0x28:
+            case 0x29:
+            case 0x2A:
+            case 0x2B:
+            case 0x2C:
+            case 0x2D:
+            case 0x2E:
+            case 0x2F:
+            case 0x30:
+            case 0x31:
+            case 0x32:
+            case 0x33:
+            case 0x34:
+            case 0x35:
+            case 0x36:
+            case 0x37:
+            case 0x38:
+            case 0x39:
+            case 0x3A:
+            case 0x3B:
+            case 0x3C:
+            case 0x3D:
+            case 0x3E:
+            case 0x3F:
+            case 0x40:
+            case 0x41:
+            case 0x42:
+            case 0x43:
+            case 0x44:
+            case 0x45:
+            case 0x46:
+            case 0x47:
+            case 0x48:
+            case 0x49:
+            case 0x4A:
+            case 0x4B:
+            case 0x4C:
+            case 0x4D:
+            case 0x4E:
+            case 0x4F:
+            case 0x50:
+            case 0x51:
+            case 0x52:
+            case 0x53:
+            case 0x54:
+            case 0x55:
+            case 0x56:
+            case 0x57:
+            case 0x58:
+            case 0x59:
+            case 0x5A:
+            case 0x5B:
+            case 0x5C:
+            case 0x5D:
+            case 0x5E:
+            case 0x5F:
+            case 0x60:
+            case 0x61:
+            case 0x62:
+            case 0x63:
+            case 0x64:
+            case 0x65:
+            case 0x66:
+            case 0x67:
+            case 0x68:
+            case 0x69:
+            case 0x6A:
+            case 0x6B:
+            case 0x6C:
+            case 0x6D:
+            case 0x6E:
+            case 0x6F:
+            case 0x70:
+            case 0x71:
+            case 0x72:
+            case 0x73:
+            case 0x74:
+            case 0x75:
+            case 0x76:
+            case 0x77:
+            case 0x78:
+            case 0x79:
+            case 0x7A:
+            case 0x7B:
+            case 0x7C:
+            case 0x7D:
+            case 0x7E:
+            case 0x7F:
+                return sax->number_unsigned(static_cast<number_unsigned_t>(current));
+
+            // fixmap
+            case 0x80:
+            case 0x81:
+            case 0x82:
+            case 0x83:
+            case 0x84:
+            case 0x85:
+            case 0x86:
+            case 0x87:
+            case 0x88:
+            case 0x89:
+            case 0x8A:
+            case 0x8B:
+            case 0x8C:
+            case 0x8D:
+            case 0x8E:
+            case 0x8F:
+                return get_msgpack_object(static_cast<std::size_t>(current & 0x0F));
+
+            // fixarray
+            case 0x90:
+            case 0x91:
+            case 0x92:
+            case 0x93:
+            case 0x94:
+            case 0x95:
+            case 0x96:
+            case 0x97:
+            case 0x98:
+            case 0x99:
+            case 0x9A:
+            case 0x9B:
+            case 0x9C:
+            case 0x9D:
+            case 0x9E:
+            case 0x9F:
+                return get_msgpack_array(static_cast<std::size_t>(current & 0x0F));
+
+            // fixstr
+            case 0xA0:
+            case 0xA1:
+            case 0xA2:
+            case 0xA3:
+            case 0xA4:
+            case 0xA5:
+            case 0xA6:
+            case 0xA7:
+            case 0xA8:
+            case 0xA9:
+            case 0xAA:
+            case 0xAB:
+            case 0xAC:
+            case 0xAD:
+            case 0xAE:
+            case 0xAF:
+            case 0xB0:
+            case 0xB1:
+            case 0xB2:
+            case 0xB3:
+            case 0xB4:
+            case 0xB5:
+            case 0xB6:
+            case 0xB7:
+            case 0xB8:
+            case 0xB9:
+            case 0xBA:
+            case 0xBB:
+            case 0xBC:
+            case 0xBD:
+            case 0xBE:
+            case 0xBF:
+            {
+                string_t s;
+                return get_msgpack_string(s) and sax->string(s);
+            }
+
+            case 0xC0: // nil
+                return sax->null();
+
+            case 0xC2: // false
+                return sax->boolean(false);
+
+            case 0xC3: // true
+                return sax->boolean(true);
+
+            case 0xCA: // float 32
+            {
+                float number;
+                return get_number(number) and sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0xCB: // float 64
+            {
+                double number;
+                return get_number(number) and sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 0xCC: // uint 8
+            {
+                uint8_t number;
+                return get_number(number) and sax->number_unsigned(number);
+            }
+
+            case 0xCD: // uint 16
+            {
+                uint16_t number;
+                return get_number(number) and sax->number_unsigned(number);
+            }
+
+            case 0xCE: // uint 32
+            {
+                uint32_t number;
+                return get_number(number) and sax->number_unsigned(number);
+            }
+
+            case 0xCF: // uint 64
+            {
+                uint64_t number;
+                return get_number(number) and sax->number_unsigned(number);
+            }
+
+            case 0xD0: // int 8
+            {
+                int8_t number;
+                return get_number(number) and sax->number_integer(number);
+            }
+
+            case 0xD1: // int 16
+            {
+                int16_t number;
+                return get_number(number) and sax->number_integer(number);
+            }
+
+            case 0xD2: // int 32
+            {
+                int32_t number;
+                return get_number(number) and sax->number_integer(number);
+            }
+
+            case 0xD3: // int 64
+            {
+                int64_t number;
+                return get_number(number) and sax->number_integer(number);
+            }
+
+            case 0xD9: // str 8
+            case 0xDA: // str 16
+            case 0xDB: // str 32
+            {
+                string_t s;
+                return get_msgpack_string(s) and sax->string(s);
+            }
+
+            case 0xDC: // array 16
+            {
+                uint16_t len;
+                return get_number(len) and get_msgpack_array(static_cast<std::size_t>(len));
+            }
+
+            case 0xDD: // array 32
+            {
+                uint32_t len;
+                return get_number(len) and get_msgpack_array(static_cast<std::size_t>(len));
+            }
+
+            case 0xDE: // map 16
+            {
+                uint16_t len;
+                return get_number(len) and get_msgpack_object(static_cast<std::size_t>(len));
+            }
+
+            case 0xDF: // map 32
+            {
+                uint32_t len;
+                return get_number(len) and get_msgpack_object(static_cast<std::size_t>(len));
+            }
+
+            // negative fixint
+            case 0xE0:
+            case 0xE1:
+            case 0xE2:
+            case 0xE3:
+            case 0xE4:
+            case 0xE5:
+            case 0xE6:
+            case 0xE7:
+            case 0xE8:
+            case 0xE9:
+            case 0xEA:
+            case 0xEB:
+            case 0xEC:
+            case 0xED:
+            case 0xEE:
+            case 0xEF:
+            case 0xF0:
+            case 0xF1:
+            case 0xF2:
+            case 0xF3:
+            case 0xF4:
+            case 0xF5:
+            case 0xF6:
+            case 0xF7:
+            case 0xF8:
+            case 0xF9:
+            case 0xFA:
+            case 0xFB:
+            case 0xFC:
+            case 0xFD:
+            case 0xFE:
+            case 0xFF:
+                return sax->number_integer(static_cast<int8_t>(current));
+
+            default: // anything else
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, "error reading MessagePack; last byte: 0x" + last_token));
+            }
+        }
+    }
+
+    /*!
+    @param[in] get_char  whether a new character should be retrieved from the
+                         input (true, default) or whether the last read
+                         character should be considered instead
+
+    @return whether a valid UBJSON value was passed to the SAX parser
+    */
+    bool parse_ubjson_internal(const bool get_char = true)
+    {
+        return get_ubjson_value(get_char ? get_ignore_noop() : current);
+    }
+
+    /*!
+    @brief get next character from the input
+
+    This function provides the interface to the used input adapter. It does
+    not throw in case the input reached EOF, but returns a -'ve valued
+    `std::char_traits<char>::eof()` in that case.
+
+    @return character read from the input
+    */
+    int get()
+    {
+        ++chars_read;
+        return (current = ia->get_character());
+    }
+
+    /*!
+    @return character read from the input after ignoring all 'N' entries
+    */
+    int get_ignore_noop()
+    {
+        do
+        {
+            get();
+        }
+        while (current == 'N');
+
+        return current;
+    }
+
+    /*
+    @brief read a number from the input
+
+    @tparam NumberType the type of the number
+    @param[out] result  number of type @a NumberType
+
+    @return whether conversion completed
+
+    @note This function needs to respect the system's endianess, because
+          bytes in CBOR, MessagePack, and UBJSON are stored in network order
+          (big endian) and therefore need reordering on little endian systems.
+    */
+    template<typename NumberType>
+    bool get_number(NumberType& result)
+    {
+        // step 1: read input into array with system's byte order
+        std::array<uint8_t, sizeof(NumberType)> vec;
+        for (std::size_t i = 0; i < sizeof(NumberType); ++i)
+        {
+            get();
+            if (JSON_UNLIKELY(not unexpect_eof()))
+            {
+                return false;
+            }
+
+            // reverse byte order prior to conversion if necessary
+            if (is_little_endian)
+            {
+                vec[sizeof(NumberType) - i - 1] = static_cast<uint8_t>(current);
+            }
+            else
+            {
+                vec[i] = static_cast<uint8_t>(current); // LCOV_EXCL_LINE
+            }
+        }
+
+        // step 2: convert array into number of type T and return
+        std::memcpy(&result, vec.data(), sizeof(NumberType));
+        return true;
+    }
+
+    /*!
+    @brief create a string by reading characters from the input
+
+    @tparam NumberType the type of the number
+    @param[in] len number of characters to read
+    @param[out] string created by reading @a len bytes
+
+    @return whether string creation completed
+
+    @note We can not reserve @a len bytes for the result, because @a len
+          may be too large. Usually, @ref unexpect_eof() detects the end of
+          the input before we run out of string memory.
+    */
+    template<typename NumberType>
+    bool get_string(const NumberType len, string_t& result)
+    {
+        bool success = true;
+        std::generate_n(std::back_inserter(result), len, [this, &success]()
+        {
+            get();
+            if (JSON_UNLIKELY(not unexpect_eof()))
+            {
+                success = false;
+            }
+            return static_cast<char>(current);
+        });
+        return success;
+    }
+
+    /*!
+    @brief reads a CBOR string
+
+    This function first reads starting bytes to determine the expected
+    string length and then copies this number of bytes into a string.
+    Additionally, CBOR's strings with indefinite lengths are supported.
+
+    @param[out] result  created string
+
+    @return whether string creation completed
+    */
+    bool get_cbor_string(string_t& result)
+    {
+        if (JSON_UNLIKELY(not unexpect_eof()))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            // UTF-8 string (0x00..0x17 bytes follow)
+            case 0x60:
+            case 0x61:
+            case 0x62:
+            case 0x63:
+            case 0x64:
+            case 0x65:
+            case 0x66:
+            case 0x67:
+            case 0x68:
+            case 0x69:
+            case 0x6A:
+            case 0x6B:
+            case 0x6C:
+            case 0x6D:
+            case 0x6E:
+            case 0x6F:
+            case 0x70:
+            case 0x71:
+            case 0x72:
+            case 0x73:
+            case 0x74:
+            case 0x75:
+            case 0x76:
+            case 0x77:
+            {
+                return get_string(current & 0x1F, result);
+            }
+
+            case 0x78: // UTF-8 string (one-byte uint8_t for n follows)
+            {
+                uint8_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 0x79: // UTF-8 string (two-byte uint16_t for n follow)
+            {
+                uint16_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 0x7A: // UTF-8 string (four-byte uint32_t for n follow)
+            {
+                uint32_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 0x7B: // UTF-8 string (eight-byte uint64_t for n follow)
+            {
+                uint64_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 0x7F: // UTF-8 string (indefinite length)
+            {
+                while (get() != 0xFF)
+                {
+                    string_t chunk;
+                    if (not get_cbor_string(chunk))
+                    {
+                        return false;
+                    }
+                    result.append(chunk);
+                }
+                return true;
+            }
+
+            default:
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, "expected a CBOR string; last byte: 0x" + last_token));
+            }
+        }
+    }
+
+    /*!
+    @param[in] len  the length of the array or std::size_t(-1) for an
+                    array of indefinite size
+    @return whether array creation completed
+    */
+    bool get_cbor_array(const std::size_t len)
+    {
+        if (JSON_UNLIKELY(not sax->start_array(len)))
+        {
+            return false;
+        }
+
+        if (len != std::size_t(-1))
+            for (std::size_t i = 0; i < len; ++i)
+            {
+                if (JSON_UNLIKELY(not parse_cbor_internal()))
+                {
+                    return false;
+                }
+            }
+        else
+        {
+            while (get() != 0xFF)
+            {
+                if (JSON_UNLIKELY(not parse_cbor_internal(false)))
+                {
+                    return false;
+                }
+            }
+        }
+
+        return sax->end_array();
+    }
+
+    /*!
+    @param[in] len  the length of the object or std::size_t(-1) for an
+                    object of indefinite size
+    @return whether object creation completed
+    */
+    bool get_cbor_object(const std::size_t len)
+    {
+        if (not JSON_UNLIKELY(sax->start_object(len)))
+        {
+            return false;
+        }
+
+        string_t key;
+        if (len != std::size_t(-1))
+        {
+            for (std::size_t i = 0; i < len; ++i)
+            {
+                get();
+                if (JSON_UNLIKELY(not get_cbor_string(key) or not sax->key(key)))
+                {
+                    return false;
+                }
+
+                if (JSON_UNLIKELY(not parse_cbor_internal()))
+                {
+                    return false;
+                }
+                key.clear();
+            }
+        }
+        else
+        {
+            while (get() != 0xFF)
+            {
+                if (JSON_UNLIKELY(not get_cbor_string(key) or not sax->key(key)))
+                {
+                    return false;
+                }
+
+                if (JSON_UNLIKELY(not parse_cbor_internal()))
+                {
+                    return false;
+                }
+                key.clear();
+            }
+        }
+
+        return sax->end_object();
+    }
+
+    /*!
+    @brief reads a MessagePack string
+
+    This function first reads starting bytes to determine the expected
+    string length and then copies this number of bytes into a string.
+
+    @param[out] result  created string
+
+    @return whether string creation completed
+    */
+    bool get_msgpack_string(string_t& result)
+    {
+        if (JSON_UNLIKELY(not unexpect_eof()))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            // fixstr
+            case 0xA0:
+            case 0xA1:
+            case 0xA2:
+            case 0xA3:
+            case 0xA4:
+            case 0xA5:
+            case 0xA6:
+            case 0xA7:
+            case 0xA8:
+            case 0xA9:
+            case 0xAA:
+            case 0xAB:
+            case 0xAC:
+            case 0xAD:
+            case 0xAE:
+            case 0xAF:
+            case 0xB0:
+            case 0xB1:
+            case 0xB2:
+            case 0xB3:
+            case 0xB4:
+            case 0xB5:
+            case 0xB6:
+            case 0xB7:
+            case 0xB8:
+            case 0xB9:
+            case 0xBA:
+            case 0xBB:
+            case 0xBC:
+            case 0xBD:
+            case 0xBE:
+            case 0xBF:
+            {
+                return get_string(current & 0x1F, result);
+            }
+
+            case 0xD9: // str 8
+            {
+                uint8_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 0xDA: // str 16
+            {
+                uint16_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 0xDB: // str 32
+            {
+                uint32_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            default:
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, "expected a MessagePack string; last byte: 0x" + last_token));
+            }
+        }
+    }
+
+    /*!
+    @param[in] len  the length of the array
+    @return whether array creation completed
+    */
+    bool get_msgpack_array(const std::size_t len)
+    {
+        if (JSON_UNLIKELY(not sax->start_array(len)))
+        {
+            return false;
+        }
+
+        for (std::size_t i = 0; i < len; ++i)
+        {
+            if (JSON_UNLIKELY(not parse_msgpack_internal()))
+            {
+                return false;
+            }
+        }
+
+        return sax->end_array();
+    }
+
+    /*!
+    @param[in] len  the length of the object
+    @return whether object creation completed
+    */
+    bool get_msgpack_object(const std::size_t len)
+    {
+        if (JSON_UNLIKELY(not sax->start_object(len)))
+        {
+            return false;
+        }
+
+        string_t key;
+        for (std::size_t i = 0; i < len; ++i)
+        {
+            get();
+            if (JSON_UNLIKELY(not get_msgpack_string(key) or not sax->key(key)))
+            {
+                return false;
+            }
+
+            if (JSON_UNLIKELY(not parse_msgpack_internal()))
+            {
+                return false;
+            }
+            key.clear();
+        }
+
+        return sax->end_object();
+    }
+
+    /*!
+    @brief reads a UBJSON string
+
+    This function is either called after reading the 'S' byte explicitly
+    indicating a string, or in case of an object key where the 'S' byte can be
+    left out.
+
+    @param[out] result   created string
+    @param[in] get_char  whether a new character should be retrieved from the
+                         input (true, default) or whether the last read
+                         character should be considered instead
+
+    @return whether string creation completed
+    */
+    bool get_ubjson_string(string_t& result, const bool get_char = true)
+    {
+        if (get_char)
+        {
+            get();  // TODO: may we ignore N here?
+        }
+
+        if (JSON_UNLIKELY(not unexpect_eof()))
+        {
+            return false;
+        }
+
+        switch (current)
+        {
+            case 'U':
+            {
+                uint8_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 'i':
+            {
+                int8_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 'I':
+            {
+                int16_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 'l':
+            {
+                int32_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            case 'L':
+            {
+                int64_t len;
+                return get_number(len) and get_string(len, result);
+            }
+
+            default:
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, "expected a UBJSON string; last byte: 0x" + last_token));
+        }
+    }
+
+    /*!
+    @param[out] result  determined size
+    @return whether size determination completed
+    */
+    bool get_ubjson_size_value(std::size_t& result)
+    {
+        switch (get_ignore_noop())
+        {
+            case 'U':
+            {
+                uint8_t number;
+                if (JSON_UNLIKELY(not get_number(number)))
+                {
+                    return false;
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'i':
+            {
+                int8_t number;
+                if (JSON_UNLIKELY(not get_number(number)))
+                {
+                    return false;
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'I':
+            {
+                int16_t number;
+                if (JSON_UNLIKELY(not get_number(number)))
+                {
+                    return false;
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'l':
+            {
+                int32_t number;
+                if (JSON_UNLIKELY(not get_number(number)))
+                {
+                    return false;
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            case 'L':
+            {
+                int64_t number;
+                if (JSON_UNLIKELY(not get_number(number)))
+                {
+                    return false;
+                }
+                result = static_cast<std::size_t>(number);
+                return true;
+            }
+
+            default:
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, "byte after '#' must denote a number type; last byte: 0x" + last_token));
+            }
+        }
+    }
+
+    /*!
+    @brief determine the type and size for a container
+
+    In the optimized UBJSON format, a type and a size can be provided to allow
+    for a more compact representation.
+
+    @param[out] result  pair of the size and the type
+
+    @return whether pair creation completed
+    */
+    bool get_ubjson_size_type(std::pair<std::size_t, int>& result)
+    {
+        result.first = string_t::npos; // size
+        result.second = 0; // type
+
+        get_ignore_noop();
+
+        if (current == '$')
+        {
+            result.second = get();  // must not ignore 'N', because 'N' maybe the type
+            if (JSON_UNLIKELY(not unexpect_eof()))
+            {
+                return false;
+            }
+
+            get_ignore_noop();
+            if (JSON_UNLIKELY(current != '#'))
+            {
+                if (JSON_UNLIKELY(not unexpect_eof()))
+                {
+                    return false;
+                }
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, "expected '#' after UBJSON type information; last byte: 0x" + last_token));
+            }
+
+            return get_ubjson_size_value(result.first);
+        }
+        else if (current == '#')
+        {
+            return get_ubjson_size_value(result.first);
+        }
+        return true;
+    }
+
+    /*!
+    @param prefix  the previously read or set type prefix
+    @return whether value creation completed
+    */
+    bool get_ubjson_value(const int prefix)
+    {
+        switch (prefix)
+        {
+            case std::char_traits<char>::eof():  // EOF
+                return unexpect_eof();
+
+            case 'T':  // true
+                return sax->boolean(true);
+            case 'F':  // false
+                return sax->boolean(false);
+
+            case 'Z':  // null
+                return sax->null();
+
+            case 'U':
+            {
+                uint8_t number;
+                return get_number(number) and sax->number_unsigned(number);
+            }
+
+            case 'i':
+            {
+                int8_t number;
+                return get_number(number) and sax->number_integer(number);
+            }
+
+            case 'I':
+            {
+                int16_t number;
+                return get_number(number) and sax->number_integer(number);
+            }
+
+            case 'l':
+            {
+                int32_t number;
+                return get_number(number) and sax->number_integer(number);
+            }
+
+            case 'L':
+            {
+                int64_t number;
+                return get_number(number) and sax->number_integer(number);
+            }
+
+            case 'd':
+            {
+                float number;
+                return get_number(number) and sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 'D':
+            {
+                double number;
+                return get_number(number) and sax->number_float(static_cast<number_float_t>(number), "");
+            }
+
+            case 'C':  // char
+            {
+                get();
+                if (JSON_UNLIKELY(not unexpect_eof()))
+                {
+                    return false;
+                }
+                if (JSON_UNLIKELY(current > 127))
+                {
+                    auto last_token = get_token_string();
+                    return sax->parse_error(chars_read, last_token, parse_error::create(113, chars_read, "byte after 'C' must be in range 0x00..0x7F; last byte: 0x" + last_token));
+                }
+                string_t s(1, static_cast<char>(current));
+                return sax->string(s);
+            }
+
+            case 'S':  // string
+            {
+                string_t s;
+                return get_ubjson_string(s) and sax->string(s);
+            }
+
+            case '[':  // array
+                return get_ubjson_array();
+
+            case '{':  // object
+                return get_ubjson_object();
+
+            default: // anything else
+            {
+                auto last_token = get_token_string();
+                return sax->parse_error(chars_read, last_token, parse_error::create(112, chars_read, "error reading UBJSON; last byte: 0x" + last_token));
+            }
+        }
+    }
+
+    /*!
+    @return whether array creation completed
+    */
+    bool get_ubjson_array()
+    {
+        std::pair<std::size_t, int> size_and_type;
+        if (JSON_UNLIKELY(not get_ubjson_size_type(size_and_type)))
+        {
+            return false;
+        }
+
+        if (size_and_type.first != string_t::npos)
+        {
+            if (JSON_UNLIKELY(not sax->start_array(size_and_type.first)))
+            {
+                return false;
+            }
+
+            if (size_and_type.second != 0)
+            {
+                if (size_and_type.second != 'N')
+                {
+                    for (std::size_t i = 0; i < size_and_type.first; ++i)
+                    {
+                        if (JSON_UNLIKELY(not get_ubjson_value(size_and_type.second)))
+                        {
+                            return false;
+                        }
+                    }
+                }
+            }
+            else
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_UNLIKELY(not parse_ubjson_internal()))
+                    {
+                        return false;
+                    }
+                }
+            }
+        }
+        else
+        {
+            if (JSON_UNLIKELY(not sax->start_array(std::size_t(-1))))
+            {
+                return false;
+            }
+
+            while (current != ']')
+            {
+                if (JSON_UNLIKELY(not parse_ubjson_internal(false)))
+                {
+                    return false;
+                }
+                get_ignore_noop();
+            }
+        }
+
+        return sax->end_array();
+    }
+
+    /*!
+    @return whether object creation completed
+    */
+    bool get_ubjson_object()
+    {
+        std::pair<std::size_t, int> size_and_type;
+        if (JSON_UNLIKELY(not get_ubjson_size_type(size_and_type)))
+        {
+            return false;
+        }
+
+        string_t key;
+        if (size_and_type.first != string_t::npos)
+        {
+            if (JSON_UNLIKELY(not sax->start_object(size_and_type.first)))
+            {
+                return false;
+            }
+
+            if (size_and_type.second != 0)
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_UNLIKELY(not get_ubjson_string(key) or not sax->key(key)))
+                    {
+                        return false;
+                    }
+                    if (JSON_UNLIKELY(not get_ubjson_value(size_and_type.second)))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+            else
+            {
+                for (std::size_t i = 0; i < size_and_type.first; ++i)
+                {
+                    if (JSON_UNLIKELY(not get_ubjson_string(key) or not sax->key(key)))
+                    {
+                        return false;
+                    }
+                    if (JSON_UNLIKELY(not parse_ubjson_internal()))
+                    {
+                        return false;
+                    }
+                    key.clear();
+                }
+            }
+        }
+        else
+        {
+            if (JSON_UNLIKELY(not sax->start_object(std::size_t(-1))))
+            {
+                return false;
+            }
+
+            while (current != '}')
+            {
+                if (JSON_UNLIKELY(not get_ubjson_string(key, false) or not sax->key(key)))
+                {
+                    return false;
+                }
+                if (JSON_UNLIKELY(not parse_ubjson_internal()))
+                {
+                    return false;
+                }
+                get_ignore_noop();
+                key.clear();
+            }
+        }
+
+        return sax->end_object();
+    }
+
+    /*!
+    @return whether the last read character is not EOF
+    */
+    bool unexpect_eof() const
+    {
+        if (JSON_UNLIKELY(current == std::char_traits<char>::eof()))
+        {
+            return sax->parse_error(chars_read, "<end of file>", parse_error::create(110, chars_read, "unexpected end of input"));
+        }
+        return true;
+    }
+
+    /*!
+    @return a string representation of the last read byte
+    */
+    std::string get_token_string() const
+    {
+        char cr[3];
+        snprintf(cr, 3, "%.2hhX", static_cast<unsigned char>(current));
+        return std::string{cr};
+    }
+
+  private:
+    /// input adapter
+    input_adapter_t ia = nullptr;
+
+    /// the current character
+    int current = std::char_traits<char>::eof();
+
+    /// the number of characters read
+    std::size_t chars_read = 0;
+
+    /// whether we can assume little endianess
+    const bool is_little_endian = little_endianess();
+
+    /// the SAX parser
+    json_sax_t* sax = nullptr;
+};
+}
+}
+
+// #include <nlohmann/detail/output/binary_writer.hpp>
+
+
+#include <algorithm> // reverse
+#include <array> // array
+#include <cstdint> // uint8_t, uint16_t, uint32_t, uint64_t
+#include <cstring> // memcpy
+#include <limits> // numeric_limits
+
+// #include <nlohmann/detail/input/binary_reader.hpp>
+
+// #include <nlohmann/detail/output/output_adapters.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+///////////////////
+// binary writer //
+///////////////////
+
+/*!
+@brief serialization to CBOR and MessagePack values
+*/
+template<typename BasicJsonType, typename CharType>
+class binary_writer
+{
+  public:
+    /*!
+    @brief create a binary writer
+
+    @param[in] adapter  output adapter to write to
+    */
+    explicit binary_writer(output_adapter_t<CharType> adapter) : oa(adapter)
+    {
+        assert(oa);
+    }
+
+    /*!
+    @brief[in] j  JSON value to serialize
+    */
+    void write_cbor(const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::null:
+            {
+                oa->write_character(static_cast<CharType>(0xF6));
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                oa->write_character(j.m_value.boolean
+                                    ? static_cast<CharType>(0xF5)
+                                    : static_cast<CharType>(0xF4));
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                if (j.m_value.number_integer >= 0)
+                {
+                    // CBOR does not differentiate between positive signed
+                    // integers and unsigned integers. Therefore, we used the
+                    // code from the value_t::number_unsigned case here.
+                    if (j.m_value.number_integer <= 0x17)
+                    {
+                        write_number(static_cast<uint8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer <= (std::numeric_limits<uint8_t>::max)())
+                    {
+                        oa->write_character(static_cast<CharType>(0x18));
+                        write_number(static_cast<uint8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer <= (std::numeric_limits<uint16_t>::max)())
+                    {
+                        oa->write_character(static_cast<CharType>(0x19));
+                        write_number(static_cast<uint16_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer <= (std::numeric_limits<uint32_t>::max)())
+                    {
+                        oa->write_character(static_cast<CharType>(0x1A));
+                        write_number(static_cast<uint32_t>(j.m_value.number_integer));
+                    }
+                    else
+                    {
+                        oa->write_character(static_cast<CharType>(0x1B));
+                        write_number(static_cast<uint64_t>(j.m_value.number_integer));
+                    }
+                }
+                else
+                {
+                    // The conversions below encode the sign in the first
+                    // byte, and the value is converted to a positive number.
+                    const auto positive_number = -1 - j.m_value.number_integer;
+                    if (j.m_value.number_integer >= -24)
+                    {
+                        write_number(static_cast<uint8_t>(0x20 + positive_number));
+                    }
+                    else if (positive_number <= (std::numeric_limits<uint8_t>::max)())
+                    {
+                        oa->write_character(static_cast<CharType>(0x38));
+                        write_number(static_cast<uint8_t>(positive_number));
+                    }
+                    else if (positive_number <= (std::numeric_limits<uint16_t>::max)())
+                    {
+                        oa->write_character(static_cast<CharType>(0x39));
+                        write_number(static_cast<uint16_t>(positive_number));
+                    }
+                    else if (positive_number <= (std::numeric_limits<uint32_t>::max)())
+                    {
+                        oa->write_character(static_cast<CharType>(0x3A));
+                        write_number(static_cast<uint32_t>(positive_number));
+                    }
+                    else
+                    {
+                        oa->write_character(static_cast<CharType>(0x3B));
+                        write_number(static_cast<uint64_t>(positive_number));
+                    }
+                }
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                if (j.m_value.number_unsigned <= 0x17)
+                {
+                    write_number(static_cast<uint8_t>(j.m_value.number_unsigned));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<uint8_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x18));
+                    write_number(static_cast<uint8_t>(j.m_value.number_unsigned));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<uint16_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x19));
+                    write_number(static_cast<uint16_t>(j.m_value.number_unsigned));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<uint32_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x1A));
+                    write_number(static_cast<uint32_t>(j.m_value.number_unsigned));
+                }
+                else
+                {
+                    oa->write_character(static_cast<CharType>(0x1B));
+                    write_number(static_cast<uint64_t>(j.m_value.number_unsigned));
+                }
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                oa->write_character(get_cbor_float_prefix(j.m_value.number_float));
+                write_number(j.m_value.number_float);
+                break;
+            }
+
+            case value_t::string:
+            {
+                // step 1: write control byte and the string length
+                const auto N = j.m_value.string->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<uint8_t>(0x60 + N));
+                }
+                else if (N <= (std::numeric_limits<uint8_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x78));
+                    write_number(static_cast<uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint16_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x79));
+                    write_number(static_cast<uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint32_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x7A));
+                    write_number(static_cast<uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<uint64_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x7B));
+                    write_number(static_cast<uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write the string
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_value.string->c_str()),
+                    j.m_value.string->size());
+                break;
+            }
+
+            case value_t::array:
+            {
+                // step 1: write control byte and the array size
+                const auto N = j.m_value.array->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<uint8_t>(0x80 + N));
+                }
+                else if (N <= (std::numeric_limits<uint8_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x98));
+                    write_number(static_cast<uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint16_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x99));
+                    write_number(static_cast<uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint32_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x9A));
+                    write_number(static_cast<uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<uint64_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0x9B));
+                    write_number(static_cast<uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write each element
+                for (const auto& el : *j.m_value.array)
+                {
+                    write_cbor(el);
+                }
+                break;
+            }
+
+            case value_t::object:
+            {
+                // step 1: write control byte and the object size
+                const auto N = j.m_value.object->size();
+                if (N <= 0x17)
+                {
+                    write_number(static_cast<uint8_t>(0xA0 + N));
+                }
+                else if (N <= (std::numeric_limits<uint8_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0xB8));
+                    write_number(static_cast<uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint16_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0xB9));
+                    write_number(static_cast<uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint32_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0xBA));
+                    write_number(static_cast<uint32_t>(N));
+                }
+                // LCOV_EXCL_START
+                else if (N <= (std::numeric_limits<uint64_t>::max)())
+                {
+                    oa->write_character(static_cast<CharType>(0xBB));
+                    write_number(static_cast<uint64_t>(N));
+                }
+                // LCOV_EXCL_STOP
+
+                // step 2: write each element
+                for (const auto& el : *j.m_value.object)
+                {
+                    write_cbor(el.first);
+                    write_cbor(el.second);
+                }
+                break;
+            }
+
+            default:
+                break;
+        }
+    }
+
+    /*!
+    @brief[in] j  JSON value to serialize
+    */
+    void write_msgpack(const BasicJsonType& j)
+    {
+        switch (j.type())
+        {
+            case value_t::null: // nil
+            {
+                oa->write_character(static_cast<CharType>(0xC0));
+                break;
+            }
+
+            case value_t::boolean: // true and false
+            {
+                oa->write_character(j.m_value.boolean
+                                    ? static_cast<CharType>(0xC3)
+                                    : static_cast<CharType>(0xC2));
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                if (j.m_value.number_integer >= 0)
+                {
+                    // MessagePack does not differentiate between positive
+                    // signed integers and unsigned integers. Therefore, we used
+                    // the code from the value_t::number_unsigned case here.
+                    if (j.m_value.number_unsigned < 128)
+                    {
+                        // positive fixnum
+                        write_number(static_cast<uint8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_unsigned <= (std::numeric_limits<uint8_t>::max)())
+                    {
+                        // uint 8
+                        oa->write_character(static_cast<CharType>(0xCC));
+                        write_number(static_cast<uint8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_unsigned <= (std::numeric_limits<uint16_t>::max)())
+                    {
+                        // uint 16
+                        oa->write_character(static_cast<CharType>(0xCD));
+                        write_number(static_cast<uint16_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_unsigned <= (std::numeric_limits<uint32_t>::max)())
+                    {
+                        // uint 32
+                        oa->write_character(static_cast<CharType>(0xCE));
+                        write_number(static_cast<uint32_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_unsigned <= (std::numeric_limits<uint64_t>::max)())
+                    {
+                        // uint 64
+                        oa->write_character(static_cast<CharType>(0xCF));
+                        write_number(static_cast<uint64_t>(j.m_value.number_integer));
+                    }
+                }
+                else
+                {
+                    if (j.m_value.number_integer >= -32)
+                    {
+                        // negative fixnum
+                        write_number(static_cast<int8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer >= (std::numeric_limits<int8_t>::min)() and
+                             j.m_value.number_integer <= (std::numeric_limits<int8_t>::max)())
+                    {
+                        // int 8
+                        oa->write_character(static_cast<CharType>(0xD0));
+                        write_number(static_cast<int8_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer >= (std::numeric_limits<int16_t>::min)() and
+                             j.m_value.number_integer <= (std::numeric_limits<int16_t>::max)())
+                    {
+                        // int 16
+                        oa->write_character(static_cast<CharType>(0xD1));
+                        write_number(static_cast<int16_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer >= (std::numeric_limits<int32_t>::min)() and
+                             j.m_value.number_integer <= (std::numeric_limits<int32_t>::max)())
+                    {
+                        // int 32
+                        oa->write_character(static_cast<CharType>(0xD2));
+                        write_number(static_cast<int32_t>(j.m_value.number_integer));
+                    }
+                    else if (j.m_value.number_integer >= (std::numeric_limits<int64_t>::min)() and
+                             j.m_value.number_integer <= (std::numeric_limits<int64_t>::max)())
+                    {
+                        // int 64
+                        oa->write_character(static_cast<CharType>(0xD3));
+                        write_number(static_cast<int64_t>(j.m_value.number_integer));
+                    }
+                }
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                if (j.m_value.number_unsigned < 128)
+                {
+                    // positive fixnum
+                    write_number(static_cast<uint8_t>(j.m_value.number_integer));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<uint8_t>::max)())
+                {
+                    // uint 8
+                    oa->write_character(static_cast<CharType>(0xCC));
+                    write_number(static_cast<uint8_t>(j.m_value.number_integer));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<uint16_t>::max)())
+                {
+                    // uint 16
+                    oa->write_character(static_cast<CharType>(0xCD));
+                    write_number(static_cast<uint16_t>(j.m_value.number_integer));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<uint32_t>::max)())
+                {
+                    // uint 32
+                    oa->write_character(static_cast<CharType>(0xCE));
+                    write_number(static_cast<uint32_t>(j.m_value.number_integer));
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<uint64_t>::max)())
+                {
+                    // uint 64
+                    oa->write_character(static_cast<CharType>(0xCF));
+                    write_number(static_cast<uint64_t>(j.m_value.number_integer));
+                }
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                oa->write_character(get_msgpack_float_prefix(j.m_value.number_float));
+                write_number(j.m_value.number_float);
+                break;
+            }
+
+            case value_t::string:
+            {
+                // step 1: write control byte and the string length
+                const auto N = j.m_value.string->size();
+                if (N <= 31)
+                {
+                    // fixstr
+                    write_number(static_cast<uint8_t>(0xA0 | N));
+                }
+                else if (N <= (std::numeric_limits<uint8_t>::max)())
+                {
+                    // str 8
+                    oa->write_character(static_cast<CharType>(0xD9));
+                    write_number(static_cast<uint8_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint16_t>::max)())
+                {
+                    // str 16
+                    oa->write_character(static_cast<CharType>(0xDA));
+                    write_number(static_cast<uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint32_t>::max)())
+                {
+                    // str 32
+                    oa->write_character(static_cast<CharType>(0xDB));
+                    write_number(static_cast<uint32_t>(N));
+                }
+
+                // step 2: write the string
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_value.string->c_str()),
+                    j.m_value.string->size());
+                break;
+            }
+
+            case value_t::array:
+            {
+                // step 1: write control byte and the array size
+                const auto N = j.m_value.array->size();
+                if (N <= 15)
+                {
+                    // fixarray
+                    write_number(static_cast<uint8_t>(0x90 | N));
+                }
+                else if (N <= (std::numeric_limits<uint16_t>::max)())
+                {
+                    // array 16
+                    oa->write_character(static_cast<CharType>(0xDC));
+                    write_number(static_cast<uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint32_t>::max)())
+                {
+                    // array 32
+                    oa->write_character(static_cast<CharType>(0xDD));
+                    write_number(static_cast<uint32_t>(N));
+                }
+
+                // step 2: write each element
+                for (const auto& el : *j.m_value.array)
+                {
+                    write_msgpack(el);
+                }
+                break;
+            }
+
+            case value_t::object:
+            {
+                // step 1: write control byte and the object size
+                const auto N = j.m_value.object->size();
+                if (N <= 15)
+                {
+                    // fixmap
+                    write_number(static_cast<uint8_t>(0x80 | (N & 0xF)));
+                }
+                else if (N <= (std::numeric_limits<uint16_t>::max)())
+                {
+                    // map 16
+                    oa->write_character(static_cast<CharType>(0xDE));
+                    write_number(static_cast<uint16_t>(N));
+                }
+                else if (N <= (std::numeric_limits<uint32_t>::max)())
+                {
+                    // map 32
+                    oa->write_character(static_cast<CharType>(0xDF));
+                    write_number(static_cast<uint32_t>(N));
+                }
+
+                // step 2: write each element
+                for (const auto& el : *j.m_value.object)
+                {
+                    write_msgpack(el.first);
+                    write_msgpack(el.second);
+                }
+                break;
+            }
+
+            default:
+                break;
+        }
+    }
+
+    /*!
+    @param[in] j  JSON value to serialize
+    @param[in] use_count   whether to use '#' prefixes (optimized format)
+    @param[in] use_type    whether to use '$' prefixes (optimized format)
+    @param[in] add_prefix  whether prefixes need to be used for this value
+    */
+    void write_ubjson(const BasicJsonType& j, const bool use_count,
+                      const bool use_type, const bool add_prefix = true)
+    {
+        switch (j.type())
+        {
+            case value_t::null:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(static_cast<CharType>('Z'));
+                }
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                if (add_prefix)
+                    oa->write_character(j.m_value.boolean
+                                        ? static_cast<CharType>('T')
+                                        : static_cast<CharType>('F'));
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                write_number_with_ubjson_prefix(j.m_value.number_integer, add_prefix);
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                write_number_with_ubjson_prefix(j.m_value.number_unsigned, add_prefix);
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                write_number_with_ubjson_prefix(j.m_value.number_float, add_prefix);
+                break;
+            }
+
+            case value_t::string:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(static_cast<CharType>('S'));
+                }
+                write_number_with_ubjson_prefix(j.m_value.string->size(), true);
+                oa->write_characters(
+                    reinterpret_cast<const CharType*>(j.m_value.string->c_str()),
+                    j.m_value.string->size());
+                break;
+            }
+
+            case value_t::array:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(static_cast<CharType>('['));
+                }
+
+                bool prefix_required = true;
+                if (use_type and not j.m_value.array->empty())
+                {
+                    assert(use_count);
+                    const CharType first_prefix = ubjson_prefix(j.front());
+                    const bool same_prefix = std::all_of(j.begin() + 1, j.end(),
+                                                         [this, first_prefix](const BasicJsonType & v)
+                    {
+                        return ubjson_prefix(v) == first_prefix;
+                    });
+
+                    if (same_prefix)
+                    {
+                        prefix_required = false;
+                        oa->write_character(static_cast<CharType>('$'));
+                        oa->write_character(first_prefix);
+                    }
+                }
+
+                if (use_count)
+                {
+                    oa->write_character(static_cast<CharType>('#'));
+                    write_number_with_ubjson_prefix(j.m_value.array->size(), true);
+                }
+
+                for (const auto& el : *j.m_value.array)
+                {
+                    write_ubjson(el, use_count, use_type, prefix_required);
+                }
+
+                if (not use_count)
+                {
+                    oa->write_character(static_cast<CharType>(']'));
+                }
+
+                break;
+            }
+
+            case value_t::object:
+            {
+                if (add_prefix)
+                {
+                    oa->write_character(static_cast<CharType>('{'));
+                }
+
+                bool prefix_required = true;
+                if (use_type and not j.m_value.object->empty())
+                {
+                    assert(use_count);
+                    const CharType first_prefix = ubjson_prefix(j.front());
+                    const bool same_prefix = std::all_of(j.begin(), j.end(),
+                                                         [this, first_prefix](const BasicJsonType & v)
+                    {
+                        return ubjson_prefix(v) == first_prefix;
+                    });
+
+                    if (same_prefix)
+                    {
+                        prefix_required = false;
+                        oa->write_character(static_cast<CharType>('$'));
+                        oa->write_character(first_prefix);
+                    }
+                }
+
+                if (use_count)
+                {
+                    oa->write_character(static_cast<CharType>('#'));
+                    write_number_with_ubjson_prefix(j.m_value.object->size(), true);
+                }
+
+                for (const auto& el : *j.m_value.object)
+                {
+                    write_number_with_ubjson_prefix(el.first.size(), true);
+                    oa->write_characters(
+                        reinterpret_cast<const CharType*>(el.first.c_str()),
+                        el.first.size());
+                    write_ubjson(el.second, use_count, use_type, prefix_required);
+                }
+
+                if (not use_count)
+                {
+                    oa->write_character(static_cast<CharType>('}'));
+                }
+
+                break;
+            }
+
+            default:
+                break;
+        }
+    }
+
+  private:
+    /*
+    @brief write a number to output input
+
+    @param[in] n number of type @a NumberType
+    @tparam NumberType the type of the number
+
+    @note This function needs to respect the system's endianess, because bytes
+          in CBOR, MessagePack, and UBJSON are stored in network order (big
+          endian) and therefore need reordering on little endian systems.
+    */
+    template<typename NumberType>
+    void write_number(const NumberType n)
+    {
+        // step 1: write number to array of length NumberType
+        std::array<CharType, sizeof(NumberType)> vec;
+        std::memcpy(vec.data(), &n, sizeof(NumberType));
+
+        // step 2: write array to output (with possible reordering)
+        if (is_little_endian)
+        {
+            // reverse byte order prior to conversion if necessary
+            std::reverse(vec.begin(), vec.end());
+        }
+
+        oa->write_characters(vec.data(), sizeof(NumberType));
+    }
+
+    // UBJSON: write number (floating point)
+    template<typename NumberType, typename std::enable_if<
+                 std::is_floating_point<NumberType>::value, int>::type = 0>
+    void write_number_with_ubjson_prefix(const NumberType n,
+                                         const bool add_prefix)
+    {
+        if (add_prefix)
+        {
+            oa->write_character(get_ubjson_float_prefix(n));
+        }
+        write_number(n);
+    }
+
+    // UBJSON: write number (unsigned integer)
+    template<typename NumberType, typename std::enable_if<
+                 std::is_unsigned<NumberType>::value, int>::type = 0>
+    void write_number_with_ubjson_prefix(const NumberType n,
+                                         const bool add_prefix)
+    {
+        if (n <= static_cast<uint64_t>((std::numeric_limits<int8_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('i'));  // int8
+            }
+            write_number(static_cast<uint8_t>(n));
+        }
+        else if (n <= (std::numeric_limits<uint8_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('U'));  // uint8
+            }
+            write_number(static_cast<uint8_t>(n));
+        }
+        else if (n <= static_cast<uint64_t>((std::numeric_limits<int16_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('I'));  // int16
+            }
+            write_number(static_cast<int16_t>(n));
+        }
+        else if (n <= static_cast<uint64_t>((std::numeric_limits<int32_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('l'));  // int32
+            }
+            write_number(static_cast<int32_t>(n));
+        }
+        else if (n <= static_cast<uint64_t>((std::numeric_limits<int64_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('L'));  // int64
+            }
+            write_number(static_cast<int64_t>(n));
+        }
+        else
+        {
+            JSON_THROW(out_of_range::create(407, "number overflow serializing " + std::to_string(n)));
+        }
+    }
+
+    // UBJSON: write number (signed integer)
+    template<typename NumberType, typename std::enable_if<
+                 std::is_signed<NumberType>::value and
+                 not std::is_floating_point<NumberType>::value, int>::type = 0>
+    void write_number_with_ubjson_prefix(const NumberType n,
+                                         const bool add_prefix)
+    {
+        if ((std::numeric_limits<int8_t>::min)() <= n and n <= (std::numeric_limits<int8_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('i'));  // int8
+            }
+            write_number(static_cast<int8_t>(n));
+        }
+        else if (static_cast<int64_t>((std::numeric_limits<uint8_t>::min)()) <= n and n <= static_cast<int64_t>((std::numeric_limits<uint8_t>::max)()))
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('U'));  // uint8
+            }
+            write_number(static_cast<uint8_t>(n));
+        }
+        else if ((std::numeric_limits<int16_t>::min)() <= n and n <= (std::numeric_limits<int16_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('I'));  // int16
+            }
+            write_number(static_cast<int16_t>(n));
+        }
+        else if ((std::numeric_limits<int32_t>::min)() <= n and n <= (std::numeric_limits<int32_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('l'));  // int32
+            }
+            write_number(static_cast<int32_t>(n));
+        }
+        else if ((std::numeric_limits<int64_t>::min)() <= n and n <= (std::numeric_limits<int64_t>::max)())
+        {
+            if (add_prefix)
+            {
+                oa->write_character(static_cast<CharType>('L'));  // int64
+            }
+            write_number(static_cast<int64_t>(n));
+        }
+        // LCOV_EXCL_START
+        else
+        {
+            JSON_THROW(out_of_range::create(407, "number overflow serializing " + std::to_string(n)));
+        }
+        // LCOV_EXCL_STOP
+    }
+
+    /*!
+    @brief determine the type prefix of container values
+
+    @note This function does not need to be 100% accurate when it comes to
+          integer limits. In case a number exceeds the limits of int64_t,
+          this will be detected by a later call to function
+          write_number_with_ubjson_prefix. Therefore, we return 'L' for any
+          value that does not fit the previous limits.
+    */
+    CharType ubjson_prefix(const BasicJsonType& j) const noexcept
+    {
+        switch (j.type())
+        {
+            case value_t::null:
+                return 'Z';
+
+            case value_t::boolean:
+                return j.m_value.boolean ? 'T' : 'F';
+
+            case value_t::number_integer:
+            {
+                if ((std::numeric_limits<int8_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<int8_t>::max)())
+                {
+                    return 'i';
+                }
+                else if ((std::numeric_limits<uint8_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<uint8_t>::max)())
+                {
+                    return 'U';
+                }
+                else if ((std::numeric_limits<int16_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<int16_t>::max)())
+                {
+                    return 'I';
+                }
+                else if ((std::numeric_limits<int32_t>::min)() <= j.m_value.number_integer and j.m_value.number_integer <= (std::numeric_limits<int32_t>::max)())
+                {
+                    return 'l';
+                }
+                else  // no check and assume int64_t (see note above)
+                {
+                    return 'L';
+                }
+            }
+
+            case value_t::number_unsigned:
+            {
+                if (j.m_value.number_unsigned <= (std::numeric_limits<int8_t>::max)())
+                {
+                    return 'i';
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<uint8_t>::max)())
+                {
+                    return 'U';
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<int16_t>::max)())
+                {
+                    return 'I';
+                }
+                else if (j.m_value.number_unsigned <= (std::numeric_limits<int32_t>::max)())
+                {
+                    return 'l';
+                }
+                else  // no check and assume int64_t (see note above)
+                {
+                    return 'L';
+                }
+            }
+
+            case value_t::number_float:
+                return get_ubjson_float_prefix(j.m_value.number_float);
+
+            case value_t::string:
+                return 'S';
+
+            case value_t::array:
+                return '[';
+
+            case value_t::object:
+                return '{';
+
+            default:  // discarded values
+                return 'N';
+        }
+    }
+
+    static constexpr CharType get_cbor_float_prefix(float)
+    {
+        return static_cast<CharType>(0xFA);  // Single-Precision Float
+    }
+
+    static constexpr CharType get_cbor_float_prefix(double)
+    {
+        return static_cast<CharType>(0xFB);  // Double-Precision Float
+    }
+
+    static constexpr CharType get_msgpack_float_prefix(float)
+    {
+        return static_cast<CharType>(0xCA);  // float 32
+    }
+
+    static constexpr CharType get_msgpack_float_prefix(double)
+    {
+        return static_cast<CharType>(0xCB);  // float 64
+    }
+
+    static constexpr CharType get_ubjson_float_prefix(float)
+    {
+        return 'd';  // float 32
+    }
+
+    static constexpr CharType get_ubjson_float_prefix(double)
+    {
+        return 'D';  // float 64
+    }
+
+  private:
+    /// whether we can assume little endianess
+    const bool is_little_endian = binary_reader<BasicJsonType>::little_endianess();
+
+    /// the output
+    output_adapter_t<CharType> oa = nullptr;
+};
+}
+}
+
+// #include <nlohmann/detail/output/serializer.hpp>
+
+
+#include <algorithm> // reverse, remove, fill, find, none_of
+#include <array> // array
+#include <cassert> // assert
+#include <ciso646> // and, or
+#include <clocale> // localeconv, lconv
+#include <cmath> // labs, isfinite, isnan, signbit
+#include <cstddef> // size_t, ptrdiff_t
+#include <cstdint> // uint8_t
+#include <cstdio> // snprintf
+#include <limits> // numeric_limits
+#include <string> // string
+#include <type_traits> // is_same
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/conversions/to_chars.hpp>
+
+
+#include <cassert> // assert
+#include <ciso646> // or, and, not
+#include <cmath>   // signbit, isfinite
+#include <cstdint> // intN_t, uintN_t
+#include <cstring> // memcpy, memmove
+
+namespace nlohmann
+{
+namespace detail
+{
+
+/*!
+@brief implements the Grisu2 algorithm for binary to decimal floating-point
+conversion.
+
+This implementation is a slightly modified version of the reference
+implementation which may be obtained from
+http://florian.loitsch.com/publications (bench.tar.gz).
+
+The code is distributed under the MIT license, Copyright (c) 2009 Florian Loitsch.
+
+For a detailed description of the algorithm see:
+
+[1] Loitsch, "Printing Floating-Point Numbers Quickly and Accurately with
+    Integers", Proceedings of the ACM SIGPLAN 2010 Conference on Programming
+    Language Design and Implementation, PLDI 2010
+[2] Burger, Dybvig, "Printing Floating-Point Numbers Quickly and Accurately",
+    Proceedings of the ACM SIGPLAN 1996 Conference on Programming Language
+    Design and Implementation, PLDI 1996
+*/
+namespace dtoa_impl
+{
+
+template <typename Target, typename Source>
+Target reinterpret_bits(const Source source)
+{
+    static_assert(sizeof(Target) == sizeof(Source), "size mismatch");
+
+    Target target;
+    std::memcpy(&target, &source, sizeof(Source));
+    return target;
+}
+
+struct diyfp // f * 2^e
+{
+    static constexpr int kPrecision = 64; // = q
+
+    uint64_t f;
+    int e;
+
+    constexpr diyfp() noexcept : f(0), e(0) {}
+    constexpr diyfp(uint64_t f_, int e_) noexcept : f(f_), e(e_) {}
+
+    /*!
+    @brief returns x - y
+    @pre x.e == y.e and x.f >= y.f
+    */
+    static diyfp sub(const diyfp& x, const diyfp& y) noexcept
+    {
+        assert(x.e == y.e);
+        assert(x.f >= y.f);
+
+        return diyfp(x.f - y.f, x.e);
+    }
+
+    /*!
+    @brief returns x * y
+    @note The result is rounded. (Only the upper q bits are returned.)
+    */
+    static diyfp mul(const diyfp& x, const diyfp& y) noexcept
+    {
+        static_assert(kPrecision == 64, "internal error");
+
+        // Computes:
+        //  f = round((x.f * y.f) / 2^q)
+        //  e = x.e + y.e + q
+
+        // Emulate the 64-bit * 64-bit multiplication:
+        //
+        // p = u * v
+        //   = (u_lo + 2^32 u_hi) (v_lo + 2^32 v_hi)
+        //   = (u_lo v_lo         ) + 2^32 ((u_lo v_hi         ) + (u_hi v_lo         )) + 2^64 (u_hi v_hi         )
+        //   = (p0                ) + 2^32 ((p1                ) + (p2                )) + 2^64 (p3                )
+        //   = (p0_lo + 2^32 p0_hi) + 2^32 ((p1_lo + 2^32 p1_hi) + (p2_lo + 2^32 p2_hi)) + 2^64 (p3                )
+        //   = (p0_lo             ) + 2^32 (p0_hi + p1_lo + p2_lo                      ) + 2^64 (p1_hi + p2_hi + p3)
+        //   = (p0_lo             ) + 2^32 (Q                                          ) + 2^64 (H                 )
+        //   = (p0_lo             ) + 2^32 (Q_lo + 2^32 Q_hi                           ) + 2^64 (H                 )
+        //
+        // (Since Q might be larger than 2^32 - 1)
+        //
+        //   = (p0_lo + 2^32 Q_lo) + 2^64 (Q_hi + H)
+        //
+        // (Q_hi + H does not overflow a 64-bit int)
+        //
+        //   = p_lo + 2^64 p_hi
+
+        const uint64_t u_lo = x.f & 0xFFFFFFFF;
+        const uint64_t u_hi = x.f >> 32;
+        const uint64_t v_lo = y.f & 0xFFFFFFFF;
+        const uint64_t v_hi = y.f >> 32;
+
+        const uint64_t p0 = u_lo * v_lo;
+        const uint64_t p1 = u_lo * v_hi;
+        const uint64_t p2 = u_hi * v_lo;
+        const uint64_t p3 = u_hi * v_hi;
+
+        const uint64_t p0_hi = p0 >> 32;
+        const uint64_t p1_lo = p1 & 0xFFFFFFFF;
+        const uint64_t p1_hi = p1 >> 32;
+        const uint64_t p2_lo = p2 & 0xFFFFFFFF;
+        const uint64_t p2_hi = p2 >> 32;
+
+        uint64_t Q = p0_hi + p1_lo + p2_lo;
+
+        // The full product might now be computed as
+        //
+        // p_hi = p3 + p2_hi + p1_hi + (Q >> 32)
+        // p_lo = p0_lo + (Q << 32)
+        //
+        // But in this particular case here, the full p_lo is not required.
+        // Effectively we only need to add the highest bit in p_lo to p_hi (and
+        // Q_hi + 1 does not overflow).
+
+        Q += uint64_t{1} << (64 - 32 - 1); // round, ties up
+
+        const uint64_t h = p3 + p2_hi + p1_hi + (Q >> 32);
+
+        return diyfp(h, x.e + y.e + 64);
+    }
+
+    /*!
+    @brief normalize x such that the significand is >= 2^(q-1)
+    @pre x.f != 0
+    */
+    static diyfp normalize(diyfp x) noexcept
+    {
+        assert(x.f != 0);
+
+        while ((x.f >> 63) == 0)
+        {
+            x.f <<= 1;
+            x.e--;
+        }
+
+        return x;
+    }
+
+    /*!
+    @brief normalize x such that the result has the exponent E
+    @pre e >= x.e and the upper e - x.e bits of x.f must be zero.
+    */
+    static diyfp normalize_to(const diyfp& x, const int target_exponent) noexcept
+    {
+        const int delta = x.e - target_exponent;
+
+        assert(delta >= 0);
+        assert(((x.f << delta) >> delta) == x.f);
+
+        return diyfp(x.f << delta, target_exponent);
+    }
+};
+
+struct boundaries
+{
+    diyfp w;
+    diyfp minus;
+    diyfp plus;
+};
+
+/*!
+Compute the (normalized) diyfp representing the input number 'value' and its
+boundaries.
+
+@pre value must be finite and positive
+*/
+template <typename FloatType>
+boundaries compute_boundaries(FloatType value)
+{
+    assert(std::isfinite(value));
+    assert(value > 0);
+
+    // Convert the IEEE representation into a diyfp.
+    //
+    // If v is denormal:
+    //      value = 0.F * 2^(1 - bias) = (          F) * 2^(1 - bias - (p-1))
+    // If v is normalized:
+    //      value = 1.F * 2^(E - bias) = (2^(p-1) + F) * 2^(E - bias - (p-1))
+
+    static_assert(std::numeric_limits<FloatType>::is_iec559,
+                  "internal error: dtoa_short requires an IEEE-754 floating-point implementation");
+
+    constexpr int      kPrecision = std::numeric_limits<FloatType>::digits; // = p (includes the hidden bit)
+    constexpr int      kBias      = std::numeric_limits<FloatType>::max_exponent - 1 + (kPrecision - 1);
+    constexpr int      kMinExp    = 1 - kBias;
+    constexpr uint64_t kHiddenBit = uint64_t{1} << (kPrecision - 1); // = 2^(p-1)
+
+    using bits_type = typename std::conditional< kPrecision == 24, uint32_t, uint64_t >::type;
+
+    const uint64_t bits = reinterpret_bits<bits_type>(value);
+    const uint64_t E = bits >> (kPrecision - 1);
+    const uint64_t F = bits & (kHiddenBit - 1);
+
+    const bool is_denormal = (E == 0);
+    const diyfp v = is_denormal
+                    ? diyfp(F, kMinExp)
+                    : diyfp(F + kHiddenBit, static_cast<int>(E) - kBias);
+
+    // Compute the boundaries m- and m+ of the floating-point value
+    // v = f * 2^e.
+    //
+    // Determine v- and v+, the floating-point predecessor and successor if v,
+    // respectively.
+    //
+    //      v- = v - 2^e        if f != 2^(p-1) or e == e_min                (A)
+    //         = v - 2^(e-1)    if f == 2^(p-1) and e > e_min                (B)
+    //
+    //      v+ = v + 2^e
+    //
+    // Let m- = (v- + v) / 2 and m+ = (v + v+) / 2. All real numbers _strictly_
+    // between m- and m+ round to v, regardless of how the input rounding
+    // algorithm breaks ties.
+    //
+    //      ---+-------------+-------------+-------------+-------------+---  (A)
+    //         v-            m-            v             m+            v+
+    //
+    //      -----------------+------+------+-------------+-------------+---  (B)
+    //                       v-     m-     v             m+            v+
+
+    const bool lower_boundary_is_closer = (F == 0 and E > 1);
+    const diyfp m_plus = diyfp(2 * v.f + 1, v.e - 1);
+    const diyfp m_minus = lower_boundary_is_closer
+                          ? diyfp(4 * v.f - 1, v.e - 2)  // (B)
+                          : diyfp(2 * v.f - 1, v.e - 1); // (A)
+
+    // Determine the normalized w+ = m+.
+    const diyfp w_plus = diyfp::normalize(m_plus);
+
+    // Determine w- = m- such that e_(w-) = e_(w+).
+    const diyfp w_minus = diyfp::normalize_to(m_minus, w_plus.e);
+
+    return {diyfp::normalize(v), w_minus, w_plus};
+}
+
+// Given normalized diyfp w, Grisu needs to find a (normalized) cached
+// power-of-ten c, such that the exponent of the product c * w = f * 2^e lies
+// within a certain range [alpha, gamma] (Definition 3.2 from [1])
+//
+//      alpha <= e = e_c + e_w + q <= gamma
+//
+// or
+//
+//      f_c * f_w * 2^alpha <= f_c 2^(e_c) * f_w 2^(e_w) * 2^q
+//                          <= f_c * f_w * 2^gamma
+//
+// Since c and w are normalized, i.e. 2^(q-1) <= f < 2^q, this implies
+//
+//      2^(q-1) * 2^(q-1) * 2^alpha <= c * w * 2^q < 2^q * 2^q * 2^gamma
+//
+// or
+//
+//      2^(q - 2 + alpha) <= c * w < 2^(q + gamma)
+//
+// The choice of (alpha,gamma) determines the size of the table and the form of
+// the digit generation procedure. Using (alpha,gamma)=(-60,-32) works out well
+// in practice:
+//
+// The idea is to cut the number c * w = f * 2^e into two parts, which can be
+// processed independently: An integral part p1, and a fractional part p2:
+//
+//      f * 2^e = ( (f div 2^-e) * 2^-e + (f mod 2^-e) ) * 2^e
+//              = (f div 2^-e) + (f mod 2^-e) * 2^e
+//              = p1 + p2 * 2^e
+//
+// The conversion of p1 into decimal form requires a series of divisions and
+// modulos by (a power of) 10. These operations are faster for 32-bit than for
+// 64-bit integers, so p1 should ideally fit into a 32-bit integer. This can be
+// achieved by choosing
+//
+//      -e >= 32   or   e <= -32 := gamma
+//
+// In order to convert the fractional part
+//
+//      p2 * 2^e = p2 / 2^-e = d[-1] / 10^1 + d[-2] / 10^2 + ...
+//
+// into decimal form, the fraction is repeatedly multiplied by 10 and the digits
+// d[-i] are extracted in order:
+//
+//      (10 * p2) div 2^-e = d[-1]
+//      (10 * p2) mod 2^-e = d[-2] / 10^1 + ...
+//
+// The multiplication by 10 must not overflow. It is sufficient to choose
+//
+//      10 * p2 < 16 * p2 = 2^4 * p2 <= 2^64.
+//
+// Since p2 = f mod 2^-e < 2^-e,
+//
+//      -e <= 60   or   e >= -60 := alpha
+
+constexpr int kAlpha = -60;
+constexpr int kGamma = -32;
+
+struct cached_power // c = f * 2^e ~= 10^k
+{
+    uint64_t f;
+    int e;
+    int k;
+};
+
+/*!
+For a normalized diyfp w = f * 2^e, this function returns a (normalized) cached
+power-of-ten c = f_c * 2^e_c, such that the exponent of the product w * c
+satisfies (Definition 3.2 from [1])
+
+     alpha <= e_c + e + q <= gamma.
+*/
+inline cached_power get_cached_power_for_binary_exponent(int e)
+{
+    // Now
+    //
+    //      alpha <= e_c + e + q <= gamma                                    (1)
+    //      ==> f_c * 2^alpha <= c * 2^e * 2^q
+    //
+    // and since the c's are normalized, 2^(q-1) <= f_c,
+    //
+    //      ==> 2^(q - 1 + alpha) <= c * 2^(e + q)
+    //      ==> 2^(alpha - e - 1) <= c
+    //
+    // If c were an exakt power of ten, i.e. c = 10^k, one may determine k as
+    //
+    //      k = ceil( log_10( 2^(alpha - e - 1) ) )
+    //        = ceil( (alpha - e - 1) * log_10(2) )
+    //
+    // From the paper:
+    // "In theory the result of the procedure could be wrong since c is rounded,
+    //  and the computation itself is approximated [...]. In practice, however,
+    //  this simple function is sufficient."
+    //
+    // For IEEE double precision floating-point numbers converted into
+    // normalized diyfp's w = f * 2^e, with q = 64,
+    //
+    //      e >= -1022      (min IEEE exponent)
+    //           -52        (p - 1)
+    //           -52        (p - 1, possibly normalize denormal IEEE numbers)
+    //           -11        (normalize the diyfp)
+    //         = -1137
+    //
+    // and
+    //
+    //      e <= +1023      (max IEEE exponent)
+    //           -52        (p - 1)
+    //           -11        (normalize the diyfp)
+    //         = 960
+    //
+    // This binary exponent range [-1137,960] results in a decimal exponent
+    // range [-307,324]. One does not need to store a cached power for each
+    // k in this range. For each such k it suffices to find a cached power
+    // such that the exponent of the product lies in [alpha,gamma].
+    // This implies that the difference of the decimal exponents of adjacent
+    // table entries must be less than or equal to
+    //
+    //      floor( (gamma - alpha) * log_10(2) ) = 8.
+    //
+    // (A smaller distance gamma-alpha would require a larger table.)
+
+    // NB:
+    // Actually this function returns c, such that -60 <= e_c + e + 64 <= -34.
+
+    constexpr int kCachedPowersSize = 79;
+    constexpr int kCachedPowersMinDecExp = -300;
+    constexpr int kCachedPowersDecStep = 8;
+
+    static constexpr cached_power kCachedPowers[] =
+    {
+        { 0xAB70FE17C79AC6CA, -1060, -300 },
+        { 0xFF77B1FCBEBCDC4F, -1034, -292 },
+        { 0xBE5691EF416BD60C, -1007, -284 },
+        { 0x8DD01FAD907FFC3C,  -980, -276 },
+        { 0xD3515C2831559A83,  -954, -268 },
+        { 0x9D71AC8FADA6C9B5,  -927, -260 },
+        { 0xEA9C227723EE8BCB,  -901, -252 },
+        { 0xAECC49914078536D,  -874, -244 },
+        { 0x823C12795DB6CE57,  -847, -236 },
+        { 0xC21094364DFB5637,  -821, -228 },
+        { 0x9096EA6F3848984F,  -794, -220 },
+        { 0xD77485CB25823AC7,  -768, -212 },
+        { 0xA086CFCD97BF97F4,  -741, -204 },
+        { 0xEF340A98172AACE5,  -715, -196 },
+        { 0xB23867FB2A35B28E,  -688, -188 },
+        { 0x84C8D4DFD2C63F3B,  -661, -180 },
+        { 0xC5DD44271AD3CDBA,  -635, -172 },
+        { 0x936B9FCEBB25C996,  -608, -164 },
+        { 0xDBAC6C247D62A584,  -582, -156 },
+        { 0xA3AB66580D5FDAF6,  -555, -148 },
+        { 0xF3E2F893DEC3F126,  -529, -140 },
+        { 0xB5B5ADA8AAFF80B8,  -502, -132 },
+        { 0x87625F056C7C4A8B,  -475, -124 },
+        { 0xC9BCFF6034C13053,  -449, -116 },
+        { 0x964E858C91BA2655,  -422, -108 },
+        { 0xDFF9772470297EBD,  -396, -100 },
+        { 0xA6DFBD9FB8E5B88F,  -369,  -92 },
+        { 0xF8A95FCF88747D94,  -343,  -84 },
+        { 0xB94470938FA89BCF,  -316,  -76 },
+        { 0x8A08F0F8BF0F156B,  -289,  -68 },
+        { 0xCDB02555653131B6,  -263,  -60 },
+        { 0x993FE2C6D07B7FAC,  -236,  -52 },
+        { 0xE45C10C42A2B3B06,  -210,  -44 },
+        { 0xAA242499697392D3,  -183,  -36 },
+        { 0xFD87B5F28300CA0E,  -157,  -28 },
+        { 0xBCE5086492111AEB,  -130,  -20 },
+        { 0x8CBCCC096F5088CC,  -103,  -12 },
+        { 0xD1B71758E219652C,   -77,   -4 },
+        { 0x9C40000000000000,   -50,    4 },
+        { 0xE8D4A51000000000,   -24,   12 },
+        { 0xAD78EBC5AC620000,     3,   20 },
+        { 0x813F3978F8940984,    30,   28 },
+        { 0xC097CE7BC90715B3,    56,   36 },
+        { 0x8F7E32CE7BEA5C70,    83,   44 },
+        { 0xD5D238A4ABE98068,   109,   52 },
+        { 0x9F4F2726179A2245,   136,   60 },
+        { 0xED63A231D4C4FB27,   162,   68 },
+        { 0xB0DE65388CC8ADA8,   189,   76 },
+        { 0x83C7088E1AAB65DB,   216,   84 },
+        { 0xC45D1DF942711D9A,   242,   92 },
+        { 0x924D692CA61BE758,   269,  100 },
+        { 0xDA01EE641A708DEA,   295,  108 },
+        { 0xA26DA3999AEF774A,   322,  116 },
+        { 0xF209787BB47D6B85,   348,  124 },
+        { 0xB454E4A179DD1877,   375,  132 },
+        { 0x865B86925B9BC5C2,   402,  140 },
+        { 0xC83553C5C8965D3D,   428,  148 },
+        { 0x952AB45CFA97A0B3,   455,  156 },
+        { 0xDE469FBD99A05FE3,   481,  164 },
+        { 0xA59BC234DB398C25,   508,  172 },
+        { 0xF6C69A72A3989F5C,   534,  180 },
+        { 0xB7DCBF5354E9BECE,   561,  188 },
+        { 0x88FCF317F22241E2,   588,  196 },
+        { 0xCC20CE9BD35C78A5,   614,  204 },
+        { 0x98165AF37B2153DF,   641,  212 },
+        { 0xE2A0B5DC971F303A,   667,  220 },
+        { 0xA8D9D1535CE3B396,   694,  228 },
+        { 0xFB9B7CD9A4A7443C,   720,  236 },
+        { 0xBB764C4CA7A44410,   747,  244 },
+        { 0x8BAB8EEFB6409C1A,   774,  252 },
+        { 0xD01FEF10A657842C,   800,  260 },
+        { 0x9B10A4E5E9913129,   827,  268 },
+        { 0xE7109BFBA19C0C9D,   853,  276 },
+        { 0xAC2820D9623BF429,   880,  284 },
+        { 0x80444B5E7AA7CF85,   907,  292 },
+        { 0xBF21E44003ACDD2D,   933,  300 },
+        { 0x8E679C2F5E44FF8F,   960,  308 },
+        { 0xD433179D9C8CB841,   986,  316 },
+        { 0x9E19DB92B4E31BA9,  1013,  324 },
+    };
+
+    // This computation gives exactly the same results for k as
+    //      k = ceil((kAlpha - e - 1) * 0.30102999566398114)
+    // for |e| <= 1500, but doesn't require floating-point operations.
+    // NB: log_10(2) ~= 78913 / 2^18
+    assert(e >= -1500);
+    assert(e <=  1500);
+    const int f = kAlpha - e - 1;
+    const int k = (f * 78913) / (1 << 18) + (f > 0);
+
+    const int index = (-kCachedPowersMinDecExp + k + (kCachedPowersDecStep - 1)) / kCachedPowersDecStep;
+    assert(index >= 0);
+    assert(index < kCachedPowersSize);
+    static_cast<void>(kCachedPowersSize); // Fix warning.
+
+    const cached_power cached = kCachedPowers[index];
+    assert(kAlpha <= cached.e + e + 64);
+    assert(kGamma >= cached.e + e + 64);
+
+    return cached;
+}
+
+/*!
+For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k.
+For n == 0, returns 1 and sets pow10 := 1.
+*/
+inline int find_largest_pow10(const uint32_t n, uint32_t& pow10)
+{
+    // LCOV_EXCL_START
+    if (n >= 1000000000)
+    {
+        pow10 = 1000000000;
+        return 10;
+    }
+    // LCOV_EXCL_STOP
+    else if (n >= 100000000)
+    {
+        pow10 = 100000000;
+        return  9;
+    }
+    else if (n >= 10000000)
+    {
+        pow10 = 10000000;
+        return  8;
+    }
+    else if (n >= 1000000)
+    {
+        pow10 = 1000000;
+        return  7;
+    }
+    else if (n >= 100000)
+    {
+        pow10 = 100000;
+        return  6;
+    }
+    else if (n >= 10000)
+    {
+        pow10 = 10000;
+        return  5;
+    }
+    else if (n >= 1000)
+    {
+        pow10 = 1000;
+        return  4;
+    }
+    else if (n >= 100)
+    {
+        pow10 = 100;
+        return  3;
+    }
+    else if (n >= 10)
+    {
+        pow10 = 10;
+        return  2;
+    }
+    else
+    {
+        pow10 = 1;
+        return 1;
+    }
+}
+
+inline void grisu2_round(char* buf, int len, uint64_t dist, uint64_t delta,
+                         uint64_t rest, uint64_t ten_k)
+{
+    assert(len >= 1);
+    assert(dist <= delta);
+    assert(rest <= delta);
+    assert(ten_k > 0);
+
+    //               <--------------------------- delta ---->
+    //                                  <---- dist --------->
+    // --------------[------------------+-------------------]--------------
+    //               M-                 w                   M+
+    //
+    //                                  ten_k
+    //                                <------>
+    //                                       <---- rest ---->
+    // --------------[------------------+----+--------------]--------------
+    //                                  w    V
+    //                                       = buf * 10^k
+    //
+    // ten_k represents a unit-in-the-last-place in the decimal representation
+    // stored in buf.
+    // Decrement buf by ten_k while this takes buf closer to w.
+
+    // The tests are written in this order to avoid overflow in unsigned
+    // integer arithmetic.
+
+    while (rest < dist
+            and delta - rest >= ten_k
+            and (rest + ten_k < dist or dist - rest > rest + ten_k - dist))
+    {
+        assert(buf[len - 1] != '0');
+        buf[len - 1]--;
+        rest += ten_k;
+    }
+}
+
+/*!
+Generates V = buffer * 10^decimal_exponent, such that M- <= V <= M+.
+M- and M+ must be normalized and share the same exponent -60 <= e <= -32.
+*/
+inline void grisu2_digit_gen(char* buffer, int& length, int& decimal_exponent,
+                             diyfp M_minus, diyfp w, diyfp M_plus)
+{
+    static_assert(kAlpha >= -60, "internal error");
+    static_assert(kGamma <= -32, "internal error");
+
+    // Generates the digits (and the exponent) of a decimal floating-point
+    // number V = buffer * 10^decimal_exponent in the range [M-, M+]. The diyfp's
+    // w, M- and M+ share the same exponent e, which satisfies alpha <= e <= gamma.
+    //
+    //               <--------------------------- delta ---->
+    //                                  <---- dist --------->
+    // --------------[------------------+-------------------]--------------
+    //               M-                 w                   M+
+    //
+    // Grisu2 generates the digits of M+ from left to right and stops as soon as
+    // V is in [M-,M+].
+
+    assert(M_plus.e >= kAlpha);
+    assert(M_plus.e <= kGamma);
+
+    uint64_t delta = diyfp::sub(M_plus, M_minus).f; // (significand of (M+ - M-), implicit exponent is e)
+    uint64_t dist  = diyfp::sub(M_plus, w      ).f; // (significand of (M+ - w ), implicit exponent is e)
+
+    // Split M+ = f * 2^e into two parts p1 and p2 (note: e < 0):
+    //
+    //      M+ = f * 2^e
+    //         = ((f div 2^-e) * 2^-e + (f mod 2^-e)) * 2^e
+    //         = ((p1        ) * 2^-e + (p2        )) * 2^e
+    //         = p1 + p2 * 2^e
+
+    const diyfp one(uint64_t{1} << -M_plus.e, M_plus.e);
+
+    uint32_t p1 = static_cast<uint32_t>(M_plus.f >> -one.e); // p1 = f div 2^-e (Since -e >= 32, p1 fits into a 32-bit int.)
+    uint64_t p2 = M_plus.f & (one.f - 1);                    // p2 = f mod 2^-e
+
+    // 1)
+    //
+    // Generate the digits of the integral part p1 = d[n-1]...d[1]d[0]
+
+    assert(p1 > 0);
+
+    uint32_t pow10;
+    const int k = find_largest_pow10(p1, pow10);
+
+    //      10^(k-1) <= p1 < 10^k, pow10 = 10^(k-1)
+    //
+    //      p1 = (p1 div 10^(k-1)) * 10^(k-1) + (p1 mod 10^(k-1))
+    //         = (d[k-1]         ) * 10^(k-1) + (p1 mod 10^(k-1))
+    //
+    //      M+ = p1                                             + p2 * 2^e
+    //         = d[k-1] * 10^(k-1) + (p1 mod 10^(k-1))          + p2 * 2^e
+    //         = d[k-1] * 10^(k-1) + ((p1 mod 10^(k-1)) * 2^-e + p2) * 2^e
+    //         = d[k-1] * 10^(k-1) + (                         rest) * 2^e
+    //
+    // Now generate the digits d[n] of p1 from left to right (n = k-1,...,0)
+    //
+    //      p1 = d[k-1]...d[n] * 10^n + d[n-1]...d[0]
+    //
+    // but stop as soon as
+    //
+    //      rest * 2^e = (d[n-1]...d[0] * 2^-e + p2) * 2^e <= delta * 2^e
+
+    int n = k;
+    while (n > 0)
+    {
+        // Invariants:
+        //      M+ = buffer * 10^n + (p1 + p2 * 2^e)    (buffer = 0 for n = k)
+        //      pow10 = 10^(n-1) <= p1 < 10^n
+        //
+        const uint32_t d = p1 / pow10;  // d = p1 div 10^(n-1)
+        const uint32_t r = p1 % pow10;  // r = p1 mod 10^(n-1)
+        //
+        //      M+ = buffer * 10^n + (d * 10^(n-1) + r) + p2 * 2^e
+        //         = (buffer * 10 + d) * 10^(n-1) + (r + p2 * 2^e)
+        //
+        assert(d <= 9);
+        buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d
+        //
+        //      M+ = buffer * 10^(n-1) + (r + p2 * 2^e)
+        //
+        p1 = r;
+        n--;
+        //
+        //      M+ = buffer * 10^n + (p1 + p2 * 2^e)
+        //      pow10 = 10^n
+        //
+
+        // Now check if enough digits have been generated.
+        // Compute
+        //
+        //      p1 + p2 * 2^e = (p1 * 2^-e + p2) * 2^e = rest * 2^e
+        //
+        // Note:
+        // Since rest and delta share the same exponent e, it suffices to
+        // compare the significands.
+        const uint64_t rest = (uint64_t{p1} << -one.e) + p2;
+        if (rest <= delta)
+        {
+            // V = buffer * 10^n, with M- <= V <= M+.
+
+            decimal_exponent += n;
+
+            // We may now just stop. But instead look if the buffer could be
+            // decremented to bring V closer to w.
+            //
+            // pow10 = 10^n is now 1 ulp in the decimal representation V.
+            // The rounding procedure works with diyfp's with an implicit
+            // exponent of e.
+            //
+            //      10^n = (10^n * 2^-e) * 2^e = ulp * 2^e
+            //
+            const uint64_t ten_n = uint64_t{pow10} << -one.e;
+            grisu2_round(buffer, length, dist, delta, rest, ten_n);
+
+            return;
+        }
+
+        pow10 /= 10;
+        //
+        //      pow10 = 10^(n-1) <= p1 < 10^n
+        // Invariants restored.
+    }
+
+    // 2)
+    //
+    // The digits of the integral part have been generated:
+    //
+    //      M+ = d[k-1]...d[1]d[0] + p2 * 2^e
+    //         = buffer            + p2 * 2^e
+    //
+    // Now generate the digits of the fractional part p2 * 2^e.
+    //
+    // Note:
+    // No decimal point is generated: the exponent is adjusted instead.
+    //
+    // p2 actually represents the fraction
+    //
+    //      p2 * 2^e
+    //          = p2 / 2^-e
+    //          = d[-1] / 10^1 + d[-2] / 10^2 + ...
+    //
+    // Now generate the digits d[-m] of p1 from left to right (m = 1,2,...)
+    //
+    //      p2 * 2^e = d[-1]d[-2]...d[-m] * 10^-m
+    //                      + 10^-m * (d[-m-1] / 10^1 + d[-m-2] / 10^2 + ...)
+    //
+    // using
+    //
+    //      10^m * p2 = ((10^m * p2) div 2^-e) * 2^-e + ((10^m * p2) mod 2^-e)
+    //                = (                   d) * 2^-e + (                   r)
+    //
+    // or
+    //      10^m * p2 * 2^e = d + r * 2^e
+    //
+    // i.e.
+    //
+    //      M+ = buffer + p2 * 2^e
+    //         = buffer + 10^-m * (d + r * 2^e)
+    //         = (buffer * 10^m + d) * 10^-m + 10^-m * r * 2^e
+    //
+    // and stop as soon as 10^-m * r * 2^e <= delta * 2^e
+
+    assert(p2 > delta);
+
+    int m = 0;
+    for (;;)
+    {
+        // Invariant:
+        //      M+ = buffer * 10^-m + 10^-m * (d[-m-1] / 10 + d[-m-2] / 10^2 + ...) * 2^e
+        //         = buffer * 10^-m + 10^-m * (p2                                 ) * 2^e
+        //         = buffer * 10^-m + 10^-m * (1/10 * (10 * p2)                   ) * 2^e
+        //         = buffer * 10^-m + 10^-m * (1/10 * ((10*p2 div 2^-e) * 2^-e + (10*p2 mod 2^-e)) * 2^e
+        //
+        assert(p2 <= UINT64_MAX / 10);
+        p2 *= 10;
+        const uint64_t d = p2 >> -one.e;     // d = (10 * p2) div 2^-e
+        const uint64_t r = p2 & (one.f - 1); // r = (10 * p2) mod 2^-e
+        //
+        //      M+ = buffer * 10^-m + 10^-m * (1/10 * (d * 2^-e + r) * 2^e
+        //         = buffer * 10^-m + 10^-m * (1/10 * (d + r * 2^e))
+        //         = (buffer * 10 + d) * 10^(-m-1) + 10^(-m-1) * r * 2^e
+        //
+        assert(d <= 9);
+        buffer[length++] = static_cast<char>('0' + d); // buffer := buffer * 10 + d
+        //
+        //      M+ = buffer * 10^(-m-1) + 10^(-m-1) * r * 2^e
+        //
+        p2 = r;
+        m++;
+        //
+        //      M+ = buffer * 10^-m + 10^-m * p2 * 2^e
+        // Invariant restored.
+
+        // Check if enough digits have been generated.
+        //
+        //      10^-m * p2 * 2^e <= delta * 2^e
+        //              p2 * 2^e <= 10^m * delta * 2^e
+        //                    p2 <= 10^m * delta
+        delta *= 10;
+        dist  *= 10;
+        if (p2 <= delta)
+        {
+            break;
+        }
+    }
+
+    // V = buffer * 10^-m, with M- <= V <= M+.
+
+    decimal_exponent -= m;
+
+    // 1 ulp in the decimal representation is now 10^-m.
+    // Since delta and dist are now scaled by 10^m, we need to do the
+    // same with ulp in order to keep the units in sync.
+    //
+    //      10^m * 10^-m = 1 = 2^-e * 2^e = ten_m * 2^e
+    //
+    const uint64_t ten_m = one.f;
+    grisu2_round(buffer, length, dist, delta, p2, ten_m);
+
+    // By construction this algorithm generates the shortest possible decimal
+    // number (Loitsch, Theorem 6.2) which rounds back to w.
+    // For an input number of precision p, at least
+    //
+    //      N = 1 + ceil(p * log_10(2))
+    //
+    // decimal digits are sufficient to identify all binary floating-point
+    // numbers (Matula, "In-and-Out conversions").
+    // This implies that the algorithm does not produce more than N decimal
+    // digits.
+    //
+    //      N = 17 for p = 53 (IEEE double precision)
+    //      N = 9  for p = 24 (IEEE single precision)
+}
+
+/*!
+v = buf * 10^decimal_exponent
+len is the length of the buffer (number of decimal digits)
+The buffer must be large enough, i.e. >= max_digits10.
+*/
+inline void grisu2(char* buf, int& len, int& decimal_exponent,
+                   diyfp m_minus, diyfp v, diyfp m_plus)
+{
+    assert(m_plus.e == m_minus.e);
+    assert(m_plus.e == v.e);
+
+    //  --------(-----------------------+-----------------------)--------    (A)
+    //          m-                      v                       m+
+    //
+    //  --------------------(-----------+-----------------------)--------    (B)
+    //                      m-          v                       m+
+    //
+    // First scale v (and m- and m+) such that the exponent is in the range
+    // [alpha, gamma].
+
+    const cached_power cached = get_cached_power_for_binary_exponent(m_plus.e);
+
+    const diyfp c_minus_k(cached.f, cached.e); // = c ~= 10^-k
+
+    // The exponent of the products is = v.e + c_minus_k.e + q and is in the range [alpha,gamma]
+    const diyfp w       = diyfp::mul(v,       c_minus_k);
+    const diyfp w_minus = diyfp::mul(m_minus, c_minus_k);
+    const diyfp w_plus  = diyfp::mul(m_plus,  c_minus_k);
+
+    //  ----(---+---)---------------(---+---)---------------(---+---)----
+    //          w-                      w                       w+
+    //          = c*m-                  = c*v                   = c*m+
+    //
+    // diyfp::mul rounds its result and c_minus_k is approximated too. w, w- and
+    // w+ are now off by a small amount.
+    // In fact:
+    //
+    //      w - v * 10^k < 1 ulp
+    //
+    // To account for this inaccuracy, add resp. subtract 1 ulp.
+    //
+    //  --------+---[---------------(---+---)---------------]---+--------
+    //          w-  M-                  w                   M+  w+
+    //
+    // Now any number in [M-, M+] (bounds included) will round to w when input,
+    // regardless of how the input rounding algorithm breaks ties.
+    //
+    // And digit_gen generates the shortest possible such number in [M-, M+].
+    // Note that this does not mean that Grisu2 always generates the shortest
+    // possible number in the interval (m-, m+).
+    const diyfp M_minus(w_minus.f + 1, w_minus.e);
+    const diyfp M_plus (w_plus.f  - 1, w_plus.e );
+
+    decimal_exponent = -cached.k; // = -(-k) = k
+
+    grisu2_digit_gen(buf, len, decimal_exponent, M_minus, w, M_plus);
+}
+
+/*!
+v = buf * 10^decimal_exponent
+len is the length of the buffer (number of decimal digits)
+The buffer must be large enough, i.e. >= max_digits10.
+*/
+template <typename FloatType>
+void grisu2(char* buf, int& len, int& decimal_exponent, FloatType value)
+{
+    static_assert(diyfp::kPrecision >= std::numeric_limits<FloatType>::digits + 3,
+                  "internal error: not enough precision");
+
+    assert(std::isfinite(value));
+    assert(value > 0);
+
+    // If the neighbors (and boundaries) of 'value' are always computed for double-precision
+    // numbers, all float's can be recovered using strtod (and strtof). However, the resulting
+    // decimal representations are not exactly "short".
+    //
+    // The documentation for 'std::to_chars' (https://en.cppreference.com/w/cpp/utility/to_chars)
+    // says "value is converted to a string as if by std::sprintf in the default ("C") locale"
+    // and since sprintf promotes float's to double's, I think this is exactly what 'std::to_chars'
+    // does.
+    // On the other hand, the documentation for 'std::to_chars' requires that "parsing the
+    // representation using the corresponding std::from_chars function recovers value exactly". That
+    // indicates that single precision floating-point numbers should be recovered using
+    // 'std::strtof'.
+    //
+    // NB: If the neighbors are computed for single-precision numbers, there is a single float
+    //     (7.0385307e-26f) which can't be recovered using strtod. The resulting double precision
+    //     value is off by 1 ulp.
+#if 0
+    const boundaries w = compute_boundaries(static_cast<double>(value));
+#else
+    const boundaries w = compute_boundaries(value);
+#endif
+
+    grisu2(buf, len, decimal_exponent, w.minus, w.w, w.plus);
+}
+
+/*!
+@brief appends a decimal representation of e to buf
+@return a pointer to the element following the exponent.
+@pre -1000 < e < 1000
+*/
+inline char* append_exponent(char* buf, int e)
+{
+    assert(e > -1000);
+    assert(e <  1000);
+
+    if (e < 0)
+    {
+        e = -e;
+        *buf++ = '-';
+    }
+    else
+    {
+        *buf++ = '+';
+    }
+
+    uint32_t k = static_cast<uint32_t>(e);
+    if (k < 10)
+    {
+        // Always print at least two digits in the exponent.
+        // This is for compatibility with printf("%g").
+        *buf++ = '0';
+        *buf++ = static_cast<char>('0' + k);
+    }
+    else if (k < 100)
+    {
+        *buf++ = static_cast<char>('0' + k / 10);
+        k %= 10;
+        *buf++ = static_cast<char>('0' + k);
+    }
+    else
+    {
+        *buf++ = static_cast<char>('0' + k / 100);
+        k %= 100;
+        *buf++ = static_cast<char>('0' + k / 10);
+        k %= 10;
+        *buf++ = static_cast<char>('0' + k);
+    }
+
+    return buf;
+}
+
+/*!
+@brief prettify v = buf * 10^decimal_exponent
+
+If v is in the range [10^min_exp, 10^max_exp) it will be printed in fixed-point
+notation. Otherwise it will be printed in exponential notation.
+
+@pre min_exp < 0
+@pre max_exp > 0
+*/
+inline char* format_buffer(char* buf, int len, int decimal_exponent,
+                           int min_exp, int max_exp)
+{
+    assert(min_exp < 0);
+    assert(max_exp > 0);
+
+    const int k = len;
+    const int n = len + decimal_exponent;
+
+    // v = buf * 10^(n-k)
+    // k is the length of the buffer (number of decimal digits)
+    // n is the position of the decimal point relative to the start of the buffer.
+
+    if (k <= n and n <= max_exp)
+    {
+        // digits[000]
+        // len <= max_exp + 2
+
+        std::memset(buf + k, '0', static_cast<size_t>(n - k));
+        // Make it look like a floating-point number (#362, #378)
+        buf[n + 0] = '.';
+        buf[n + 1] = '0';
+        return buf + (n + 2);
+    }
+
+    if (0 < n and n <= max_exp)
+    {
+        // dig.its
+        // len <= max_digits10 + 1
+
+        assert(k > n);
+
+        std::memmove(buf + (n + 1), buf + n, static_cast<size_t>(k - n));
+        buf[n] = '.';
+        return buf + (k + 1);
+    }
+
+    if (min_exp < n and n <= 0)
+    {
+        // 0.[000]digits
+        // len <= 2 + (-min_exp - 1) + max_digits10
+
+        std::memmove(buf + (2 + -n), buf, static_cast<size_t>(k));
+        buf[0] = '0';
+        buf[1] = '.';
+        std::memset(buf + 2, '0', static_cast<size_t>(-n));
+        return buf + (2 + (-n) + k);
+    }
+
+    if (k == 1)
+    {
+        // dE+123
+        // len <= 1 + 5
+
+        buf += 1;
+    }
+    else
+    {
+        // d.igitsE+123
+        // len <= max_digits10 + 1 + 5
+
+        std::memmove(buf + 2, buf + 1, static_cast<size_t>(k - 1));
+        buf[1] = '.';
+        buf += 1 + k;
+    }
+
+    *buf++ = 'e';
+    return append_exponent(buf, n - 1);
+}
+
+} // namespace dtoa_impl
+
+/*!
+@brief generates a decimal representation of the floating-point number value in [first, last).
+
+The format of the resulting decimal representation is similar to printf's %g
+format. Returns an iterator pointing past-the-end of the decimal representation.
+
+@note The input number must be finite, i.e. NaN's and Inf's are not supported.
+@note The buffer must be large enough.
+@note The result is NOT null-terminated.
+*/
+template <typename FloatType>
+char* to_chars(char* first, char* last, FloatType value)
+{
+    static_cast<void>(last); // maybe unused - fix warning
+    assert(std::isfinite(value));
+
+    // Use signbit(value) instead of (value < 0) since signbit works for -0.
+    if (std::signbit(value))
+    {
+        value = -value;
+        *first++ = '-';
+    }
+
+    if (value == 0) // +-0
+    {
+        *first++ = '0';
+        // Make it look like a floating-point number (#362, #378)
+        *first++ = '.';
+        *first++ = '0';
+        return first;
+    }
+
+    assert(last - first >= std::numeric_limits<FloatType>::max_digits10);
+
+    // Compute v = buffer * 10^decimal_exponent.
+    // The decimal digits are stored in the buffer, which needs to be interpreted
+    // as an unsigned decimal integer.
+    // len is the length of the buffer, i.e. the number of decimal digits.
+    int len = 0;
+    int decimal_exponent = 0;
+    dtoa_impl::grisu2(first, len, decimal_exponent, value);
+
+    assert(len <= std::numeric_limits<FloatType>::max_digits10);
+
+    // Format the buffer like printf("%.*g", prec, value)
+    constexpr int kMinExp = -4;
+    // Use digits10 here to increase compatibility with version 2.
+    constexpr int kMaxExp = std::numeric_limits<FloatType>::digits10;
+
+    assert(last - first >= kMaxExp + 2);
+    assert(last - first >= 2 + (-kMinExp - 1) + std::numeric_limits<FloatType>::max_digits10);
+    assert(last - first >= std::numeric_limits<FloatType>::max_digits10 + 6);
+
+    return dtoa_impl::format_buffer(first, len, decimal_exponent, kMinExp, kMaxExp);
+}
+
+} // namespace detail
+} // namespace nlohmann
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/meta/cpp_future.hpp>
+
+// #include <nlohmann/detail/output/output_adapters.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+namespace nlohmann
+{
+namespace detail
+{
+///////////////////
+// serialization //
+///////////////////
+
+template<typename BasicJsonType>
+class serializer
+{
+    using string_t = typename BasicJsonType::string_t;
+    using number_float_t = typename BasicJsonType::number_float_t;
+    using number_integer_t = typename BasicJsonType::number_integer_t;
+    using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+    static constexpr uint8_t UTF8_ACCEPT = 0;
+    static constexpr uint8_t UTF8_REJECT = 1;
+
+  public:
+    /*!
+    @param[in] s  output stream to serialize to
+    @param[in] ichar  indentation character to use
+    */
+    serializer(output_adapter_t<char> s, const char ichar)
+        : o(std::move(s)), loc(std::localeconv()),
+          thousands_sep(loc->thousands_sep == nullptr ? '\0' : * (loc->thousands_sep)),
+          decimal_point(loc->decimal_point == nullptr ? '\0' : * (loc->decimal_point)),
+          indent_char(ichar), indent_string(512, indent_char)
+    {}
+
+    // delete because of pointer members
+    serializer(const serializer&) = delete;
+    serializer& operator=(const serializer&) = delete;
+
+    /*!
+    @brief internal implementation of the serialization function
+
+    This function is called by the public member function dump and organizes
+    the serialization internally. The indentation level is propagated as
+    additional parameter. In case of arrays and objects, the function is
+    called recursively.
+
+    - strings and object keys are escaped using `escape_string()`
+    - integer numbers are converted implicitly via `operator<<`
+    - floating-point numbers are converted to a string using `"%g"` format
+
+    @param[in] val             value to serialize
+    @param[in] pretty_print    whether the output shall be pretty-printed
+    @param[in] indent_step     the indent level
+    @param[in] current_indent  the current indent level (only used internally)
+    */
+    void dump(const BasicJsonType& val, const bool pretty_print,
+              const bool ensure_ascii,
+              const unsigned int indent_step,
+              const unsigned int current_indent = 0)
+    {
+        switch (val.m_type)
+        {
+            case value_t::object:
+            {
+                if (val.m_value.object->empty())
+                {
+                    o->write_characters("{}", 2);
+                    return;
+                }
+
+                if (pretty_print)
+                {
+                    o->write_characters("{\n", 2);
+
+                    // variable to hold indentation for recursive calls
+                    const auto new_indent = current_indent + indent_step;
+                    if (JSON_UNLIKELY(indent_string.size() < new_indent))
+                    {
+                        indent_string.resize(indent_string.size() * 2, ' ');
+                    }
+
+                    // first n-1 elements
+                    auto i = val.m_value.object->cbegin();
+                    for (std::size_t cnt = 0; cnt < val.m_value.object->size() - 1; ++cnt, ++i)
+                    {
+                        o->write_characters(indent_string.c_str(), new_indent);
+                        o->write_character('\"');
+                        dump_escaped(i->first, ensure_ascii);
+                        o->write_characters("\": ", 3);
+                        dump(i->second, true, ensure_ascii, indent_step, new_indent);
+                        o->write_characters(",\n", 2);
+                    }
+
+                    // last element
+                    assert(i != val.m_value.object->cend());
+                    assert(std::next(i) == val.m_value.object->cend());
+                    o->write_characters(indent_string.c_str(), new_indent);
+                    o->write_character('\"');
+                    dump_escaped(i->first, ensure_ascii);
+                    o->write_characters("\": ", 3);
+                    dump(i->second, true, ensure_ascii, indent_step, new_indent);
+
+                    o->write_character('\n');
+                    o->write_characters(indent_string.c_str(), current_indent);
+                    o->write_character('}');
+                }
+                else
+                {
+                    o->write_character('{');
+
+                    // first n-1 elements
+                    auto i = val.m_value.object->cbegin();
+                    for (std::size_t cnt = 0; cnt < val.m_value.object->size() - 1; ++cnt, ++i)
+                    {
+                        o->write_character('\"');
+                        dump_escaped(i->first, ensure_ascii);
+                        o->write_characters("\":", 2);
+                        dump(i->second, false, ensure_ascii, indent_step, current_indent);
+                        o->write_character(',');
+                    }
+
+                    // last element
+                    assert(i != val.m_value.object->cend());
+                    assert(std::next(i) == val.m_value.object->cend());
+                    o->write_character('\"');
+                    dump_escaped(i->first, ensure_ascii);
+                    o->write_characters("\":", 2);
+                    dump(i->second, false, ensure_ascii, indent_step, current_indent);
+
+                    o->write_character('}');
+                }
+
+                return;
+            }
+
+            case value_t::array:
+            {
+                if (val.m_value.array->empty())
+                {
+                    o->write_characters("[]", 2);
+                    return;
+                }
+
+                if (pretty_print)
+                {
+                    o->write_characters("[\n", 2);
+
+                    // variable to hold indentation for recursive calls
+                    const auto new_indent = current_indent + indent_step;
+                    if (JSON_UNLIKELY(indent_string.size() < new_indent))
+                    {
+                        indent_string.resize(indent_string.size() * 2, ' ');
+                    }
+
+                    // first n-1 elements
+                    for (auto i = val.m_value.array->cbegin();
+                            i != val.m_value.array->cend() - 1; ++i)
+                    {
+                        o->write_characters(indent_string.c_str(), new_indent);
+                        dump(*i, true, ensure_ascii, indent_step, new_indent);
+                        o->write_characters(",\n", 2);
+                    }
+
+                    // last element
+                    assert(not val.m_value.array->empty());
+                    o->write_characters(indent_string.c_str(), new_indent);
+                    dump(val.m_value.array->back(), true, ensure_ascii, indent_step, new_indent);
+
+                    o->write_character('\n');
+                    o->write_characters(indent_string.c_str(), current_indent);
+                    o->write_character(']');
+                }
+                else
+                {
+                    o->write_character('[');
+
+                    // first n-1 elements
+                    for (auto i = val.m_value.array->cbegin();
+                            i != val.m_value.array->cend() - 1; ++i)
+                    {
+                        dump(*i, false, ensure_ascii, indent_step, current_indent);
+                        o->write_character(',');
+                    }
+
+                    // last element
+                    assert(not val.m_value.array->empty());
+                    dump(val.m_value.array->back(), false, ensure_ascii, indent_step, current_indent);
+
+                    o->write_character(']');
+                }
+
+                return;
+            }
+
+            case value_t::string:
+            {
+                o->write_character('\"');
+                dump_escaped(*val.m_value.string, ensure_ascii);
+                o->write_character('\"');
+                return;
+            }
+
+            case value_t::boolean:
+            {
+                if (val.m_value.boolean)
+                {
+                    o->write_characters("true", 4);
+                }
+                else
+                {
+                    o->write_characters("false", 5);
+                }
+                return;
+            }
+
+            case value_t::number_integer:
+            {
+                dump_integer(val.m_value.number_integer);
+                return;
+            }
+
+            case value_t::number_unsigned:
+            {
+                dump_integer(val.m_value.number_unsigned);
+                return;
+            }
+
+            case value_t::number_float:
+            {
+                dump_float(val.m_value.number_float);
+                return;
+            }
+
+            case value_t::discarded:
+            {
+                o->write_characters("<discarded>", 11);
+                return;
+            }
+
+            case value_t::null:
+            {
+                o->write_characters("null", 4);
+                return;
+            }
+        }
+    }
+
+  private:
+    /*!
+    @brief dump escaped string
+
+    Escape a string by replacing certain special characters by a sequence of an
+    escape character (backslash) and another character and other control
+    characters by a sequence of "\u" followed by a four-digit hex
+    representation. The escaped string is written to output stream @a o.
+
+    @param[in] s  the string to escape
+    @param[in] ensure_ascii  whether to escape non-ASCII characters with
+                             \uXXXX sequences
+
+    @complexity Linear in the length of string @a s.
+    */
+    void dump_escaped(const string_t& s, const bool ensure_ascii)
+    {
+        uint32_t codepoint;
+        uint8_t state = UTF8_ACCEPT;
+        std::size_t bytes = 0;  // number of bytes written to string_buffer
+
+        for (std::size_t i = 0; i < s.size(); ++i)
+        {
+            const auto byte = static_cast<uint8_t>(s[i]);
+
+            switch (decode(state, codepoint, byte))
+            {
+                case UTF8_ACCEPT:  // decode found a new code point
+                {
+                    switch (codepoint)
+                    {
+                        case 0x08: // backspace
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'b';
+                            break;
+                        }
+
+                        case 0x09: // horizontal tab
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 't';
+                            break;
+                        }
+
+                        case 0x0A: // newline
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'n';
+                            break;
+                        }
+
+                        case 0x0C: // formfeed
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'f';
+                            break;
+                        }
+
+                        case 0x0D: // carriage return
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = 'r';
+                            break;
+                        }
+
+                        case 0x22: // quotation mark
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = '\"';
+                            break;
+                        }
+
+                        case 0x5C: // reverse solidus
+                        {
+                            string_buffer[bytes++] = '\\';
+                            string_buffer[bytes++] = '\\';
+                            break;
+                        }
+
+                        default:
+                        {
+                            // escape control characters (0x00..0x1F) or, if
+                            // ensure_ascii parameter is used, non-ASCII characters
+                            if ((codepoint <= 0x1F) or (ensure_ascii and (codepoint >= 0x7F)))
+                            {
+                                if (codepoint <= 0xFFFF)
+                                {
+                                    std::snprintf(string_buffer.data() + bytes, 7, "\\u%04x",
+                                                  static_cast<uint16_t>(codepoint));
+                                    bytes += 6;
+                                }
+                                else
+                                {
+                                    std::snprintf(string_buffer.data() + bytes, 13, "\\u%04x\\u%04x",
+                                                  static_cast<uint16_t>(0xD7C0 + (codepoint >> 10)),
+                                                  static_cast<uint16_t>(0xDC00 + (codepoint & 0x3FF)));
+                                    bytes += 12;
+                                }
+                            }
+                            else
+                            {
+                                // copy byte to buffer (all previous bytes
+                                // been copied have in default case above)
+                                string_buffer[bytes++] = s[i];
+                            }
+                            break;
+                        }
+                    }
+
+                    // write buffer and reset index; there must be 13 bytes
+                    // left, as this is the maximal number of bytes to be
+                    // written ("\uxxxx\uxxxx\0") for one code point
+                    if (string_buffer.size() - bytes < 13)
+                    {
+                        o->write_characters(string_buffer.data(), bytes);
+                        bytes = 0;
+                    }
+                    break;
+                }
+
+                case UTF8_REJECT:  // decode found invalid UTF-8 byte
+                {
+                    std::string sn(3, '\0');
+                    snprintf(&sn[0], sn.size(), "%.2X", byte);
+                    JSON_THROW(type_error::create(316, "invalid UTF-8 byte at index " + std::to_string(i) + ": 0x" + sn));
+                }
+
+                default:  // decode found yet incomplete multi-byte code point
+                {
+                    if (not ensure_ascii)
+                    {
+                        // code point will not be escaped - copy byte to buffer
+                        string_buffer[bytes++] = s[i];
+                    }
+                    break;
+                }
+            }
+        }
+
+        if (JSON_LIKELY(state == UTF8_ACCEPT))
+        {
+            // write buffer
+            if (bytes > 0)
+            {
+                o->write_characters(string_buffer.data(), bytes);
+            }
+        }
+        else
+        {
+            // we finish reading, but do not accept: string was incomplete
+            std::string sn(3, '\0');
+            snprintf(&sn[0], sn.size(), "%.2X", static_cast<uint8_t>(s.back()));
+            JSON_THROW(type_error::create(316, "incomplete UTF-8 string; last byte: 0x" + sn));
+        }
+    }
+
+    /*!
+    @brief dump an integer
+
+    Dump a given integer to output stream @a o. Works internally with
+    @a number_buffer.
+
+    @param[in] x  integer number (signed or unsigned) to dump
+    @tparam NumberType either @a number_integer_t or @a number_unsigned_t
+    */
+    template<typename NumberType, detail::enable_if_t<
+                 std::is_same<NumberType, number_unsigned_t>::value or
+                 std::is_same<NumberType, number_integer_t>::value,
+                 int> = 0>
+    void dump_integer(NumberType x)
+    {
+        // special case for "0"
+        if (x == 0)
+        {
+            o->write_character('0');
+            return;
+        }
+
+        const bool is_negative = (x <= 0) and (x != 0);  // see issue #755
+        std::size_t i = 0;
+
+        while (x != 0)
+        {
+            // spare 1 byte for '\0'
+            assert(i < number_buffer.size() - 1);
+
+            const auto digit = std::labs(static_cast<long>(x % 10));
+            number_buffer[i++] = static_cast<char>('0' + digit);
+            x /= 10;
+        }
+
+        if (is_negative)
+        {
+            // make sure there is capacity for the '-'
+            assert(i < number_buffer.size() - 2);
+            number_buffer[i++] = '-';
+        }
+
+        std::reverse(number_buffer.begin(), number_buffer.begin() + i);
+        o->write_characters(number_buffer.data(), i);
+    }
+
+    /*!
+    @brief dump a floating-point number
+
+    Dump a given floating-point number to output stream @a o. Works internally
+    with @a number_buffer.
+
+    @param[in] x  floating-point number to dump
+    */
+    void dump_float(number_float_t x)
+    {
+        // NaN / inf
+        if (not std::isfinite(x))
+        {
+            o->write_characters("null", 4);
+            return;
+        }
+
+        // If number_float_t is an IEEE-754 single or double precision number,
+        // use the Grisu2 algorithm to produce short numbers which are
+        // guaranteed to round-trip, using strtof and strtod, resp.
+        //
+        // NB: The test below works if <long double> == <double>.
+        static constexpr bool is_ieee_single_or_double
+            = (std::numeric_limits<number_float_t>::is_iec559 and std::numeric_limits<number_float_t>::digits == 24 and std::numeric_limits<number_float_t>::max_exponent == 128) or
+              (std::numeric_limits<number_float_t>::is_iec559 and std::numeric_limits<number_float_t>::digits == 53 and std::numeric_limits<number_float_t>::max_exponent == 1024);
+
+        dump_float(x, std::integral_constant<bool, is_ieee_single_or_double>());
+    }
+
+    void dump_float(number_float_t x, std::true_type /*is_ieee_single_or_double*/)
+    {
+        char* begin = number_buffer.data();
+        char* end = ::nlohmann::detail::to_chars(begin, begin + number_buffer.size(), x);
+
+        o->write_characters(begin, static_cast<size_t>(end - begin));
+    }
+
+    void dump_float(number_float_t x, std::false_type /*is_ieee_single_or_double*/)
+    {
+        // get number of digits for a float -> text -> float round-trip
+        static constexpr auto d = std::numeric_limits<number_float_t>::max_digits10;
+
+        // the actual conversion
+        std::ptrdiff_t len = snprintf(number_buffer.data(), number_buffer.size(), "%.*g", d, x);
+
+        // negative value indicates an error
+        assert(len > 0);
+        // check if buffer was large enough
+        assert(static_cast<std::size_t>(len) < number_buffer.size());
+
+        // erase thousands separator
+        if (thousands_sep != '\0')
+        {
+            const auto end = std::remove(number_buffer.begin(),
+                                         number_buffer.begin() + len, thousands_sep);
+            std::fill(end, number_buffer.end(), '\0');
+            assert((end - number_buffer.begin()) <= len);
+            len = (end - number_buffer.begin());
+        }
+
+        // convert decimal point to '.'
+        if (decimal_point != '\0' and decimal_point != '.')
+        {
+            const auto dec_pos = std::find(number_buffer.begin(), number_buffer.end(), decimal_point);
+            if (dec_pos != number_buffer.end())
+            {
+                *dec_pos = '.';
+            }
+        }
+
+        o->write_characters(number_buffer.data(), static_cast<std::size_t>(len));
+
+        // determine if need to append ".0"
+        const bool value_is_int_like =
+            std::none_of(number_buffer.begin(), number_buffer.begin() + len + 1,
+                         [](char c)
+        {
+            return (c == '.' or c == 'e');
+        });
+
+        if (value_is_int_like)
+        {
+            o->write_characters(".0", 2);
+        }
+    }
+
+    /*!
+    @brief check whether a string is UTF-8 encoded
+
+    The function checks each byte of a string whether it is UTF-8 encoded. The
+    result of the check is stored in the @a state parameter. The function must
+    be called initially with state 0 (accept). State 1 means the string must
+    be rejected, because the current byte is not allowed. If the string is
+    completely processed, but the state is non-zero, the string ended
+    prematurely; that is, the last byte indicated more bytes should have
+    followed.
+
+    @param[in,out] state  the state of the decoding
+    @param[in,out] codep  codepoint (valid only if resulting state is UTF8_ACCEPT)
+    @param[in] byte       next byte to decode
+    @return               new state
+
+    @note The function has been edited: a std::array is used.
+
+    @copyright Copyright (c) 2008-2009 Bjoern Hoehrmann <[email protected]>
+    @sa http://bjoern.hoehrmann.de/utf-8/decoder/dfa/
+    */
+    static uint8_t decode(uint8_t& state, uint32_t& codep, const uint8_t byte) noexcept
+    {
+        static const std::array<uint8_t, 400> utf8d =
+        {
+            {
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 00..1F
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 20..3F
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 40..5F
+                0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, // 60..7F
+                1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, // 80..9F
+                7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, // A0..BF
+                8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, // C0..DF
+                0xA, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x3, 0x4, 0x3, 0x3, // E0..EF
+                0xB, 0x6, 0x6, 0x6, 0x5, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, 0x8, // F0..FF
+                0x0, 0x1, 0x2, 0x3, 0x5, 0x8, 0x7, 0x1, 0x1, 0x1, 0x4, 0x6, 0x1, 0x1, 0x1, 0x1, // s0..s0
+                1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, // s1..s2
+                1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, // s3..s4
+                1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, // s5..s6
+                1, 3, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 // s7..s8
+            }
+        };
+
+        const uint8_t type = utf8d[byte];
+
+        codep = (state != UTF8_ACCEPT)
+                ? (byte & 0x3fu) | (codep << 6)
+                : static_cast<uint32_t>(0xff >> type) & (byte);
+
+        state = utf8d[256u + state * 16u + type];
+        return state;
+    }
+
+  private:
+    /// the output of the serializer
+    output_adapter_t<char> o = nullptr;
+
+    /// a (hopefully) large enough character buffer
+    std::array<char, 64> number_buffer{{}};
+
+    /// the locale
+    const std::lconv* loc = nullptr;
+    /// the locale's thousand separator character
+    const char thousands_sep = '\0';
+    /// the locale's decimal point character
+    const char decimal_point = '\0';
+
+    /// string buffer
+    std::array<char, 512> string_buffer{{}};
+
+    /// the indentation character
+    const char indent_char;
+    /// the indentation string
+    string_t indent_string;
+};
+}
+}
+
+// #include <nlohmann/detail/json_ref.hpp>
+
+
+#include <initializer_list>
+#include <utility>
+
+namespace nlohmann
+{
+namespace detail
+{
+template<typename BasicJsonType>
+class json_ref
+{
+  public:
+    using value_type = BasicJsonType;
+
+    json_ref(value_type&& value)
+        : owned_value(std::move(value)), value_ref(&owned_value), is_rvalue(true)
+    {}
+
+    json_ref(const value_type& value)
+        : value_ref(const_cast<value_type*>(&value)), is_rvalue(false)
+    {}
+
+    json_ref(std::initializer_list<json_ref> init)
+        : owned_value(init), value_ref(&owned_value), is_rvalue(true)
+    {}
+
+    template<class... Args>
+    json_ref(Args&& ... args)
+        : owned_value(std::forward<Args>(args)...), value_ref(&owned_value), is_rvalue(true)
+    {}
+
+    // class should be movable only
+    json_ref(json_ref&&) = default;
+    json_ref(const json_ref&) = delete;
+    json_ref& operator=(const json_ref&) = delete;
+
+    value_type moved_or_copied() const
+    {
+        if (is_rvalue)
+        {
+            return std::move(*value_ref);
+        }
+        return *value_ref;
+    }
+
+    value_type const& operator*() const
+    {
+        return *static_cast<value_type const*>(value_ref);
+    }
+
+    value_type const* operator->() const
+    {
+        return static_cast<value_type const*>(value_ref);
+    }
+
+  private:
+    mutable value_type owned_value = nullptr;
+    value_type* value_ref = nullptr;
+    const bool is_rvalue;
+};
+}
+}
+
+// #include <nlohmann/detail/json_pointer.hpp>
+
+
+#include <cassert> // assert
+#include <numeric> // accumulate
+#include <string> // string
+#include <vector> // vector
+
+// #include <nlohmann/detail/macro_scope.hpp>
+
+// #include <nlohmann/detail/exceptions.hpp>
+
+// #include <nlohmann/detail/value_t.hpp>
+
+
+namespace nlohmann
+{
+template<typename BasicJsonType>
+class json_pointer
+{
+    // allow basic_json to access private members
+    NLOHMANN_BASIC_JSON_TPL_DECLARATION
+    friend class basic_json;
+
+  public:
+    /*!
+    @brief create JSON pointer
+
+    Create a JSON pointer according to the syntax described in
+    [Section 3 of RFC6901](https://tools.ietf.org/html/rfc6901#section-3).
+
+    @param[in] s  string representing the JSON pointer; if omitted, the empty
+                  string is assumed which references the whole JSON value
+
+    @throw parse_error.107 if the given JSON pointer @a s is nonempty and does
+                           not begin with a slash (`/`); see example below
+
+    @throw parse_error.108 if a tilde (`~`) in the given JSON pointer @a s is
+    not followed by `0` (representing `~`) or `1` (representing `/`); see
+    example below
+
+    @liveexample{The example shows the construction several valid JSON pointers
+    as well as the exceptional behavior.,json_pointer}
+
+    @since version 2.0.0
+    */
+    explicit json_pointer(const std::string& s = "")
+        : reference_tokens(split(s))
+    {}
+
+    /*!
+    @brief return a string representation of the JSON pointer
+
+    @invariant For each JSON pointer `ptr`, it holds:
+    @code {.cpp}
+    ptr == json_pointer(ptr.to_string());
+    @endcode
+
+    @return a string representation of the JSON pointer
+
+    @liveexample{The example shows the result of `to_string`.,
+    json_pointer__to_string}
+
+    @since version 2.0.0
+    */
+    std::string to_string() const noexcept
+    {
+        return std::accumulate(reference_tokens.begin(), reference_tokens.end(),
+                               std::string{},
+                               [](const std::string & a, const std::string & b)
+        {
+            return a + "/" + escape(b);
+        });
+    }
+
+    /// @copydoc to_string()
+    operator std::string() const
+    {
+        return to_string();
+    }
+
+    /*!
+    @param[in] s  reference token to be converted into an array index
+
+    @return integer representation of @a s
+
+    @throw out_of_range.404 if string @a s could not be converted to an integer
+    */
+    static int array_index(const std::string& s)
+    {
+        std::size_t processed_chars = 0;
+        const int res = std::stoi(s, &processed_chars);
+
+        // check if the string was completely read
+        if (JSON_UNLIKELY(processed_chars != s.size()))
+        {
+            JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + s + "'"));
+        }
+
+        return res;
+    }
+
+  private:
+    /*!
+    @brief remove and return last reference pointer
+    @throw out_of_range.405 if JSON pointer has no parent
+    */
+    std::string pop_back()
+    {
+        if (JSON_UNLIKELY(is_root()))
+        {
+            JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent"));
+        }
+
+        auto last = reference_tokens.back();
+        reference_tokens.pop_back();
+        return last;
+    }
+
+    /// return whether pointer points to the root document
+    bool is_root() const
+    {
+        return reference_tokens.empty();
+    }
+
+    json_pointer top() const
+    {
+        if (JSON_UNLIKELY(is_root()))
+        {
+            JSON_THROW(detail::out_of_range::create(405, "JSON pointer has no parent"));
+        }
+
+        json_pointer result = *this;
+        result.reference_tokens = {reference_tokens[0]};
+        return result;
+    }
+
+    /*!
+    @brief create and return a reference to the pointed to value
+
+    @complexity Linear in the number of reference tokens.
+
+    @throw parse_error.109 if array index is not a number
+    @throw type_error.313 if value cannot be unflattened
+    */
+    BasicJsonType& get_and_create(BasicJsonType& j) const
+    {
+        using size_type = typename BasicJsonType::size_type;
+        auto result = &j;
+
+        // in case no reference tokens exist, return a reference to the JSON value
+        // j which will be overwritten by a primitive value
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (result->m_type)
+            {
+                case detail::value_t::null:
+                {
+                    if (reference_token == "0")
+                    {
+                        // start a new array if reference token is 0
+                        result = &result->operator[](0);
+                    }
+                    else
+                    {
+                        // start a new object otherwise
+                        result = &result->operator[](reference_token);
+                    }
+                    break;
+                }
+
+                case detail::value_t::object:
+                {
+                    // create an entry in the object
+                    result = &result->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    // create an entry in the array
+                    JSON_TRY
+                    {
+                        result = &result->operator[](static_cast<size_type>(array_index(reference_token)));
+                    }
+                    JSON_CATCH(std::invalid_argument&)
+                    {
+                        JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number"));
+                    }
+                    break;
+                }
+
+                /*
+                The following code is only reached if there exists a reference
+                token _and_ the current value is primitive. In this case, we have
+                an error situation, because primitive values may only occur as
+                single value; that is, with an empty list of reference tokens.
+                */
+                default:
+                    JSON_THROW(detail::type_error::create(313, "invalid value to unflatten"));
+            }
+        }
+
+        return *result;
+    }
+
+    /*!
+    @brief return a reference to the pointed to value
+
+    @note This version does not throw if a value is not present, but tries to
+          create nested values instead. For instance, calling this function
+          with pointer `"/this/that"` on a null value is equivalent to calling
+          `operator[]("this").operator[]("that")` on that value, effectively
+          changing the null value to an object.
+
+    @param[in] ptr  a JSON value
+
+    @return reference to the JSON value pointed to by the JSON pointer
+
+    @complexity Linear in the length of the JSON pointer.
+
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    BasicJsonType& get_unchecked(BasicJsonType* ptr) const
+    {
+        using size_type = typename BasicJsonType::size_type;
+        for (const auto& reference_token : reference_tokens)
+        {
+            // convert null values to arrays or objects before continuing
+            if (ptr->m_type == detail::value_t::null)
+            {
+                // check if reference token is a number
+                const bool nums =
+                    std::all_of(reference_token.begin(), reference_token.end(),
+                                [](const char x)
+                {
+                    return (x >= '0' and x <= '9');
+                });
+
+                // change value to array for numbers or "-" or to object otherwise
+                *ptr = (nums or reference_token == "-")
+                       ? detail::value_t::array
+                       : detail::value_t::object;
+            }
+
+            switch (ptr->m_type)
+            {
+                case detail::value_t::object:
+                {
+                    // use unchecked object access
+                    ptr = &ptr->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    // error condition (cf. RFC 6901, Sect. 4)
+                    if (JSON_UNLIKELY(reference_token.size() > 1 and reference_token[0] == '0'))
+                    {
+                        JSON_THROW(detail::parse_error::create(106, 0,
+                                                               "array index '" + reference_token +
+                                                               "' must not begin with '0'"));
+                    }
+
+                    if (reference_token == "-")
+                    {
+                        // explicitly treat "-" as index beyond the end
+                        ptr = &ptr->operator[](ptr->m_value.array->size());
+                    }
+                    else
+                    {
+                        // convert array index to number; unchecked access
+                        JSON_TRY
+                        {
+                            ptr = &ptr->operator[](
+                                static_cast<size_type>(array_index(reference_token)));
+                        }
+                        JSON_CATCH(std::invalid_argument&)
+                        {
+                            JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number"));
+                        }
+                    }
+                    break;
+                }
+
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'"));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    BasicJsonType& get_checked(BasicJsonType* ptr) const
+    {
+        using size_type = typename BasicJsonType::size_type;
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->m_type)
+            {
+                case detail::value_t::object:
+                {
+                    // note: at performs range check
+                    ptr = &ptr->at(reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" always fails the range check
+                        JSON_THROW(detail::out_of_range::create(402,
+                                                                "array index '-' (" + std::to_string(ptr->m_value.array->size()) +
+                                                                ") is out of range"));
+                    }
+
+                    // error condition (cf. RFC 6901, Sect. 4)
+                    if (JSON_UNLIKELY(reference_token.size() > 1 and reference_token[0] == '0'))
+                    {
+                        JSON_THROW(detail::parse_error::create(106, 0,
+                                                               "array index '" + reference_token +
+                                                               "' must not begin with '0'"));
+                    }
+
+                    // note: at performs range check
+                    JSON_TRY
+                    {
+                        ptr = &ptr->at(static_cast<size_type>(array_index(reference_token)));
+                    }
+                    JSON_CATCH(std::invalid_argument&)
+                    {
+                        JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number"));
+                    }
+                    break;
+                }
+
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'"));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @brief return a const reference to the pointed to value
+
+    @param[in] ptr  a JSON value
+
+    @return const reference to the JSON value pointed to by the JSON
+    pointer
+
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    const BasicJsonType& get_unchecked(const BasicJsonType* ptr) const
+    {
+        using size_type = typename BasicJsonType::size_type;
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->m_type)
+            {
+                case detail::value_t::object:
+                {
+                    // use unchecked object access
+                    ptr = &ptr->operator[](reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" cannot be used for const access
+                        JSON_THROW(detail::out_of_range::create(402,
+                                                                "array index '-' (" + std::to_string(ptr->m_value.array->size()) +
+                                                                ") is out of range"));
+                    }
+
+                    // error condition (cf. RFC 6901, Sect. 4)
+                    if (JSON_UNLIKELY(reference_token.size() > 1 and reference_token[0] == '0'))
+                    {
+                        JSON_THROW(detail::parse_error::create(106, 0,
+                                                               "array index '" + reference_token +
+                                                               "' must not begin with '0'"));
+                    }
+
+                    // use unchecked array access
+                    JSON_TRY
+                    {
+                        ptr = &ptr->operator[](
+                            static_cast<size_type>(array_index(reference_token)));
+                    }
+                    JSON_CATCH(std::invalid_argument&)
+                    {
+                        JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number"));
+                    }
+                    break;
+                }
+
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'"));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+    */
+    const BasicJsonType& get_checked(const BasicJsonType* ptr) const
+    {
+        using size_type = typename BasicJsonType::size_type;
+        for (const auto& reference_token : reference_tokens)
+        {
+            switch (ptr->m_type)
+            {
+                case detail::value_t::object:
+                {
+                    // note: at performs range check
+                    ptr = &ptr->at(reference_token);
+                    break;
+                }
+
+                case detail::value_t::array:
+                {
+                    if (JSON_UNLIKELY(reference_token == "-"))
+                    {
+                        // "-" always fails the range check
+                        JSON_THROW(detail::out_of_range::create(402,
+                                                                "array index '-' (" + std::to_string(ptr->m_value.array->size()) +
+                                                                ") is out of range"));
+                    }
+
+                    // error condition (cf. RFC 6901, Sect. 4)
+                    if (JSON_UNLIKELY(reference_token.size() > 1 and reference_token[0] == '0'))
+                    {
+                        JSON_THROW(detail::parse_error::create(106, 0,
+                                                               "array index '" + reference_token +
+                                                               "' must not begin with '0'"));
+                    }
+
+                    // note: at performs range check
+                    JSON_TRY
+                    {
+                        ptr = &ptr->at(static_cast<size_type>(array_index(reference_token)));
+                    }
+                    JSON_CATCH(std::invalid_argument&)
+                    {
+                        JSON_THROW(detail::parse_error::create(109, 0, "array index '" + reference_token + "' is not a number"));
+                    }
+                    break;
+                }
+
+                default:
+                    JSON_THROW(detail::out_of_range::create(404, "unresolved reference token '" + reference_token + "'"));
+            }
+        }
+
+        return *ptr;
+    }
+
+    /*!
+    @brief split the string input to reference tokens
+
+    @note This function is only called by the json_pointer constructor.
+          All exceptions below are documented there.
+
+    @throw parse_error.107  if the pointer is not empty or begins with '/'
+    @throw parse_error.108  if character '~' is not followed by '0' or '1'
+    */
+    static std::vector<std::string> split(const std::string& reference_string)
+    {
+        std::vector<std::string> result;
+
+        // special case: empty reference string -> no reference tokens
+        if (reference_string.empty())
+        {
+            return result;
+        }
+
+        // check if nonempty reference string begins with slash
+        if (JSON_UNLIKELY(reference_string[0] != '/'))
+        {
+            JSON_THROW(detail::parse_error::create(107, 1,
+                                                   "JSON pointer must be empty or begin with '/' - was: '" +
+                                                   reference_string + "'"));
+        }
+
+        // extract the reference tokens:
+        // - slash: position of the last read slash (or end of string)
+        // - start: position after the previous slash
+        for (
+            // search for the first slash after the first character
+            std::size_t slash = reference_string.find_first_of('/', 1),
+            // set the beginning of the first reference token
+            start = 1;
+            // we can stop if start == string::npos+1 = 0
+            start != 0;
+            // set the beginning of the next reference token
+            // (will eventually be 0 if slash == std::string::npos)
+            start = slash + 1,
+            // find next slash
+            slash = reference_string.find_first_of('/', start))
+        {
+            // use the text between the beginning of the reference token
+            // (start) and the last slash (slash).
+            auto reference_token = reference_string.substr(start, slash - start);
+
+            // check reference tokens are properly escaped
+            for (std::size_t pos = reference_token.find_first_of('~');
+                    pos != std::string::npos;
+                    pos = reference_token.find_first_of('~', pos + 1))
+            {
+                assert(reference_token[pos] == '~');
+
+                // ~ must be followed by 0 or 1
+                if (JSON_UNLIKELY(pos == reference_token.size() - 1 or
+                                  (reference_token[pos + 1] != '0' and
+                                   reference_token[pos + 1] != '1')))
+                {
+                    JSON_THROW(detail::parse_error::create(108, 0, "escape character '~' must be followed with '0' or '1'"));
+                }
+            }
+
+            // finally, store the reference token
+            unescape(reference_token);
+            result.push_back(reference_token);
+        }
+
+        return result;
+    }
+
+    /*!
+    @brief replace all occurrences of a substring by another string
+
+    @param[in,out] s  the string to manipulate; changed so that all
+                   occurrences of @a f are replaced with @a t
+    @param[in]     f  the substring to replace with @a t
+    @param[in]     t  the string to replace @a f
+
+    @pre The search string @a f must not be empty. **This precondition is
+    enforced with an assertion.**
+
+    @since version 2.0.0
+    */
+    static void replace_substring(std::string& s, const std::string& f,
+                                  const std::string& t)
+    {
+        assert(not f.empty());
+        for (auto pos = s.find(f);                // find first occurrence of f
+                pos != std::string::npos;         // make sure f was found
+                s.replace(pos, f.size(), t),      // replace with t, and
+                pos = s.find(f, pos + t.size()))  // find next occurrence of f
+        {}
+    }
+
+    /// escape "~"" to "~0" and "/" to "~1"
+    static std::string escape(std::string s)
+    {
+        replace_substring(s, "~", "~0");
+        replace_substring(s, "/", "~1");
+        return s;
+    }
+
+    /// unescape "~1" to tilde and "~0" to slash (order is important!)
+    static void unescape(std::string& s)
+    {
+        replace_substring(s, "~1", "/");
+        replace_substring(s, "~0", "~");
+    }
+
+    /*!
+    @param[in] reference_string  the reference string to the current value
+    @param[in] value             the value to consider
+    @param[in,out] result        the result object to insert values to
+
+    @note Empty objects or arrays are flattened to `null`.
+    */
+    static void flatten(const std::string& reference_string,
+                        const BasicJsonType& value,
+                        BasicJsonType& result)
+    {
+        switch (value.m_type)
+        {
+            case detail::value_t::array:
+            {
+                if (value.m_value.array->empty())
+                {
+                    // flatten empty array as null
+                    result[reference_string] = nullptr;
+                }
+                else
+                {
+                    // iterate array and use index as reference string
+                    for (std::size_t i = 0; i < value.m_value.array->size(); ++i)
+                    {
+                        flatten(reference_string + "/" + std::to_string(i),
+                                value.m_value.array->operator[](i), result);
+                    }
+                }
+                break;
+            }
+
+            case detail::value_t::object:
+            {
+                if (value.m_value.object->empty())
+                {
+                    // flatten empty object as null
+                    result[reference_string] = nullptr;
+                }
+                else
+                {
+                    // iterate object and use keys as reference string
+                    for (const auto& element : *value.m_value.object)
+                    {
+                        flatten(reference_string + "/" + escape(element.first), element.second, result);
+                    }
+                }
+                break;
+            }
+
+            default:
+            {
+                // add primitive value with its reference string
+                result[reference_string] = value;
+                break;
+            }
+        }
+    }
+
+    /*!
+    @param[in] value  flattened JSON
+
+    @return unflattened JSON
+
+    @throw parse_error.109 if array index is not a number
+    @throw type_error.314  if value is not an object
+    @throw type_error.315  if object values are not primitive
+    @throw type_error.313  if value cannot be unflattened
+    */
+    static BasicJsonType
+    unflatten(const BasicJsonType& value)
+    {
+        if (JSON_UNLIKELY(not value.is_object()))
+        {
+            JSON_THROW(detail::type_error::create(314, "only objects can be unflattened"));
+        }
+
+        BasicJsonType result;
+
+        // iterate the JSON object values
+        for (const auto& element : *value.m_value.object)
+        {
+            if (JSON_UNLIKELY(not element.second.is_primitive()))
+            {
+                JSON_THROW(detail::type_error::create(315, "values in object must be primitive"));
+            }
+
+            // assign value to reference pointed to by JSON pointer; Note that if
+            // the JSON pointer is "" (i.e., points to the whole value), function
+            // get_and_create returns a reference to result itself. An assignment
+            // will then create a primitive value.
+            json_pointer(element.first).get_and_create(result) = element.second;
+        }
+
+        return result;
+    }
+
+    friend bool operator==(json_pointer const& lhs,
+                           json_pointer const& rhs) noexcept
+    {
+        return (lhs.reference_tokens == rhs.reference_tokens);
+    }
+
+    friend bool operator!=(json_pointer const& lhs,
+                           json_pointer const& rhs) noexcept
+    {
+        return not (lhs == rhs);
+    }
+
+    /// the reference tokens
+    std::vector<std::string> reference_tokens;
+};
+}
+
+// #include <nlohmann/adl_serializer.hpp>
+
+
+#include <utility>
+
+// #include <nlohmann/detail/conversions/from_json.hpp>
+
+// #include <nlohmann/detail/conversions/to_json.hpp>
+
+
+namespace nlohmann
+{
+template<typename, typename>
+struct adl_serializer
+{
+    /*!
+    @brief convert a JSON value to any value type
+
+    This function is usually called by the `get()` function of the
+    @ref basic_json class (either explicit or via conversion operators).
+
+    @param[in] j         JSON value to read from
+    @param[in,out] val  value to write to
+    */
+    template<typename BasicJsonType, typename ValueType>
+    static void from_json(BasicJsonType&& j, ValueType& val) noexcept(
+        noexcept(::nlohmann::from_json(std::forward<BasicJsonType>(j), val)))
+    {
+        ::nlohmann::from_json(std::forward<BasicJsonType>(j), val);
+    }
+
+    /*!
+    @brief convert any value type to a JSON value
+
+    This function is usually called by the constructors of the @ref basic_json
+    class.
+
+    @param[in,out] j  JSON value to write to
+    @param[in] val     value to read from
+    */
+    template<typename BasicJsonType, typename ValueType>
+    static void to_json(BasicJsonType& j, ValueType&& val) noexcept(
+        noexcept(::nlohmann::to_json(j, std::forward<ValueType>(val))))
+    {
+        ::nlohmann::to_json(j, std::forward<ValueType>(val));
+    }
+};
+}
+
+
+/*!
+@brief namespace for Niels Lohmann
+@see https://github.com/nlohmann
+@since version 1.0.0
+*/
+namespace nlohmann
+{
+
+/*!
+@brief a class to store JSON values
+
+@tparam ObjectType type for JSON objects (`std::map` by default; will be used
+in @ref object_t)
+@tparam ArrayType type for JSON arrays (`std::vector` by default; will be used
+in @ref array_t)
+@tparam StringType type for JSON strings and object keys (`std::string` by
+default; will be used in @ref string_t)
+@tparam BooleanType type for JSON booleans (`bool` by default; will be used
+in @ref boolean_t)
+@tparam NumberIntegerType type for JSON integer numbers (`int64_t` by
+default; will be used in @ref number_integer_t)
+@tparam NumberUnsignedType type for JSON unsigned integer numbers (@c
+`uint64_t` by default; will be used in @ref number_unsigned_t)
+@tparam NumberFloatType type for JSON floating-point numbers (`double` by
+default; will be used in @ref number_float_t)
+@tparam AllocatorType type of the allocator to use (`std::allocator` by
+default)
+@tparam JSONSerializer the serializer to resolve internal calls to `to_json()`
+and `from_json()` (@ref adl_serializer by default)
+
+@requirement The class satisfies the following concept requirements:
+- Basic
+ - [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible):
+   JSON values can be default constructed. The result will be a JSON null
+   value.
+ - [MoveConstructible](https://en.cppreference.com/w/cpp/named_req/MoveConstructible):
+   A JSON value can be constructed from an rvalue argument.
+ - [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible):
+   A JSON value can be copy-constructed from an lvalue expression.
+ - [MoveAssignable](https://en.cppreference.com/w/cpp/named_req/MoveAssignable):
+   A JSON value van be assigned from an rvalue argument.
+ - [CopyAssignable](https://en.cppreference.com/w/cpp/named_req/CopyAssignable):
+   A JSON value can be copy-assigned from an lvalue expression.
+ - [Destructible](https://en.cppreference.com/w/cpp/named_req/Destructible):
+   JSON values can be destructed.
+- Layout
+ - [StandardLayoutType](https://en.cppreference.com/w/cpp/named_req/StandardLayoutType):
+   JSON values have
+   [standard layout](https://en.cppreference.com/w/cpp/language/data_members#Standard_layout):
+   All non-static data members are private and standard layout types, the
+   class has no virtual functions or (virtual) base classes.
+- Library-wide
+ - [EqualityComparable](https://en.cppreference.com/w/cpp/named_req/EqualityComparable):
+   JSON values can be compared with `==`, see @ref
+   operator==(const_reference,const_reference).
+ - [LessThanComparable](https://en.cppreference.com/w/cpp/named_req/LessThanComparable):
+   JSON values can be compared with `<`, see @ref
+   operator<(const_reference,const_reference).
+ - [Swappable](https://en.cppreference.com/w/cpp/named_req/Swappable):
+   Any JSON lvalue or rvalue of can be swapped with any lvalue or rvalue of
+   other compatible types, using unqualified function call @ref swap().
+ - [NullablePointer](https://en.cppreference.com/w/cpp/named_req/NullablePointer):
+   JSON values can be compared against `std::nullptr_t` objects which are used
+   to model the `null` value.
+- Container
+ - [Container](https://en.cppreference.com/w/cpp/named_req/Container):
+   JSON values can be used like STL containers and provide iterator access.
+ - [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer);
+   JSON values can be used like STL containers and provide reverse iterator
+   access.
+
+@invariant The member variables @a m_value and @a m_type have the following
+relationship:
+- If `m_type == value_t::object`, then `m_value.object != nullptr`.
+- If `m_type == value_t::array`, then `m_value.array != nullptr`.
+- If `m_type == value_t::string`, then `m_value.string != nullptr`.
+The invariants are checked by member function assert_invariant().
+
+@internal
+@note ObjectType trick from http://stackoverflow.com/a/9860911
+@endinternal
+
+@see [RFC 7159: The JavaScript Object Notation (JSON) Data Interchange
+Format](http://rfc7159.net/rfc7159)
+
+@since version 1.0.0
+
+@nosubgrouping
+*/
+NLOHMANN_BASIC_JSON_TPL_DECLARATION
+class basic_json
+{
+  private:
+    template<detail::value_t> friend struct detail::external_constructor;
+    friend ::nlohmann::json_pointer<basic_json>;
+    friend ::nlohmann::detail::parser<basic_json>;
+    friend ::nlohmann::detail::serializer<basic_json>;
+    template<typename BasicJsonType>
+    friend class ::nlohmann::detail::iter_impl;
+    template<typename BasicJsonType, typename CharType>
+    friend class ::nlohmann::detail::binary_writer;
+    template<typename BasicJsonType, typename SAX>
+    friend class ::nlohmann::detail::binary_reader;
+    template<typename BasicJsonType>
+    friend class ::nlohmann::detail::json_sax_dom_parser;
+    template<typename BasicJsonType>
+    friend class ::nlohmann::detail::json_sax_dom_callback_parser;
+
+    /// workaround type for MSVC
+    using basic_json_t = NLOHMANN_BASIC_JSON_TPL;
+
+    // convenience aliases for types residing in namespace detail;
+    using lexer = ::nlohmann::detail::lexer<basic_json>;
+    using parser = ::nlohmann::detail::parser<basic_json>;
+
+    using primitive_iterator_t = ::nlohmann::detail::primitive_iterator_t;
+    template<typename BasicJsonType>
+    using internal_iterator = ::nlohmann::detail::internal_iterator<BasicJsonType>;
+    template<typename BasicJsonType>
+    using iter_impl = ::nlohmann::detail::iter_impl<BasicJsonType>;
+    template<typename Iterator>
+    using iteration_proxy = ::nlohmann::detail::iteration_proxy<Iterator>;
+    template<typename Base> using json_reverse_iterator = ::nlohmann::detail::json_reverse_iterator<Base>;
+
+    template<typename CharType>
+    using output_adapter_t = ::nlohmann::detail::output_adapter_t<CharType>;
+
+    using binary_reader = ::nlohmann::detail::binary_reader<basic_json>;
+    template<typename CharType> using binary_writer = ::nlohmann::detail::binary_writer<basic_json, CharType>;
+
+    using serializer = ::nlohmann::detail::serializer<basic_json>;
+
+  public:
+    using value_t = detail::value_t;
+    /// JSON Pointer, see @ref nlohmann::json_pointer
+    using json_pointer = ::nlohmann::json_pointer<basic_json>;
+    template<typename T, typename SFINAE>
+    using json_serializer = JSONSerializer<T, SFINAE>;
+    /// helper type for initializer lists of basic_json values
+    using initializer_list_t = std::initializer_list<detail::json_ref<basic_json>>;
+
+    using input_format_t = detail::input_format_t;
+    /// SAX interface type, see @ref nlohmann::json_sax
+    using json_sax_t = json_sax<basic_json>;
+
+    ////////////////
+    // exceptions //
+    ////////////////
+
+    /// @name exceptions
+    /// Classes to implement user-defined exceptions.
+    /// @{
+
+    /// @copydoc detail::exception
+    using exception = detail::exception;
+    /// @copydoc detail::parse_error
+    using parse_error = detail::parse_error;
+    /// @copydoc detail::invalid_iterator
+    using invalid_iterator = detail::invalid_iterator;
+    /// @copydoc detail::type_error
+    using type_error = detail::type_error;
+    /// @copydoc detail::out_of_range
+    using out_of_range = detail::out_of_range;
+    /// @copydoc detail::other_error
+    using other_error = detail::other_error;
+
+    /// @}
+
+
+    /////////////////////
+    // container types //
+    /////////////////////
+
+    /// @name container types
+    /// The canonic container types to use @ref basic_json like any other STL
+    /// container.
+    /// @{
+
+    /// the type of elements in a basic_json container
+    using value_type = basic_json;
+
+    /// the type of an element reference
+    using reference = value_type&;
+    /// the type of an element const reference
+    using const_reference = const value_type&;
+
+    /// a type to represent differences between iterators
+    using difference_type = std::ptrdiff_t;
+    /// a type to represent container sizes
+    using size_type = std::size_t;
+
+    /// the allocator type
+    using allocator_type = AllocatorType<basic_json>;
+
+    /// the type of an element pointer
+    using pointer = typename std::allocator_traits<allocator_type>::pointer;
+    /// the type of an element const pointer
+    using const_pointer = typename std::allocator_traits<allocator_type>::const_pointer;
+
+    /// an iterator for a basic_json container
+    using iterator = iter_impl<basic_json>;
+    /// a const iterator for a basic_json container
+    using const_iterator = iter_impl<const basic_json>;
+    /// a reverse iterator for a basic_json container
+    using reverse_iterator = json_reverse_iterator<typename basic_json::iterator>;
+    /// a const reverse iterator for a basic_json container
+    using const_reverse_iterator = json_reverse_iterator<typename basic_json::const_iterator>;
+
+    /// @}
+
+
+    /*!
+    @brief returns the allocator associated with the container
+    */
+    static allocator_type get_allocator()
+    {
+        return allocator_type();
+    }
+
+    /*!
+    @brief returns version information on the library
+
+    This function returns a JSON object with information about the library,
+    including the version number and information on the platform and compiler.
+
+    @return JSON object holding version information
+    key         | description
+    ----------- | ---------------
+    `compiler`  | Information on the used compiler. It is an object with the following keys: `c++` (the used C++ standard), `family` (the compiler family; possible values are `clang`, `icc`, `gcc`, `ilecpp`, `msvc`, `pgcpp`, `sunpro`, and `unknown`), and `version` (the compiler version).
+    `copyright` | The copyright line for the library as string.
+    `name`      | The name of the library as string.
+    `platform`  | The used platform as string. Possible values are `win32`, `linux`, `apple`, `unix`, and `unknown`.
+    `url`       | The URL of the project as string.
+    `version`   | The version of the library. It is an object with the following keys: `major`, `minor`, and `patch` as defined by [Semantic Versioning](http://semver.org), and `string` (the version string).
+
+    @liveexample{The following code shows an example output of the `meta()`
+    function.,meta}
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes to any JSON value.
+
+    @complexity Constant.
+
+    @since 2.1.0
+    */
+    static basic_json meta()
+    {
+        basic_json result;
+
+        result["copyright"] = "(C) 2013-2017 Niels Lohmann";
+        result["name"] = "JSON for Modern C++";
+        result["url"] = "https://github.com/nlohmann/json";
+        result["version"]["string"] =
+            std::to_string(NLOHMANN_JSON_VERSION_MAJOR) + "." +
+            std::to_string(NLOHMANN_JSON_VERSION_MINOR) + "." +
+            std::to_string(NLOHMANN_JSON_VERSION_PATCH);
+        result["version"]["major"] = NLOHMANN_JSON_VERSION_MAJOR;
+        result["version"]["minor"] = NLOHMANN_JSON_VERSION_MINOR;
+        result["version"]["patch"] = NLOHMANN_JSON_VERSION_PATCH;
+
+#ifdef _WIN32
+        result["platform"] = "win32";
+#elif defined __linux__
+        result["platform"] = "linux";
+#elif defined __APPLE__
+        result["platform"] = "apple";
+#elif defined __unix__
+        result["platform"] = "unix";
+#else
+        result["platform"] = "unknown";
+#endif
+
+#if defined(__ICC) || defined(__INTEL_COMPILER)
+        result["compiler"] = {{"family", "icc"}, {"version", __INTEL_COMPILER}};
+#elif defined(__clang__)
+        result["compiler"] = {{"family", "clang"}, {"version", __clang_version__}};
+#elif defined(__GNUC__) || defined(__GNUG__)
+        result["compiler"] = {{"family", "gcc"}, {"version", std::to_string(__GNUC__) + "." + std::to_string(__GNUC_MINOR__) + "." + std::to_string(__GNUC_PATCHLEVEL__)}};
+#elif defined(__HP_cc) || defined(__HP_aCC)
+        result["compiler"] = "hp"
+#elif defined(__IBMCPP__)
+        result["compiler"] = {{"family", "ilecpp"}, {"version", __IBMCPP__}};
+#elif defined(_MSC_VER)
+        result["compiler"] = {{"family", "msvc"}, {"version", _MSC_VER}};
+#elif defined(__PGI)
+        result["compiler"] = {{"family", "pgcpp"}, {"version", __PGI}};
+#elif defined(__SUNPRO_CC)
+        result["compiler"] = {{"family", "sunpro"}, {"version", __SUNPRO_CC}};
+#else
+        result["compiler"] = {{"family", "unknown"}, {"version", "unknown"}};
+#endif
+
+#ifdef __cplusplus
+        result["compiler"]["c++"] = std::to_string(__cplusplus);
+#else
+        result["compiler"]["c++"] = "unknown";
+#endif
+        return result;
+    }
+
+
+    ///////////////////////////
+    // JSON value data types //
+    ///////////////////////////
+
+    /// @name JSON value data types
+    /// The data types to store a JSON value. These types are derived from
+    /// the template arguments passed to class @ref basic_json.
+    /// @{
+
+#if defined(JSON_HAS_CPP_14)
+    // Use transparent comparator if possible, combined with perfect forwarding
+    // on find() and count() calls prevents unnecessary string construction.
+    using object_comparator_t = std::less<>;
+#else
+    using object_comparator_t = std::less<StringType>;
+#endif
+
+    /*!
+    @brief a type for an object
+
+    [RFC 7159](http://rfc7159.net/rfc7159) describes JSON objects as follows:
+    > An object is an unordered collection of zero or more name/value pairs,
+    > where a name is a string and a value is a string, number, boolean, null,
+    > object, or array.
+
+    To store objects in C++, a type is defined by the template parameters
+    described below.
+
+    @tparam ObjectType  the container to store objects (e.g., `std::map` or
+    `std::unordered_map`)
+    @tparam StringType the type of the keys or names (e.g., `std::string`).
+    The comparison function `std::less<StringType>` is used to order elements
+    inside the container.
+    @tparam AllocatorType the allocator to use for objects (e.g.,
+    `std::allocator`)
+
+    #### Default type
+
+    With the default values for @a ObjectType (`std::map`), @a StringType
+    (`std::string`), and @a AllocatorType (`std::allocator`), the default
+    value for @a object_t is:
+
+    @code {.cpp}
+    std::map<
+      std::string, // key_type
+      basic_json, // value_type
+      std::less<std::string>, // key_compare
+      std::allocator<std::pair<const std::string, basic_json>> // allocator_type
+    >
+    @endcode
+
+    #### Behavior
+
+    The choice of @a object_t influences the behavior of the JSON class. With
+    the default type, objects have the following behavior:
+
+    - When all names are unique, objects will be interoperable in the sense
+      that all software implementations receiving that object will agree on
+      the name-value mappings.
+    - When the names within an object are not unique, it is unspecified which
+      one of the values for a given key will be chosen. For instance,
+      `{"key": 2, "key": 1}` could be equal to either `{"key": 1}` or
+      `{"key": 2}`.
+    - Internally, name/value pairs are stored in lexicographical order of the
+      names. Objects will also be serialized (see @ref dump) in this order.
+      For instance, `{"b": 1, "a": 2}` and `{"a": 2, "b": 1}` will be stored
+      and serialized as `{"a": 2, "b": 1}`.
+    - When comparing objects, the order of the name/value pairs is irrelevant.
+      This makes objects interoperable in the sense that they will not be
+      affected by these differences. For instance, `{"b": 1, "a": 2}` and
+      `{"a": 2, "b": 1}` will be treated as equal.
+
+    #### Limits
+
+    [RFC 7159](http://rfc7159.net/rfc7159) specifies:
+    > An implementation may set limits on the maximum depth of nesting.
+
+    In this class, the object's limit of nesting is not explicitly constrained.
+    However, a maximum depth of nesting may be introduced by the compiler or
+    runtime environment. A theoretical limit can be queried by calling the
+    @ref max_size function of a JSON object.
+
+    #### Storage
+
+    Objects are stored as pointers in a @ref basic_json type. That is, for any
+    access to object values, a pointer of type `object_t*` must be
+    dereferenced.
+
+    @sa @ref array_t -- type for an array value
+
+    @since version 1.0.0
+
+    @note The order name/value pairs are added to the object is *not*
+    preserved by the library. Therefore, iterating an object may return
+    name/value pairs in a different order than they were originally stored. In
+    fact, keys will be traversed in alphabetical order as `std::map` with
+    `std::less` is used by default. Please note this behavior conforms to [RFC
+    7159](http://rfc7159.net/rfc7159), because any order implements the
+    specified "unordered" nature of JSON objects.
+    */
+    using object_t = ObjectType<StringType,
+          basic_json,
+          object_comparator_t,
+          AllocatorType<std::pair<const StringType,
+          basic_json>>>;
+
+    /*!
+    @brief a type for an array
+
+    [RFC 7159](http://rfc7159.net/rfc7159) describes JSON arrays as follows:
+    > An array is an ordered sequence of zero or more values.
+
+    To store objects in C++, a type is defined by the template parameters
+    explained below.
+
+    @tparam ArrayType  container type to store arrays (e.g., `std::vector` or
+    `std::list`)
+    @tparam AllocatorType allocator to use for arrays (e.g., `std::allocator`)
+
+    #### Default type
+
+    With the default values for @a ArrayType (`std::vector`) and @a
+    AllocatorType (`std::allocator`), the default value for @a array_t is:
+
+    @code {.cpp}
+    std::vector<
+      basic_json, // value_type
+      std::allocator<basic_json> // allocator_type
+    >
+    @endcode
+
+    #### Limits
+
+    [RFC 7159](http://rfc7159.net/rfc7159) specifies:
+    > An implementation may set limits on the maximum depth of nesting.
+
+    In this class, the array's limit of nesting is not explicitly constrained.
+    However, a maximum depth of nesting may be introduced by the compiler or
+    runtime environment. A theoretical limit can be queried by calling the
+    @ref max_size function of a JSON array.
+
+    #### Storage
+
+    Arrays are stored as pointers in a @ref basic_json type. That is, for any
+    access to array values, a pointer of type `array_t*` must be dereferenced.
+
+    @sa @ref object_t -- type for an object value
+
+    @since version 1.0.0
+    */
+    using array_t = ArrayType<basic_json, AllocatorType<basic_json>>;
+
+    /*!
+    @brief a type for a string
+
+    [RFC 7159](http://rfc7159.net/rfc7159) describes JSON strings as follows:
+    > A string is a sequence of zero or more Unicode characters.
+
+    To store objects in C++, a type is defined by the template parameter
+    described below. Unicode values are split by the JSON class into
+    byte-sized characters during deserialization.
+
+    @tparam StringType  the container to store strings (e.g., `std::string`).
+    Note this container is used for keys/names in objects, see @ref object_t.
+
+    #### Default type
+
+    With the default values for @a StringType (`std::string`), the default
+    value for @a string_t is:
+
+    @code {.cpp}
+    std::string
+    @endcode
+
+    #### Encoding
+
+    Strings are stored in UTF-8 encoding. Therefore, functions like
+    `std::string::size()` or `std::string::length()` return the number of
+    bytes in the string rather than the number of characters or glyphs.
+
+    #### String comparison
+
+    [RFC 7159](http://rfc7159.net/rfc7159) states:
+    > Software implementations are typically required to test names of object
+    > members for equality. Implementations that transform the textual
+    > representation into sequences of Unicode code units and then perform the
+    > comparison numerically, code unit by code unit, are interoperable in the
+    > sense that implementations will agree in all cases on equality or
+    > inequality of two strings. For example, implementations that compare
+    > strings with escaped characters unconverted may incorrectly find that
+    > `"a\\b"` and `"a\u005Cb"` are not equal.
+
+    This implementation is interoperable as it does compare strings code unit
+    by code unit.
+
+    #### Storage
+
+    String values are stored as pointers in a @ref basic_json type. That is,
+    for any access to string values, a pointer of type `string_t*` must be
+    dereferenced.
+
+    @since version 1.0.0
+    */
+    using string_t = StringType;
+
+    /*!
+    @brief a type for a boolean
+
+    [RFC 7159](http://rfc7159.net/rfc7159) implicitly describes a boolean as a
+    type which differentiates the two literals `true` and `false`.
+
+    To store objects in C++, a type is defined by the template parameter @a
+    BooleanType which chooses the type to use.
+
+    #### Default type
+
+    With the default values for @a BooleanType (`bool`), the default value for
+    @a boolean_t is:
+
+    @code {.cpp}
+    bool
+    @endcode
+
+    #### Storage
+
+    Boolean values are stored directly inside a @ref basic_json type.
+
+    @since version 1.0.0
+    */
+    using boolean_t = BooleanType;
+
+    /*!
+    @brief a type for a number (integer)
+
+    [RFC 7159](http://rfc7159.net/rfc7159) describes numbers as follows:
+    > The representation of numbers is similar to that used in most
+    > programming languages. A number is represented in base 10 using decimal
+    > digits. It contains an integer component that may be prefixed with an
+    > optional minus sign, which may be followed by a fraction part and/or an
+    > exponent part. Leading zeros are not allowed. (...) Numeric values that
+    > cannot be represented in the grammar below (such as Infinity and NaN)
+    > are not permitted.
+
+    This description includes both integer and floating-point numbers.
+    However, C++ allows more precise storage if it is known whether the number
+    is a signed integer, an unsigned integer or a floating-point number.
+    Therefore, three different types, @ref number_integer_t, @ref
+    number_unsigned_t and @ref number_float_t are used.
+
+    To store integer numbers in C++, a type is defined by the template
+    parameter @a NumberIntegerType which chooses the type to use.
+
+    #### Default type
+
+    With the default values for @a NumberIntegerType (`int64_t`), the default
+    value for @a number_integer_t is:
+
+    @code {.cpp}
+    int64_t
+    @endcode
+
+    #### Default behavior
+
+    - The restrictions about leading zeros is not enforced in C++. Instead,
+      leading zeros in integer literals lead to an interpretation as octal
+      number. Internally, the value will be stored as decimal number. For
+      instance, the C++ integer literal `010` will be serialized to `8`.
+      During deserialization, leading zeros yield an error.
+    - Not-a-number (NaN) values will be serialized to `null`.
+
+    #### Limits
+
+    [RFC 7159](http://rfc7159.net/rfc7159) specifies:
+    > An implementation may set limits on the range and precision of numbers.
+
+    When the default type is used, the maximal integer number that can be
+    stored is `9223372036854775807` (INT64_MAX) and the minimal integer number
+    that can be stored is `-9223372036854775808` (INT64_MIN). Integer numbers
+    that are out of range will yield over/underflow when used in a
+    constructor. During deserialization, too large or small integer numbers
+    will be automatically be stored as @ref number_unsigned_t or @ref
+    number_float_t.
+
+    [RFC 7159](http://rfc7159.net/rfc7159) further states:
+    > Note that when such software is used, numbers that are integers and are
+    > in the range \f$[-2^{53}+1, 2^{53}-1]\f$ are interoperable in the sense
+    > that implementations will agree exactly on their numeric values.
+
+    As this range is a subrange of the exactly supported range [INT64_MIN,
+    INT64_MAX], this class's integer type is interoperable.
+
+    #### Storage
+
+    Integer number values are stored directly inside a @ref basic_json type.
+
+    @sa @ref number_float_t -- type for number values (floating-point)
+
+    @sa @ref number_unsigned_t -- type for number values (unsigned integer)
+
+    @since version 1.0.0
+    */
+    using number_integer_t = NumberIntegerType;
+
+    /*!
+    @brief a type for a number (unsigned)
+
+    [RFC 7159](http://rfc7159.net/rfc7159) describes numbers as follows:
+    > The representation of numbers is similar to that used in most
+    > programming languages. A number is represented in base 10 using decimal
+    > digits. It contains an integer component that may be prefixed with an
+    > optional minus sign, which may be followed by a fraction part and/or an
+    > exponent part. Leading zeros are not allowed. (...) Numeric values that
+    > cannot be represented in the grammar below (such as Infinity and NaN)
+    > are not permitted.
+
+    This description includes both integer and floating-point numbers.
+    However, C++ allows more precise storage if it is known whether the number
+    is a signed integer, an unsigned integer or a floating-point number.
+    Therefore, three different types, @ref number_integer_t, @ref
+    number_unsigned_t and @ref number_float_t are used.
+
+    To store unsigned integer numbers in C++, a type is defined by the
+    template parameter @a NumberUnsignedType which chooses the type to use.
+
+    #### Default type
+
+    With the default values for @a NumberUnsignedType (`uint64_t`), the
+    default value for @a number_unsigned_t is:
+
+    @code {.cpp}
+    uint64_t
+    @endcode
+
+    #### Default behavior
+
+    - The restrictions about leading zeros is not enforced in C++. Instead,
+      leading zeros in integer literals lead to an interpretation as octal
+      number. Internally, the value will be stored as decimal number. For
+      instance, the C++ integer literal `010` will be serialized to `8`.
+      During deserialization, leading zeros yield an error.
+    - Not-a-number (NaN) values will be serialized to `null`.
+
+    #### Limits
+
+    [RFC 7159](http://rfc7159.net/rfc7159) specifies:
+    > An implementation may set limits on the range and precision of numbers.
+
+    When the default type is used, the maximal integer number that can be
+    stored is `18446744073709551615` (UINT64_MAX) and the minimal integer
+    number that can be stored is `0`. Integer numbers that are out of range
+    will yield over/underflow when used in a constructor. During
+    deserialization, too large or small integer numbers will be automatically
+    be stored as @ref number_integer_t or @ref number_float_t.
+
+    [RFC 7159](http://rfc7159.net/rfc7159) further states:
+    > Note that when such software is used, numbers that are integers and are
+    > in the range \f$[-2^{53}+1, 2^{53}-1]\f$ are interoperable in the sense
+    > that implementations will agree exactly on their numeric values.
+
+    As this range is a subrange (when considered in conjunction with the
+    number_integer_t type) of the exactly supported range [0, UINT64_MAX],
+    this class's integer type is interoperable.
+
+    #### Storage
+
+    Integer number values are stored directly inside a @ref basic_json type.
+
+    @sa @ref number_float_t -- type for number values (floating-point)
+    @sa @ref number_integer_t -- type for number values (integer)
+
+    @since version 2.0.0
+    */
+    using number_unsigned_t = NumberUnsignedType;
+
+    /*!
+    @brief a type for a number (floating-point)
+
+    [RFC 7159](http://rfc7159.net/rfc7159) describes numbers as follows:
+    > The representation of numbers is similar to that used in most
+    > programming languages. A number is represented in base 10 using decimal
+    > digits. It contains an integer component that may be prefixed with an
+    > optional minus sign, which may be followed by a fraction part and/or an
+    > exponent part. Leading zeros are not allowed. (...) Numeric values that
+    > cannot be represented in the grammar below (such as Infinity and NaN)
+    > are not permitted.
+
+    This description includes both integer and floating-point numbers.
+    However, C++ allows more precise storage if it is known whether the number
+    is a signed integer, an unsigned integer or a floating-point number.
+    Therefore, three different types, @ref number_integer_t, @ref
+    number_unsigned_t and @ref number_float_t are used.
+
+    To store floating-point numbers in C++, a type is defined by the template
+    parameter @a NumberFloatType which chooses the type to use.
+
+    #### Default type
+
+    With the default values for @a NumberFloatType (`double`), the default
+    value for @a number_float_t is:
+
+    @code {.cpp}
+    double
+    @endcode
+
+    #### Default behavior
+
+    - The restrictions about leading zeros is not enforced in C++. Instead,
+      leading zeros in floating-point literals will be ignored. Internally,
+      the value will be stored as decimal number. For instance, the C++
+      floating-point literal `01.2` will be serialized to `1.2`. During
+      deserialization, leading zeros yield an error.
+    - Not-a-number (NaN) values will be serialized to `null`.
+
+    #### Limits
+
+    [RFC 7159](http://rfc7159.net/rfc7159) states:
+    > This specification allows implementations to set limits on the range and
+    > precision of numbers accepted. Since software that implements IEEE
+    > 754-2008 binary64 (double precision) numbers is generally available and
+    > widely used, good interoperability can be achieved by implementations
+    > that expect no more precision or range than these provide, in the sense
+    > that implementations will approximate JSON numbers within the expected
+    > precision.
+
+    This implementation does exactly follow this approach, as it uses double
+    precision floating-point numbers. Note values smaller than
+    `-1.79769313486232e+308` and values greater than `1.79769313486232e+308`
+    will be stored as NaN internally and be serialized to `null`.
+
+    #### Storage
+
+    Floating-point number values are stored directly inside a @ref basic_json
+    type.
+
+    @sa @ref number_integer_t -- type for number values (integer)
+
+    @sa @ref number_unsigned_t -- type for number values (unsigned integer)
+
+    @since version 1.0.0
+    */
+    using number_float_t = NumberFloatType;
+
+    /// @}
+
+  private:
+
+    /// helper for exception-safe object creation
+    template<typename T, typename... Args>
+    static T* create(Args&& ... args)
+    {
+        AllocatorType<T> alloc;
+        using AllocatorTraits = std::allocator_traits<AllocatorType<T>>;
+
+        auto deleter = [&](T * object)
+        {
+            AllocatorTraits::deallocate(alloc, object, 1);
+        };
+        std::unique_ptr<T, decltype(deleter)> object(AllocatorTraits::allocate(alloc, 1), deleter);
+        AllocatorTraits::construct(alloc, object.get(), std::forward<Args>(args)...);
+        assert(object != nullptr);
+        return object.release();
+    }
+
+    ////////////////////////
+    // JSON value storage //
+    ////////////////////////
+
+    /*!
+    @brief a JSON value
+
+    The actual storage for a JSON value of the @ref basic_json class. This
+    union combines the different storage types for the JSON value types
+    defined in @ref value_t.
+
+    JSON type | value_t type    | used type
+    --------- | --------------- | ------------------------
+    object    | object          | pointer to @ref object_t
+    array     | array           | pointer to @ref array_t
+    string    | string          | pointer to @ref string_t
+    boolean   | boolean         | @ref boolean_t
+    number    | number_integer  | @ref number_integer_t
+    number    | number_unsigned | @ref number_unsigned_t
+    number    | number_float    | @ref number_float_t
+    null      | null            | *no value is stored*
+
+    @note Variable-length types (objects, arrays, and strings) are stored as
+    pointers. The size of the union should not exceed 64 bits if the default
+    value types are used.
+
+    @since version 1.0.0
+    */
+    union json_value
+    {
+        /// object (stored with pointer to save storage)
+        object_t* object;
+        /// array (stored with pointer to save storage)
+        array_t* array;
+        /// string (stored with pointer to save storage)
+        string_t* string;
+        /// boolean
+        boolean_t boolean;
+        /// number (integer)
+        number_integer_t number_integer;
+        /// number (unsigned integer)
+        number_unsigned_t number_unsigned;
+        /// number (floating-point)
+        number_float_t number_float;
+
+        /// default constructor (for null values)
+        json_value() = default;
+        /// constructor for booleans
+        json_value(boolean_t v) noexcept : boolean(v) {}
+        /// constructor for numbers (integer)
+        json_value(number_integer_t v) noexcept : number_integer(v) {}
+        /// constructor for numbers (unsigned)
+        json_value(number_unsigned_t v) noexcept : number_unsigned(v) {}
+        /// constructor for numbers (floating-point)
+        json_value(number_float_t v) noexcept : number_float(v) {}
+        /// constructor for empty values of a given type
+        json_value(value_t t)
+        {
+            switch (t)
+            {
+                case value_t::object:
+                {
+                    object = create<object_t>();
+                    break;
+                }
+
+                case value_t::array:
+                {
+                    array = create<array_t>();
+                    break;
+                }
+
+                case value_t::string:
+                {
+                    string = create<string_t>("");
+                    break;
+                }
+
+                case value_t::boolean:
+                {
+                    boolean = boolean_t(false);
+                    break;
+                }
+
+                case value_t::number_integer:
+                {
+                    number_integer = number_integer_t(0);
+                    break;
+                }
+
+                case value_t::number_unsigned:
+                {
+                    number_unsigned = number_unsigned_t(0);
+                    break;
+                }
+
+                case value_t::number_float:
+                {
+                    number_float = number_float_t(0.0);
+                    break;
+                }
+
+                case value_t::null:
+                {
+                    object = nullptr;  // silence warning, see #821
+                    break;
+                }
+
+                default:
+                {
+                    object = nullptr;  // silence warning, see #821
+                    if (JSON_UNLIKELY(t == value_t::null))
+                    {
+                        JSON_THROW(other_error::create(500, "961c151d2e87f2686a955a9be24d316f1362bf21 3.2.0")); // LCOV_EXCL_LINE
+                    }
+                    break;
+                }
+            }
+        }
+
+        /// constructor for strings
+        json_value(const string_t& value)
+        {
+            string = create<string_t>(value);
+        }
+
+        /// constructor for rvalue strings
+        json_value(string_t&& value)
+        {
+            string = create<string_t>(std::move(value));
+        }
+
+        /// constructor for objects
+        json_value(const object_t& value)
+        {
+            object = create<object_t>(value);
+        }
+
+        /// constructor for rvalue objects
+        json_value(object_t&& value)
+        {
+            object = create<object_t>(std::move(value));
+        }
+
+        /// constructor for arrays
+        json_value(const array_t& value)
+        {
+            array = create<array_t>(value);
+        }
+
+        /// constructor for rvalue arrays
+        json_value(array_t&& value)
+        {
+            array = create<array_t>(std::move(value));
+        }
+
+        void destroy(value_t t) noexcept
+        {
+            switch (t)
+            {
+                case value_t::object:
+                {
+                    AllocatorType<object_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, object);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, object, 1);
+                    break;
+                }
+
+                case value_t::array:
+                {
+                    AllocatorType<array_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, array);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, array, 1);
+                    break;
+                }
+
+                case value_t::string:
+                {
+                    AllocatorType<string_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, string);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, string, 1);
+                    break;
+                }
+
+                default:
+                {
+                    break;
+                }
+            }
+        }
+    };
+
+    /*!
+    @brief checks the class invariants
+
+    This function asserts the class invariants. It needs to be called at the
+    end of every constructor to make sure that created objects respect the
+    invariant. Furthermore, it has to be called each time the type of a JSON
+    value is changed, because the invariant expresses a relationship between
+    @a m_type and @a m_value.
+    */
+    void assert_invariant() const noexcept
+    {
+        assert(m_type != value_t::object or m_value.object != nullptr);
+        assert(m_type != value_t::array or m_value.array != nullptr);
+        assert(m_type != value_t::string or m_value.string != nullptr);
+    }
+
+  public:
+    //////////////////////////
+    // JSON parser callback //
+    //////////////////////////
+
+    /*!
+    @brief parser event types
+
+    The parser callback distinguishes the following events:
+    - `object_start`: the parser read `{` and started to process a JSON object
+    - `key`: the parser read a key of a value in an object
+    - `object_end`: the parser read `}` and finished processing a JSON object
+    - `array_start`: the parser read `[` and started to process a JSON array
+    - `array_end`: the parser read `]` and finished processing a JSON array
+    - `value`: the parser finished reading a JSON value
+
+    @image html callback_events.png "Example when certain parse events are triggered"
+
+    @sa @ref parser_callback_t for more information and examples
+    */
+    using parse_event_t = typename parser::parse_event_t;
+
+    /*!
+    @brief per-element parser callback type
+
+    With a parser callback function, the result of parsing a JSON text can be
+    influenced. When passed to @ref parse, it is called on certain events
+    (passed as @ref parse_event_t via parameter @a event) with a set recursion
+    depth @a depth and context JSON value @a parsed. The return value of the
+    callback function is a boolean indicating whether the element that emitted
+    the callback shall be kept or not.
+
+    We distinguish six scenarios (determined by the event type) in which the
+    callback function can be called. The following table describes the values
+    of the parameters @a depth, @a event, and @a parsed.
+
+    parameter @a event | description | parameter @a depth | parameter @a parsed
+    ------------------ | ----------- | ------------------ | -------------------
+    parse_event_t::object_start | the parser read `{` and started to process a JSON object | depth of the parent of the JSON object | a JSON value with type discarded
+    parse_event_t::key | the parser read a key of a value in an object | depth of the currently parsed JSON object | a JSON string containing the key
+    parse_event_t::object_end | the parser read `}` and finished processing a JSON object | depth of the parent of the JSON object | the parsed JSON object
+    parse_event_t::array_start | the parser read `[` and started to process a JSON array | depth of the parent of the JSON array | a JSON value with type discarded
+    parse_event_t::array_end | the parser read `]` and finished processing a JSON array | depth of the parent of the JSON array | the parsed JSON array
+    parse_event_t::value | the parser finished reading a JSON value | depth of the value | the parsed JSON value
+
+    @image html callback_events.png "Example when certain parse events are triggered"
+
+    Discarding a value (i.e., returning `false`) has different effects
+    depending on the context in which function was called:
+
+    - Discarded values in structured types are skipped. That is, the parser
+      will behave as if the discarded value was never read.
+    - In case a value outside a structured type is skipped, it is replaced
+      with `null`. This case happens if the top-level element is skipped.
+
+    @param[in] depth  the depth of the recursion during parsing
+
+    @param[in] event  an event of type parse_event_t indicating the context in
+    the callback function has been called
+
+    @param[in,out] parsed  the current intermediate parse result; note that
+    writing to this value has no effect for parse_event_t::key events
+
+    @return Whether the JSON value which called the function during parsing
+    should be kept (`true`) or not (`false`). In the latter case, it is either
+    skipped completely or replaced by an empty discarded object.
+
+    @sa @ref parse for examples
+
+    @since version 1.0.0
+    */
+    using parser_callback_t = typename parser::parser_callback_t;
+
+    //////////////////
+    // constructors //
+    //////////////////
+
+    /// @name constructors and destructors
+    /// Constructors of class @ref basic_json, copy/move constructor, copy
+    /// assignment, static functions creating objects, and the destructor.
+    /// @{
+
+    /*!
+    @brief create an empty value with a given type
+
+    Create an empty JSON value with a given type. The value will be default
+    initialized with an empty value which depends on the type:
+
+    Value type  | initial value
+    ----------- | -------------
+    null        | `null`
+    boolean     | `false`
+    string      | `""`
+    number      | `0`
+    object      | `{}`
+    array       | `[]`
+
+    @param[in] v  the type of the value to create
+
+    @complexity Constant.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes to any JSON value.
+
+    @liveexample{The following code shows the constructor for different @ref
+    value_t values,basic_json__value_t}
+
+    @sa @ref clear() -- restores the postcondition of this constructor
+
+    @since version 1.0.0
+    */
+    basic_json(const value_t v)
+        : m_type(v), m_value(v)
+    {
+        assert_invariant();
+    }
+
+    /*!
+    @brief create a null object
+
+    Create a `null` JSON value. It either takes a null pointer as parameter
+    (explicitly creating `null`) or no parameter (implicitly creating `null`).
+    The passed null pointer itself is not read -- it is only used to choose
+    the right constructor.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this constructor never throws
+    exceptions.
+
+    @liveexample{The following code shows the constructor with and without a
+    null pointer parameter.,basic_json__nullptr_t}
+
+    @since version 1.0.0
+    */
+    basic_json(std::nullptr_t = nullptr) noexcept
+        : basic_json(value_t::null)
+    {
+        assert_invariant();
+    }
+
+    /*!
+    @brief create a JSON value
+
+    This is a "catch all" constructor for all compatible JSON types; that is,
+    types for which a `to_json()` method exists. The constructor forwards the
+    parameter @a val to that method (to `json_serializer<U>::to_json` method
+    with `U = uncvref_t<CompatibleType>`, to be exact).
+
+    Template type @a CompatibleType includes, but is not limited to, the
+    following types:
+    - **arrays**: @ref array_t and all kinds of compatible containers such as
+      `std::vector`, `std::deque`, `std::list`, `std::forward_list`,
+      `std::array`, `std::valarray`, `std::set`, `std::unordered_set`,
+      `std::multiset`, and `std::unordered_multiset` with a `value_type` from
+      which a @ref basic_json value can be constructed.
+    - **objects**: @ref object_t and all kinds of compatible associative
+      containers such as `std::map`, `std::unordered_map`, `std::multimap`,
+      and `std::unordered_multimap` with a `key_type` compatible to
+      @ref string_t and a `value_type` from which a @ref basic_json value can
+      be constructed.
+    - **strings**: @ref string_t, string literals, and all compatible string
+      containers can be used.
+    - **numbers**: @ref number_integer_t, @ref number_unsigned_t,
+      @ref number_float_t, and all convertible number types such as `int`,
+      `size_t`, `int64_t`, `float` or `double` can be used.
+    - **boolean**: @ref boolean_t / `bool` can be used.
+
+    See the examples below.
+
+    @tparam CompatibleType a type such that:
+    - @a CompatibleType is not derived from `std::istream`,
+    - @a CompatibleType is not @ref basic_json (to avoid hijacking copy/move
+         constructors),
+    - @a CompatibleType is not a different @ref basic_json type (i.e. with different template arguments)
+    - @a CompatibleType is not a @ref basic_json nested type (e.g.,
+         @ref json_pointer, @ref iterator, etc ...)
+    - @ref @ref json_serializer<U> has a
+         `to_json(basic_json_t&, CompatibleType&&)` method
+
+    @tparam U = `uncvref_t<CompatibleType>`
+
+    @param[in] val the value to be forwarded to the respective constructor
+
+    @complexity Usually linear in the size of the passed @a val, also
+                depending on the implementation of the called `to_json()`
+                method.
+
+    @exceptionsafety Depends on the called constructor. For types directly
+    supported by the library (i.e., all types for which no `to_json()` function
+    was provided), strong guarantee holds: if an exception is thrown, there are
+    no changes to any JSON value.
+
+    @liveexample{The following code shows the constructor with several
+    compatible types.,basic_json__CompatibleType}
+
+    @since version 2.1.0
+    */
+    template <typename CompatibleType,
+              typename U = detail::uncvref_t<CompatibleType>,
+              detail::enable_if_t<
+                  detail::is_compatible_type<basic_json_t, U>::value, int> = 0>
+    basic_json(CompatibleType && val) noexcept(noexcept(
+                JSONSerializer<U>::to_json(std::declval<basic_json_t&>(),
+                                           std::forward<CompatibleType>(val))))
+    {
+        JSONSerializer<U>::to_json(*this, std::forward<CompatibleType>(val));
+        assert_invariant();
+    }
+
+    /*!
+    @brief create a JSON value from an existing one
+
+    This is a constructor for existing @ref basic_json types.
+    It does not hijack copy/move constructors, since the parameter has different
+    template arguments than the current ones.
+
+    The constructor tries to convert the internal @ref m_value of the parameter.
+
+    @tparam BasicJsonType a type such that:
+    - @a BasicJsonType is a @ref basic_json type.
+    - @a BasicJsonType has different template arguments than @ref basic_json_t.
+
+    @param[in] val the @ref basic_json value to be converted.
+
+    @complexity Usually linear in the size of the passed @a val, also
+                depending on the implementation of the called `to_json()`
+                method.
+
+    @exceptionsafety Depends on the called constructor. For types directly
+    supported by the library (i.e., all types for which no `to_json()` function
+    was provided), strong guarantee holds: if an exception is thrown, there are
+    no changes to any JSON value.
+
+    @since version 3.2.0
+    */
+    template <typename BasicJsonType,
+              detail::enable_if_t<
+                  detail::is_basic_json<BasicJsonType>::value and not std::is_same<basic_json, BasicJsonType>::value, int> = 0>
+    basic_json(const BasicJsonType& val)
+    {
+        using other_boolean_t = typename BasicJsonType::boolean_t;
+        using other_number_float_t = typename BasicJsonType::number_float_t;
+        using other_number_integer_t = typename BasicJsonType::number_integer_t;
+        using other_number_unsigned_t = typename BasicJsonType::number_unsigned_t;
+        using other_string_t = typename BasicJsonType::string_t;
+        using other_object_t = typename BasicJsonType::object_t;
+        using other_array_t = typename BasicJsonType::array_t;
+
+        switch (val.type())
+        {
+            case value_t::boolean:
+                JSONSerializer<other_boolean_t>::to_json(*this, val.template get<other_boolean_t>());
+                break;
+            case value_t::number_float:
+                JSONSerializer<other_number_float_t>::to_json(*this, val.template get<other_number_float_t>());
+                break;
+            case value_t::number_integer:
+                JSONSerializer<other_number_integer_t>::to_json(*this, val.template get<other_number_integer_t>());
+                break;
+            case value_t::number_unsigned:
+                JSONSerializer<other_number_unsigned_t>::to_json(*this, val.template get<other_number_unsigned_t>());
+                break;
+            case value_t::string:
+                JSONSerializer<other_string_t>::to_json(*this, val.template get_ref<const other_string_t&>());
+                break;
+            case value_t::object:
+                JSONSerializer<other_object_t>::to_json(*this, val.template get_ref<const other_object_t&>());
+                break;
+            case value_t::array:
+                JSONSerializer<other_array_t>::to_json(*this, val.template get_ref<const other_array_t&>());
+                break;
+            case value_t::null:
+                *this = nullptr;
+                break;
+            case value_t::discarded:
+                m_type = value_t::discarded;
+                break;
+        }
+        assert_invariant();
+    }
+
+    /*!
+    @brief create a container (array or object) from an initializer list
+
+    Creates a JSON value of type array or object from the passed initializer
+    list @a init. In case @a type_deduction is `true` (default), the type of
+    the JSON value to be created is deducted from the initializer list @a init
+    according to the following rules:
+
+    1. If the list is empty, an empty JSON object value `{}` is created.
+    2. If the list consists of pairs whose first element is a string, a JSON
+       object value is created where the first elements of the pairs are
+       treated as keys and the second elements are as values.
+    3. In all other cases, an array is created.
+
+    The rules aim to create the best fit between a C++ initializer list and
+    JSON values. The rationale is as follows:
+
+    1. The empty initializer list is written as `{}` which is exactly an empty
+       JSON object.
+    2. C++ has no way of describing mapped types other than to list a list of
+       pairs. As JSON requires that keys must be of type string, rule 2 is the
+       weakest constraint one can pose on initializer lists to interpret them
+       as an object.
+    3. In all other cases, the initializer list could not be interpreted as
+       JSON object type, so interpreting it as JSON array type is safe.
+
+    With the rules described above, the following JSON values cannot be
+    expressed by an initializer list:
+
+    - the empty array (`[]`): use @ref array(initializer_list_t)
+      with an empty initializer list in this case
+    - arrays whose elements satisfy rule 2: use @ref
+      array(initializer_list_t) with the same initializer list
+      in this case
+
+    @note When used without parentheses around an empty initializer list, @ref
+    basic_json() is called instead of this function, yielding the JSON null
+    value.
+
+    @param[in] init  initializer list with JSON values
+
+    @param[in] type_deduction internal parameter; when set to `true`, the type
+    of the JSON value is deducted from the initializer list @a init; when set
+    to `false`, the type provided via @a manual_type is forced. This mode is
+    used by the functions @ref array(initializer_list_t) and
+    @ref object(initializer_list_t).
+
+    @param[in] manual_type internal parameter; when @a type_deduction is set
+    to `false`, the created JSON value will use the provided type (only @ref
+    value_t::array and @ref value_t::object are valid); when @a type_deduction
+    is set to `true`, this parameter has no effect
+
+    @throw type_error.301 if @a type_deduction is `false`, @a manual_type is
+    `value_t::object`, but @a init contains an element which is not a pair
+    whose first element is a string. In this case, the constructor could not
+    create an object. If @a type_deduction would have be `true`, an array
+    would have been created. See @ref object(initializer_list_t)
+    for an example.
+
+    @complexity Linear in the size of the initializer list @a init.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes to any JSON value.
+
+    @liveexample{The example below shows how JSON values are created from
+    initializer lists.,basic_json__list_init_t}
+
+    @sa @ref array(initializer_list_t) -- create a JSON array
+    value from an initializer list
+    @sa @ref object(initializer_list_t) -- create a JSON object
+    value from an initializer list
+
+    @since version 1.0.0
+    */
+    basic_json(initializer_list_t init,
+               bool type_deduction = true,
+               value_t manual_type = value_t::array)
+    {
+        // check if each element is an array with two elements whose first
+        // element is a string
+        bool is_an_object = std::all_of(init.begin(), init.end(),
+                                        [](const detail::json_ref<basic_json>& element_ref)
+        {
+            return (element_ref->is_array() and element_ref->size() == 2 and (*element_ref)[0].is_string());
+        });
+
+        // adjust type if type deduction is not wanted
+        if (not type_deduction)
+        {
+            // if array is wanted, do not create an object though possible
+            if (manual_type == value_t::array)
+            {
+                is_an_object = false;
+            }
+
+            // if object is wanted but impossible, throw an exception
+            if (JSON_UNLIKELY(manual_type == value_t::object and not is_an_object))
+            {
+                JSON_THROW(type_error::create(301, "cannot create object from initializer list"));
+            }
+        }
+
+        if (is_an_object)
+        {
+            // the initializer list is a list of pairs -> create object
+            m_type = value_t::object;
+            m_value = value_t::object;
+
+            std::for_each(init.begin(), init.end(), [this](const detail::json_ref<basic_json>& element_ref)
+            {
+                auto element = element_ref.moved_or_copied();
+                m_value.object->emplace(
+                    std::move(*((*element.m_value.array)[0].m_value.string)),
+                    std::move((*element.m_value.array)[1]));
+            });
+        }
+        else
+        {
+            // the initializer list describes an array -> create array
+            m_type = value_t::array;
+            m_value.array = create<array_t>(init.begin(), init.end());
+        }
+
+        assert_invariant();
+    }
+
+    /*!
+    @brief explicitly create an array from an initializer list
+
+    Creates a JSON array value from a given initializer list. That is, given a
+    list of values `a, b, c`, creates the JSON value `[a, b, c]`. If the
+    initializer list is empty, the empty array `[]` is created.
+
+    @note This function is only needed to express two edge cases that cannot
+    be realized with the initializer list constructor (@ref
+    basic_json(initializer_list_t, bool, value_t)). These cases
+    are:
+    1. creating an array whose elements are all pairs whose first element is a
+    string -- in this case, the initializer list constructor would create an
+    object, taking the first elements as keys
+    2. creating an empty array -- passing the empty initializer list to the
+    initializer list constructor yields an empty object
+
+    @param[in] init  initializer list with JSON values to create an array from
+    (optional)
+
+    @return JSON array value
+
+    @complexity Linear in the size of @a init.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes to any JSON value.
+
+    @liveexample{The following code shows an example for the `array`
+    function.,array}
+
+    @sa @ref basic_json(initializer_list_t, bool, value_t) --
+    create a JSON value from an initializer list
+    @sa @ref object(initializer_list_t) -- create a JSON object
+    value from an initializer list
+
+    @since version 1.0.0
+    */
+    static basic_json array(initializer_list_t init = {})
+    {
+        return basic_json(init, false, value_t::array);
+    }
+
+    /*!
+    @brief explicitly create an object from an initializer list
+
+    Creates a JSON object value from a given initializer list. The initializer
+    lists elements must be pairs, and their first elements must be strings. If
+    the initializer list is empty, the empty object `{}` is created.
+
+    @note This function is only added for symmetry reasons. In contrast to the
+    related function @ref array(initializer_list_t), there are
+    no cases which can only be expressed by this function. That is, any
+    initializer list @a init can also be passed to the initializer list
+    constructor @ref basic_json(initializer_list_t, bool, value_t).
+
+    @param[in] init  initializer list to create an object from (optional)
+
+    @return JSON object value
+
+    @throw type_error.301 if @a init is not a list of pairs whose first
+    elements are strings. In this case, no object can be created. When such a
+    value is passed to @ref basic_json(initializer_list_t, bool, value_t),
+    an array would have been created from the passed initializer list @a init.
+    See example below.
+
+    @complexity Linear in the size of @a init.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes to any JSON value.
+
+    @liveexample{The following code shows an example for the `object`
+    function.,object}
+
+    @sa @ref basic_json(initializer_list_t, bool, value_t) --
+    create a JSON value from an initializer list
+    @sa @ref array(initializer_list_t) -- create a JSON array
+    value from an initializer list
+
+    @since version 1.0.0
+    */
+    static basic_json object(initializer_list_t init = {})
+    {
+        return basic_json(init, false, value_t::object);
+    }
+
+    /*!
+    @brief construct an array with count copies of given value
+
+    Constructs a JSON array value by creating @a cnt copies of a passed value.
+    In case @a cnt is `0`, an empty array is created.
+
+    @param[in] cnt  the number of JSON copies of @a val to create
+    @param[in] val  the JSON value to copy
+
+    @post `std::distance(begin(),end()) == cnt` holds.
+
+    @complexity Linear in @a cnt.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes to any JSON value.
+
+    @liveexample{The following code shows examples for the @ref
+    basic_json(size_type\, const basic_json&)
+    constructor.,basic_json__size_type_basic_json}
+
+    @since version 1.0.0
+    */
+    basic_json(size_type cnt, const basic_json& val)
+        : m_type(value_t::array)
+    {
+        m_value.array = create<array_t>(cnt, val);
+        assert_invariant();
+    }
+
+    /*!
+    @brief construct a JSON container given an iterator range
+
+    Constructs the JSON value with the contents of the range `[first, last)`.
+    The semantics depends on the different types a JSON value can have:
+    - In case of a null type, invalid_iterator.206 is thrown.
+    - In case of other primitive types (number, boolean, or string), @a first
+      must be `begin()` and @a last must be `end()`. In this case, the value is
+      copied. Otherwise, invalid_iterator.204 is thrown.
+    - In case of structured types (array, object), the constructor behaves as
+      similar versions for `std::vector` or `std::map`; that is, a JSON array
+      or object is constructed from the values in the range.
+
+    @tparam InputIT an input iterator type (@ref iterator or @ref
+    const_iterator)
+
+    @param[in] first begin of the range to copy from (included)
+    @param[in] last end of the range to copy from (excluded)
+
+    @pre Iterators @a first and @a last must be initialized. **This
+         precondition is enforced with an assertion (see warning).** If
+         assertions are switched off, a violation of this precondition yields
+         undefined behavior.
+
+    @pre Range `[first, last)` is valid. Usually, this precondition cannot be
+         checked efficiently. Only certain edge cases are detected; see the
+         description of the exceptions below. A violation of this precondition
+         yields undefined behavior.
+
+    @warning A precondition is enforced with a runtime assertion that will
+             result in calling `std::abort` if this precondition is not met.
+             Assertions can be disabled by defining `NDEBUG` at compile time.
+             See https://en.cppreference.com/w/cpp/error/assert for more
+             information.
+
+    @throw invalid_iterator.201 if iterators @a first and @a last are not
+    compatible (i.e., do not belong to the same JSON value). In this case,
+    the range `[first, last)` is undefined.
+    @throw invalid_iterator.204 if iterators @a first and @a last belong to a
+    primitive type (number, boolean, or string), but @a first does not point
+    to the first element any more. In this case, the range `[first, last)` is
+    undefined. See example code below.
+    @throw invalid_iterator.206 if iterators @a first and @a last belong to a
+    null value. In this case, the range `[first, last)` is undefined.
+
+    @complexity Linear in distance between @a first and @a last.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes to any JSON value.
+
+    @liveexample{The example below shows several ways to create JSON values by
+    specifying a subrange with iterators.,basic_json__InputIt_InputIt}
+
+    @since version 1.0.0
+    */
+    template<class InputIT, typename std::enable_if<
+                 std::is_same<InputIT, typename basic_json_t::iterator>::value or
+                 std::is_same<InputIT, typename basic_json_t::const_iterator>::value, int>::type = 0>
+    basic_json(InputIT first, InputIT last)
+    {
+        assert(first.m_object != nullptr);
+        assert(last.m_object != nullptr);
+
+        // make sure iterator fits the current value
+        if (JSON_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(201, "iterators are not compatible"));
+        }
+
+        // copy type from first iterator
+        m_type = first.m_object->m_type;
+
+        // check if iterator range is complete for primitive values
+        switch (m_type)
+        {
+            case value_t::boolean:
+            case value_t::number_float:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::string:
+            {
+                if (JSON_UNLIKELY(not first.m_it.primitive_iterator.is_begin()
+                                  or not last.m_it.primitive_iterator.is_end()))
+                {
+                    JSON_THROW(invalid_iterator::create(204, "iterators out of range"));
+                }
+                break;
+            }
+
+            default:
+                break;
+        }
+
+        switch (m_type)
+        {
+            case value_t::number_integer:
+            {
+                m_value.number_integer = first.m_object->m_value.number_integer;
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                m_value.number_unsigned = first.m_object->m_value.number_unsigned;
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                m_value.number_float = first.m_object->m_value.number_float;
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                m_value.boolean = first.m_object->m_value.boolean;
+                break;
+            }
+
+            case value_t::string:
+            {
+                m_value = *first.m_object->m_value.string;
+                break;
+            }
+
+            case value_t::object:
+            {
+                m_value.object = create<object_t>(first.m_it.object_iterator,
+                                                  last.m_it.object_iterator);
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_value.array = create<array_t>(first.m_it.array_iterator,
+                                                last.m_it.array_iterator);
+                break;
+            }
+
+            default:
+                JSON_THROW(invalid_iterator::create(206, "cannot construct with iterators from " +
+                                                    std::string(first.m_object->type_name())));
+        }
+
+        assert_invariant();
+    }
+
+
+    ///////////////////////////////////////
+    // other constructors and destructor //
+    ///////////////////////////////////////
+
+    /// @private
+    basic_json(const detail::json_ref<basic_json>& ref)
+        : basic_json(ref.moved_or_copied())
+    {}
+
+    /*!
+    @brief copy constructor
+
+    Creates a copy of a given JSON value.
+
+    @param[in] other  the JSON value to copy
+
+    @post `*this == other`
+
+    @complexity Linear in the size of @a other.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes to any JSON value.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is linear.
+    - As postcondition, it holds: `other == basic_json(other)`.
+
+    @liveexample{The following code shows an example for the copy
+    constructor.,basic_json__basic_json}
+
+    @since version 1.0.0
+    */
+    basic_json(const basic_json& other)
+        : m_type(other.m_type)
+    {
+        // check of passed value is valid
+        other.assert_invariant();
+
+        switch (m_type)
+        {
+            case value_t::object:
+            {
+                m_value = *other.m_value.object;
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_value = *other.m_value.array;
+                break;
+            }
+
+            case value_t::string:
+            {
+                m_value = *other.m_value.string;
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                m_value = other.m_value.boolean;
+                break;
+            }
+
+            case value_t::number_integer:
+            {
+                m_value = other.m_value.number_integer;
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                m_value = other.m_value.number_unsigned;
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                m_value = other.m_value.number_float;
+                break;
+            }
+
+            default:
+                break;
+        }
+
+        assert_invariant();
+    }
+
+    /*!
+    @brief move constructor
+
+    Move constructor. Constructs a JSON value with the contents of the given
+    value @a other using move semantics. It "steals" the resources from @a
+    other and leaves it as JSON null value.
+
+    @param[in,out] other  value to move to this object
+
+    @post `*this` has the same value as @a other before the call.
+    @post @a other is a JSON null value.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this constructor never throws
+    exceptions.
+
+    @requirement This function helps `basic_json` satisfying the
+    [MoveConstructible](https://en.cppreference.com/w/cpp/named_req/MoveConstructible)
+    requirements.
+
+    @liveexample{The code below shows the move constructor explicitly called
+    via std::move.,basic_json__moveconstructor}
+
+    @since version 1.0.0
+    */
+    basic_json(basic_json&& other) noexcept
+        : m_type(std::move(other.m_type)),
+          m_value(std::move(other.m_value))
+    {
+        // check that passed value is valid
+        other.assert_invariant();
+
+        // invalidate payload
+        other.m_type = value_t::null;
+        other.m_value = {};
+
+        assert_invariant();
+    }
+
+    /*!
+    @brief copy assignment
+
+    Copy assignment operator. Copies a JSON value via the "copy and swap"
+    strategy: It is expressed in terms of the copy constructor, destructor,
+    and the `swap()` member function.
+
+    @param[in] other  value to copy from
+
+    @complexity Linear.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is linear.
+
+    @liveexample{The code below shows and example for the copy assignment. It
+    creates a copy of value `a` which is then swapped with `b`. Finally\, the
+    copy of `a` (which is the null value after the swap) is
+    destroyed.,basic_json__copyassignment}
+
+    @since version 1.0.0
+    */
+    reference& operator=(basic_json other) noexcept (
+        std::is_nothrow_move_constructible<value_t>::value and
+        std::is_nothrow_move_assignable<value_t>::value and
+        std::is_nothrow_move_constructible<json_value>::value and
+        std::is_nothrow_move_assignable<json_value>::value
+    )
+    {
+        // check that passed value is valid
+        other.assert_invariant();
+
+        using std::swap;
+        swap(m_type, other.m_type);
+        swap(m_value, other.m_value);
+
+        assert_invariant();
+        return *this;
+    }
+
+    /*!
+    @brief destructor
+
+    Destroys the JSON value and frees all allocated memory.
+
+    @complexity Linear.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is linear.
+    - All stored elements are destroyed and all memory is freed.
+
+    @since version 1.0.0
+    */
+    ~basic_json() noexcept
+    {
+        assert_invariant();
+        m_value.destroy(m_type);
+    }
+
+    /// @}
+
+  public:
+    ///////////////////////
+    // object inspection //
+    ///////////////////////
+
+    /// @name object inspection
+    /// Functions to inspect the type of a JSON value.
+    /// @{
+
+    /*!
+    @brief serialization
+
+    Serialization function for JSON values. The function tries to mimic
+    Python's `json.dumps()` function, and currently supports its @a indent
+    and @a ensure_ascii parameters.
+
+    @param[in] indent If indent is nonnegative, then array elements and object
+    members will be pretty-printed with that indent level. An indent level of
+    `0` will only insert newlines. `-1` (the default) selects the most compact
+    representation.
+    @param[in] indent_char The character to use for indentation if @a indent is
+    greater than `0`. The default is ` ` (space).
+    @param[in] ensure_ascii If @a ensure_ascii is true, all non-ASCII characters
+    in the output are escaped with `\uXXXX` sequences, and the result consists
+    of ASCII characters only.
+
+    @return string containing the serialization of the JSON value
+
+    @throw type_error.316 if a string stored inside the JSON value is not
+                          UTF-8 encoded
+
+    @complexity Linear.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes in the JSON value.
+
+    @liveexample{The following example shows the effect of different @a indent\,
+    @a indent_char\, and @a ensure_ascii parameters to the result of the
+    serialization.,dump}
+
+    @see https://docs.python.org/2/library/json.html#json.dump
+
+    @since version 1.0.0; indentation character @a indent_char, option
+           @a ensure_ascii and exceptions added in version 3.0.0
+    */
+    string_t dump(const int indent = -1, const char indent_char = ' ',
+                  const bool ensure_ascii = false) const
+    {
+        string_t result;
+        serializer s(detail::output_adapter<char, string_t>(result), indent_char);
+
+        if (indent >= 0)
+        {
+            s.dump(*this, true, ensure_ascii, static_cast<unsigned int>(indent));
+        }
+        else
+        {
+            s.dump(*this, false, ensure_ascii, 0);
+        }
+
+        return result;
+    }
+
+    /*!
+    @brief return the type of the JSON value (explicit)
+
+    Return the type of the JSON value as a value from the @ref value_t
+    enumeration.
+
+    @return the type of the JSON value
+            Value type                | return value
+            ------------------------- | -------------------------
+            null                      | value_t::null
+            boolean                   | value_t::boolean
+            string                    | value_t::string
+            number (integer)          | value_t::number_integer
+            number (unsigned integer) | value_t::number_unsigned
+            number (floating-point)   | value_t::number_float
+            object                    | value_t::object
+            array                     | value_t::array
+            discarded                 | value_t::discarded
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `type()` for all JSON
+    types.,type}
+
+    @sa @ref operator value_t() -- return the type of the JSON value (implicit)
+    @sa @ref type_name() -- return the type as string
+
+    @since version 1.0.0
+    */
+    constexpr value_t type() const noexcept
+    {
+        return m_type;
+    }
+
+    /*!
+    @brief return whether type is primitive
+
+    This function returns true if and only if the JSON type is primitive
+    (string, number, boolean, or null).
+
+    @return `true` if type is primitive (string, number, boolean, or null),
+    `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_primitive()` for all JSON
+    types.,is_primitive}
+
+    @sa @ref is_structured() -- returns whether JSON value is structured
+    @sa @ref is_null() -- returns whether JSON value is `null`
+    @sa @ref is_string() -- returns whether JSON value is a string
+    @sa @ref is_boolean() -- returns whether JSON value is a boolean
+    @sa @ref is_number() -- returns whether JSON value is a number
+
+    @since version 1.0.0
+    */
+    constexpr bool is_primitive() const noexcept
+    {
+        return is_null() or is_string() or is_boolean() or is_number();
+    }
+
+    /*!
+    @brief return whether type is structured
+
+    This function returns true if and only if the JSON type is structured
+    (array or object).
+
+    @return `true` if type is structured (array or object), `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_structured()` for all JSON
+    types.,is_structured}
+
+    @sa @ref is_primitive() -- returns whether value is primitive
+    @sa @ref is_array() -- returns whether value is an array
+    @sa @ref is_object() -- returns whether value is an object
+
+    @since version 1.0.0
+    */
+    constexpr bool is_structured() const noexcept
+    {
+        return is_array() or is_object();
+    }
+
+    /*!
+    @brief return whether value is null
+
+    This function returns true if and only if the JSON value is null.
+
+    @return `true` if type is null, `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_null()` for all JSON
+    types.,is_null}
+
+    @since version 1.0.0
+    */
+    constexpr bool is_null() const noexcept
+    {
+        return (m_type == value_t::null);
+    }
+
+    /*!
+    @brief return whether value is a boolean
+
+    This function returns true if and only if the JSON value is a boolean.
+
+    @return `true` if type is boolean, `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_boolean()` for all JSON
+    types.,is_boolean}
+
+    @since version 1.0.0
+    */
+    constexpr bool is_boolean() const noexcept
+    {
+        return (m_type == value_t::boolean);
+    }
+
+    /*!
+    @brief return whether value is a number
+
+    This function returns true if and only if the JSON value is a number. This
+    includes both integer (signed and unsigned) and floating-point values.
+
+    @return `true` if type is number (regardless whether integer, unsigned
+    integer or floating-type), `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_number()` for all JSON
+    types.,is_number}
+
+    @sa @ref is_number_integer() -- check if value is an integer or unsigned
+    integer number
+    @sa @ref is_number_unsigned() -- check if value is an unsigned integer
+    number
+    @sa @ref is_number_float() -- check if value is a floating-point number
+
+    @since version 1.0.0
+    */
+    constexpr bool is_number() const noexcept
+    {
+        return is_number_integer() or is_number_float();
+    }
+
+    /*!
+    @brief return whether value is an integer number
+
+    This function returns true if and only if the JSON value is a signed or
+    unsigned integer number. This excludes floating-point values.
+
+    @return `true` if type is an integer or unsigned integer number, `false`
+    otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_number_integer()` for all
+    JSON types.,is_number_integer}
+
+    @sa @ref is_number() -- check if value is a number
+    @sa @ref is_number_unsigned() -- check if value is an unsigned integer
+    number
+    @sa @ref is_number_float() -- check if value is a floating-point number
+
+    @since version 1.0.0
+    */
+    constexpr bool is_number_integer() const noexcept
+    {
+        return (m_type == value_t::number_integer or m_type == value_t::number_unsigned);
+    }
+
+    /*!
+    @brief return whether value is an unsigned integer number
+
+    This function returns true if and only if the JSON value is an unsigned
+    integer number. This excludes floating-point and signed integer values.
+
+    @return `true` if type is an unsigned integer number, `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_number_unsigned()` for all
+    JSON types.,is_number_unsigned}
+
+    @sa @ref is_number() -- check if value is a number
+    @sa @ref is_number_integer() -- check if value is an integer or unsigned
+    integer number
+    @sa @ref is_number_float() -- check if value is a floating-point number
+
+    @since version 2.0.0
+    */
+    constexpr bool is_number_unsigned() const noexcept
+    {
+        return (m_type == value_t::number_unsigned);
+    }
+
+    /*!
+    @brief return whether value is a floating-point number
+
+    This function returns true if and only if the JSON value is a
+    floating-point number. This excludes signed and unsigned integer values.
+
+    @return `true` if type is a floating-point number, `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_number_float()` for all
+    JSON types.,is_number_float}
+
+    @sa @ref is_number() -- check if value is number
+    @sa @ref is_number_integer() -- check if value is an integer number
+    @sa @ref is_number_unsigned() -- check if value is an unsigned integer
+    number
+
+    @since version 1.0.0
+    */
+    constexpr bool is_number_float() const noexcept
+    {
+        return (m_type == value_t::number_float);
+    }
+
+    /*!
+    @brief return whether value is an object
+
+    This function returns true if and only if the JSON value is an object.
+
+    @return `true` if type is object, `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_object()` for all JSON
+    types.,is_object}
+
+    @since version 1.0.0
+    */
+    constexpr bool is_object() const noexcept
+    {
+        return (m_type == value_t::object);
+    }
+
+    /*!
+    @brief return whether value is an array
+
+    This function returns true if and only if the JSON value is an array.
+
+    @return `true` if type is array, `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_array()` for all JSON
+    types.,is_array}
+
+    @since version 1.0.0
+    */
+    constexpr bool is_array() const noexcept
+    {
+        return (m_type == value_t::array);
+    }
+
+    /*!
+    @brief return whether value is a string
+
+    This function returns true if and only if the JSON value is a string.
+
+    @return `true` if type is string, `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_string()` for all JSON
+    types.,is_string}
+
+    @since version 1.0.0
+    */
+    constexpr bool is_string() const noexcept
+    {
+        return (m_type == value_t::string);
+    }
+
+    /*!
+    @brief return whether value is discarded
+
+    This function returns true if and only if the JSON value was discarded
+    during parsing with a callback function (see @ref parser_callback_t).
+
+    @note This function will always be `false` for JSON values after parsing.
+    That is, discarded values can only occur during parsing, but will be
+    removed when inside a structured value or replaced by null in other cases.
+
+    @return `true` if type is discarded, `false` otherwise.
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies `is_discarded()` for all JSON
+    types.,is_discarded}
+
+    @since version 1.0.0
+    */
+    constexpr bool is_discarded() const noexcept
+    {
+        return (m_type == value_t::discarded);
+    }
+
+    /*!
+    @brief return the type of the JSON value (implicit)
+
+    Implicitly return the type of the JSON value as a value from the @ref
+    value_t enumeration.
+
+    @return the type of the JSON value
+
+    @complexity Constant.
+
+    @exceptionsafety No-throw guarantee: this member function never throws
+    exceptions.
+
+    @liveexample{The following code exemplifies the @ref value_t operator for
+    all JSON types.,operator__value_t}
+
+    @sa @ref type() -- return the type of the JSON value (explicit)
+    @sa @ref type_name() -- return the type as string
+
+    @since version 1.0.0
+    */
+    constexpr operator value_t() const noexcept
+    {
+        return m_type;
+    }
+
+    /// @}
+
+  private:
+    //////////////////
+    // value access //
+    //////////////////
+
+    /// get a boolean (explicit)
+    boolean_t get_impl(boolean_t* /*unused*/) const
+    {
+        if (JSON_LIKELY(is_boolean()))
+        {
+            return m_value.boolean;
+        }
+
+        JSON_THROW(type_error::create(302, "type must be boolean, but is " + std::string(type_name())));
+    }
+
+    /// get a pointer to the value (object)
+    object_t* get_impl_ptr(object_t* /*unused*/) noexcept
+    {
+        return is_object() ? m_value.object : nullptr;
+    }
+
+    /// get a pointer to the value (object)
+    constexpr const object_t* get_impl_ptr(const object_t* /*unused*/) const noexcept
+    {
+        return is_object() ? m_value.object : nullptr;
+    }
+
+    /// get a pointer to the value (array)
+    array_t* get_impl_ptr(array_t* /*unused*/) noexcept
+    {
+        return is_array() ? m_value.array : nullptr;
+    }
+
+    /// get a pointer to the value (array)
+    constexpr const array_t* get_impl_ptr(const array_t* /*unused*/) const noexcept
+    {
+        return is_array() ? m_value.array : nullptr;
+    }
+
+    /// get a pointer to the value (string)
+    string_t* get_impl_ptr(string_t* /*unused*/) noexcept
+    {
+        return is_string() ? m_value.string : nullptr;
+    }
+
+    /// get a pointer to the value (string)
+    constexpr const string_t* get_impl_ptr(const string_t* /*unused*/) const noexcept
+    {
+        return is_string() ? m_value.string : nullptr;
+    }
+
+    /// get a pointer to the value (boolean)
+    boolean_t* get_impl_ptr(boolean_t* /*unused*/) noexcept
+    {
+        return is_boolean() ? &m_value.boolean : nullptr;
+    }
+
+    /// get a pointer to the value (boolean)
+    constexpr const boolean_t* get_impl_ptr(const boolean_t* /*unused*/) const noexcept
+    {
+        return is_boolean() ? &m_value.boolean : nullptr;
+    }
+
+    /// get a pointer to the value (integer number)
+    number_integer_t* get_impl_ptr(number_integer_t* /*unused*/) noexcept
+    {
+        return is_number_integer() ? &m_value.number_integer : nullptr;
+    }
+
+    /// get a pointer to the value (integer number)
+    constexpr const number_integer_t* get_impl_ptr(const number_integer_t* /*unused*/) const noexcept
+    {
+        return is_number_integer() ? &m_value.number_integer : nullptr;
+    }
+
+    /// get a pointer to the value (unsigned number)
+    number_unsigned_t* get_impl_ptr(number_unsigned_t* /*unused*/) noexcept
+    {
+        return is_number_unsigned() ? &m_value.number_unsigned : nullptr;
+    }
+
+    /// get a pointer to the value (unsigned number)
+    constexpr const number_unsigned_t* get_impl_ptr(const number_unsigned_t* /*unused*/) const noexcept
+    {
+        return is_number_unsigned() ? &m_value.number_unsigned : nullptr;
+    }
+
+    /// get a pointer to the value (floating-point number)
+    number_float_t* get_impl_ptr(number_float_t* /*unused*/) noexcept
+    {
+        return is_number_float() ? &m_value.number_float : nullptr;
+    }
+
+    /// get a pointer to the value (floating-point number)
+    constexpr const number_float_t* get_impl_ptr(const number_float_t* /*unused*/) const noexcept
+    {
+        return is_number_float() ? &m_value.number_float : nullptr;
+    }
+
+    /*!
+    @brief helper function to implement get_ref()
+
+    This function helps to implement get_ref() without code duplication for
+    const and non-const overloads
+
+    @tparam ThisType will be deduced as `basic_json` or `const basic_json`
+
+    @throw type_error.303 if ReferenceType does not match underlying value
+    type of the current JSON
+    */
+    template<typename ReferenceType, typename ThisType>
+    static ReferenceType get_ref_impl(ThisType& obj)
+    {
+        // delegate the call to get_ptr<>()
+        auto ptr = obj.template get_ptr<typename std::add_pointer<ReferenceType>::type>();
+
+        if (JSON_LIKELY(ptr != nullptr))
+        {
+            return *ptr;
+        }
+
+        JSON_THROW(type_error::create(303, "incompatible ReferenceType for get_ref, actual type is " + std::string(obj.type_name())));
+    }
+
+  public:
+    /// @name value access
+    /// Direct access to the stored value of a JSON value.
+    /// @{
+
+    /*!
+    @brief get special-case overload
+
+    This overloads avoids a lot of template boilerplate, it can be seen as the
+    identity method
+
+    @tparam BasicJsonType == @ref basic_json
+
+    @return a copy of *this
+
+    @complexity Constant.
+
+    @since version 2.1.0
+    */
+    template<typename BasicJsonType, detail::enable_if_t<
+                 std::is_same<typename std::remove_const<BasicJsonType>::type, basic_json_t>::value,
+                 int> = 0>
+    basic_json get() const
+    {
+        return *this;
+    }
+
+    /*!
+    @brief get special-case overload
+
+    This overloads converts the current @ref basic_json in a different
+    @ref basic_json type
+
+    @tparam BasicJsonType == @ref basic_json
+
+    @return a copy of *this, converted into @tparam BasicJsonType
+
+    @complexity Depending on the implementation of the called `from_json()`
+                method.
+
+    @since version 3.2.0
+    */
+    template<typename BasicJsonType, detail::enable_if_t<
+                 not std::is_same<BasicJsonType, basic_json>::value and
+                 detail::is_basic_json<BasicJsonType>::value, int> = 0>
+    BasicJsonType get() const
+    {
+        return *this;
+    }
+
+    /*!
+    @brief get a value (explicit)
+
+    Explicit type conversion between the JSON value and a compatible value
+    which is [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible)
+    and [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible).
+    The value is converted by calling the @ref json_serializer<ValueType>
+    `from_json()` method.
+
+    The function is equivalent to executing
+    @code {.cpp}
+    ValueType ret;
+    JSONSerializer<ValueType>::from_json(*this, ret);
+    return ret;
+    @endcode
+
+    This overloads is chosen if:
+    - @a ValueType is not @ref basic_json,
+    - @ref json_serializer<ValueType> has a `from_json()` method of the form
+      `void from_json(const basic_json&, ValueType&)`, and
+    - @ref json_serializer<ValueType> does not have a `from_json()` method of
+      the form `ValueType from_json(const basic_json&)`
+
+    @tparam ValueTypeCV the provided value type
+    @tparam ValueType the returned value type
+
+    @return copy of the JSON value, converted to @a ValueType
+
+    @throw what @ref json_serializer<ValueType> `from_json()` method throws
+
+    @liveexample{The example below shows several conversions from JSON values
+    to other types. There a few things to note: (1) Floating-point numbers can
+    be converted to integers\, (2) A JSON array can be converted to a standard
+    `std::vector<short>`\, (3) A JSON object can be converted to C++
+    associative containers such as `std::unordered_map<std::string\,
+    json>`.,get__ValueType_const}
+
+    @since version 2.1.0
+    */
+    template<typename ValueTypeCV, typename ValueType = detail::uncvref_t<ValueTypeCV>,
+             detail::enable_if_t <
+                 not detail::is_basic_json<ValueType>::value and
+                 detail::has_from_json<basic_json_t, ValueType>::value and
+                 not detail::has_non_default_from_json<basic_json_t, ValueType>::value,
+                 int> = 0>
+    ValueType get() const noexcept(noexcept(
+                                       JSONSerializer<ValueType>::from_json(std::declval<const basic_json_t&>(), std::declval<ValueType&>())))
+    {
+        // we cannot static_assert on ValueTypeCV being non-const, because
+        // there is support for get<const basic_json_t>(), which is why we
+        // still need the uncvref
+        static_assert(not std::is_reference<ValueTypeCV>::value,
+                      "get() cannot be used with reference types, you might want to use get_ref()");
+        static_assert(std::is_default_constructible<ValueType>::value,
+                      "types must be DefaultConstructible when used with get()");
+
+        ValueType ret;
+        JSONSerializer<ValueType>::from_json(*this, ret);
+        return ret;
+    }
+
+    /*!
+    @brief get a value (explicit); special case
+
+    Explicit type conversion between the JSON value and a compatible value
+    which is **not** [CopyConstructible](https://en.cppreference.com/w/cpp/named_req/CopyConstructible)
+    and **not** [DefaultConstructible](https://en.cppreference.com/w/cpp/named_req/DefaultConstructible).
+    The value is converted by calling the @ref json_serializer<ValueType>
+    `from_json()` method.
+
+    The function is equivalent to executing
+    @code {.cpp}
+    return JSONSerializer<ValueTypeCV>::from_json(*this);
+    @endcode
+
+    This overloads is chosen if:
+    - @a ValueType is not @ref basic_json and
+    - @ref json_serializer<ValueType> has a `from_json()` method of the form
+      `ValueType from_json(const basic_json&)`
+
+    @note If @ref json_serializer<ValueType> has both overloads of
+    `from_json()`, this one is chosen.
+
+    @tparam ValueTypeCV the provided value type
+    @tparam ValueType the returned value type
+
+    @return copy of the JSON value, converted to @a ValueType
+
+    @throw what @ref json_serializer<ValueType> `from_json()` method throws
+
+    @since version 2.1.0
+    */
+    template<typename ValueTypeCV, typename ValueType = detail::uncvref_t<ValueTypeCV>,
+             detail::enable_if_t<not std::is_same<basic_json_t, ValueType>::value and
+                                 detail::has_non_default_from_json<basic_json_t, ValueType>::value,
+                                 int> = 0>
+    ValueType get() const noexcept(noexcept(
+                                       JSONSerializer<ValueTypeCV>::from_json(std::declval<const basic_json_t&>())))
+    {
+        static_assert(not std::is_reference<ValueTypeCV>::value,
+                      "get() cannot be used with reference types, you might want to use get_ref()");
+        return JSONSerializer<ValueTypeCV>::from_json(*this);
+    }
+
+    /*!
+    @brief get a pointer value (explicit)
+
+    Explicit pointer access to the internally stored JSON value. No copies are
+    made.
+
+    @warning The pointer becomes invalid if the underlying JSON object
+    changes.
+
+    @tparam PointerType pointer type; must be a pointer to @ref array_t, @ref
+    object_t, @ref string_t, @ref boolean_t, @ref number_integer_t,
+    @ref number_unsigned_t, or @ref number_float_t.
+
+    @return pointer to the internally stored JSON value if the requested
+    pointer type @a PointerType fits to the JSON value; `nullptr` otherwise
+
+    @complexity Constant.
+
+    @liveexample{The example below shows how pointers to internal values of a
+    JSON value can be requested. Note that no type conversions are made and a
+    `nullptr` is returned if the value and the requested pointer type does not
+    match.,get__PointerType}
+
+    @sa @ref get_ptr() for explicit pointer-member access
+
+    @since version 1.0.0
+    */
+    template<typename PointerType, typename std::enable_if<
+                 std::is_pointer<PointerType>::value, int>::type = 0>
+    PointerType get() noexcept
+    {
+        // delegate the call to get_ptr
+        return get_ptr<PointerType>();
+    }
+
+    /*!
+    @brief get a pointer value (explicit)
+    @copydoc get()
+    */
+    template<typename PointerType, typename std::enable_if<
+                 std::is_pointer<PointerType>::value, int>::type = 0>
+    constexpr const PointerType get() const noexcept
+    {
+        // delegate the call to get_ptr
+        return get_ptr<PointerType>();
+    }
+
+    /*!
+    @brief get a pointer value (implicit)
+
+    Implicit pointer access to the internally stored JSON value. No copies are
+    made.
+
+    @warning Writing data to the pointee of the result yields an undefined
+    state.
+
+    @tparam PointerType pointer type; must be a pointer to @ref array_t, @ref
+    object_t, @ref string_t, @ref boolean_t, @ref number_integer_t,
+    @ref number_unsigned_t, or @ref number_float_t. Enforced by a static
+    assertion.
+
+    @return pointer to the internally stored JSON value if the requested
+    pointer type @a PointerType fits to the JSON value; `nullptr` otherwise
+
+    @complexity Constant.
+
+    @liveexample{The example below shows how pointers to internal values of a
+    JSON value can be requested. Note that no type conversions are made and a
+    `nullptr` is returned if the value and the requested pointer type does not
+    match.,get_ptr}
+
+    @since version 1.0.0
+    */
+    template<typename PointerType, typename std::enable_if<
+                 std::is_pointer<PointerType>::value, int>::type = 0>
+    PointerType get_ptr() noexcept
+    {
+        // get the type of the PointerType (remove pointer and const)
+        using pointee_t = typename std::remove_const<typename
+                          std::remove_pointer<typename
+                          std::remove_const<PointerType>::type>::type>::type;
+        // make sure the type matches the allowed types
+        static_assert(
+            std::is_same<object_t, pointee_t>::value
+            or std::is_same<array_t, pointee_t>::value
+            or std::is_same<string_t, pointee_t>::value
+            or std::is_same<boolean_t, pointee_t>::value
+            or std::is_same<number_integer_t, pointee_t>::value
+            or std::is_same<number_unsigned_t, pointee_t>::value
+            or std::is_same<number_float_t, pointee_t>::value
+            , "incompatible pointer type");
+
+        // delegate the call to get_impl_ptr<>()
+        return get_impl_ptr(static_cast<PointerType>(nullptr));
+    }
+
+    /*!
+    @brief get a pointer value (implicit)
+    @copydoc get_ptr()
+    */
+    template<typename PointerType, typename std::enable_if<
+                 std::is_pointer<PointerType>::value and
+                 std::is_const<typename std::remove_pointer<PointerType>::type>::value, int>::type = 0>
+    constexpr const PointerType get_ptr() const noexcept
+    {
+        // get the type of the PointerType (remove pointer and const)
+        using pointee_t = typename std::remove_const<typename
+                          std::remove_pointer<typename
+                          std::remove_const<PointerType>::type>::type>::type;
+        // make sure the type matches the allowed types
+        static_assert(
+            std::is_same<object_t, pointee_t>::value
+            or std::is_same<array_t, pointee_t>::value
+            or std::is_same<string_t, pointee_t>::value
+            or std::is_same<boolean_t, pointee_t>::value
+            or std::is_same<number_integer_t, pointee_t>::value
+            or std::is_same<number_unsigned_t, pointee_t>::value
+            or std::is_same<number_float_t, pointee_t>::value
+            , "incompatible pointer type");
+
+        // delegate the call to get_impl_ptr<>() const
+        return get_impl_ptr(static_cast<PointerType>(nullptr));
+    }
+
+    /*!
+    @brief get a reference value (implicit)
+
+    Implicit reference access to the internally stored JSON value. No copies
+    are made.
+
+    @warning Writing data to the referee of the result yields an undefined
+    state.
+
+    @tparam ReferenceType reference type; must be a reference to @ref array_t,
+    @ref object_t, @ref string_t, @ref boolean_t, @ref number_integer_t, or
+    @ref number_float_t. Enforced by static assertion.
+
+    @return reference to the internally stored JSON value if the requested
+    reference type @a ReferenceType fits to the JSON value; throws
+    type_error.303 otherwise
+
+    @throw type_error.303 in case passed type @a ReferenceType is incompatible
+    with the stored JSON value; see example below
+
+    @complexity Constant.
+
+    @liveexample{The example shows several calls to `get_ref()`.,get_ref}
+
+    @since version 1.1.0
+    */
+    template<typename ReferenceType, typename std::enable_if<
+                 std::is_reference<ReferenceType>::value, int>::type = 0>
+    ReferenceType get_ref()
+    {
+        // delegate call to get_ref_impl
+        return get_ref_impl<ReferenceType>(*this);
+    }
+
+    /*!
+    @brief get a reference value (implicit)
+    @copydoc get_ref()
+    */
+    template<typename ReferenceType, typename std::enable_if<
+                 std::is_reference<ReferenceType>::value and
+                 std::is_const<typename std::remove_reference<ReferenceType>::type>::value, int>::type = 0>
+    ReferenceType get_ref() const
+    {
+        // delegate call to get_ref_impl
+        return get_ref_impl<ReferenceType>(*this);
+    }
+
+    /*!
+    @brief get a value (implicit)
+
+    Implicit type conversion between the JSON value and a compatible value.
+    The call is realized by calling @ref get() const.
+
+    @tparam ValueType non-pointer type compatible to the JSON value, for
+    instance `int` for JSON integer numbers, `bool` for JSON booleans, or
+    `std::vector` types for JSON arrays. The character type of @ref string_t
+    as well as an initializer list of this type is excluded to avoid
+    ambiguities as these types implicitly convert to `std::string`.
+
+    @return copy of the JSON value, converted to type @a ValueType
+
+    @throw type_error.302 in case passed type @a ValueType is incompatible
+    to the JSON value type (e.g., the JSON value is of type boolean, but a
+    string is requested); see example below
+
+    @complexity Linear in the size of the JSON value.
+
+    @liveexample{The example below shows several conversions from JSON values
+    to other types. There a few things to note: (1) Floating-point numbers can
+    be converted to integers\, (2) A JSON array can be converted to a standard
+    `std::vector<short>`\, (3) A JSON object can be converted to C++
+    associative containers such as `std::unordered_map<std::string\,
+    json>`.,operator__ValueType}
+
+    @since version 1.0.0
+    */
+    template < typename ValueType, typename std::enable_if <
+                   not std::is_pointer<ValueType>::value and
+                   not std::is_same<ValueType, detail::json_ref<basic_json>>::value and
+                   not std::is_same<ValueType, typename string_t::value_type>::value and
+                   not detail::is_basic_json<ValueType>::value
+#ifndef _MSC_VER  // fix for issue #167 operator<< ambiguity under VS2015
+                   and not std::is_same<ValueType, std::initializer_list<typename string_t::value_type>>::value
+#if defined(JSON_HAS_CPP_17) && defined(_MSC_VER) and _MSC_VER <= 1914
+                   and not std::is_same<ValueType, typename std::string_view>::value
+#endif
+#endif
+                   , int >::type = 0 >
+    operator ValueType() const
+    {
+        // delegate the call to get<>() const
+        return get<ValueType>();
+    }
+
+    /// @}
+
+
+    ////////////////////
+    // element access //
+    ////////////////////
+
+    /// @name element access
+    /// Access to the JSON value.
+    /// @{
+
+    /*!
+    @brief access specified array element with bounds checking
+
+    Returns a reference to the element at specified location @a idx, with
+    bounds checking.
+
+    @param[in] idx  index of the element to access
+
+    @return reference to the element at index @a idx
+
+    @throw type_error.304 if the JSON value is not an array; in this case,
+    calling `at` with an index makes no sense. See example below.
+    @throw out_of_range.401 if the index @a idx is out of range of the array;
+    that is, `idx >= size()`. See example below.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes in the JSON value.
+
+    @complexity Constant.
+
+    @since version 1.0.0
+
+    @liveexample{The example below shows how array elements can be read and
+    written using `at()`. It also demonstrates the different exceptions that
+    can be thrown.,at__size_type}
+    */
+    reference at(size_type idx)
+    {
+        // at only works for arrays
+        if (JSON_LIKELY(is_array()))
+        {
+            JSON_TRY
+            {
+                return m_value.array->at(idx);
+            }
+            JSON_CATCH (std::out_of_range&)
+            {
+                // create better exception explanation
+                JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range"));
+            }
+        }
+        else
+        {
+            JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name())));
+        }
+    }
+
+    /*!
+    @brief access specified array element with bounds checking
+
+    Returns a const reference to the element at specified location @a idx,
+    with bounds checking.
+
+    @param[in] idx  index of the element to access
+
+    @return const reference to the element at index @a idx
+
+    @throw type_error.304 if the JSON value is not an array; in this case,
+    calling `at` with an index makes no sense. See example below.
+    @throw out_of_range.401 if the index @a idx is out of range of the array;
+    that is, `idx >= size()`. See example below.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes in the JSON value.
+
+    @complexity Constant.
+
+    @since version 1.0.0
+
+    @liveexample{The example below shows how array elements can be read using
+    `at()`. It also demonstrates the different exceptions that can be thrown.,
+    at__size_type_const}
+    */
+    const_reference at(size_type idx) const
+    {
+        // at only works for arrays
+        if (JSON_LIKELY(is_array()))
+        {
+            JSON_TRY
+            {
+                return m_value.array->at(idx);
+            }
+            JSON_CATCH (std::out_of_range&)
+            {
+                // create better exception explanation
+                JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range"));
+            }
+        }
+        else
+        {
+            JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name())));
+        }
+    }
+
+    /*!
+    @brief access specified object element with bounds checking
+
+    Returns a reference to the element at with specified key @a key, with
+    bounds checking.
+
+    @param[in] key  key of the element to access
+
+    @return reference to the element at key @a key
+
+    @throw type_error.304 if the JSON value is not an object; in this case,
+    calling `at` with a key makes no sense. See example below.
+    @throw out_of_range.403 if the key @a key is is not stored in the object;
+    that is, `find(key) == end()`. See example below.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes in the JSON value.
+
+    @complexity Logarithmic in the size of the container.
+
+    @sa @ref operator[](const typename object_t::key_type&) for unchecked
+    access by reference
+    @sa @ref value() for access by value with a default value
+
+    @since version 1.0.0
+
+    @liveexample{The example below shows how object elements can be read and
+    written using `at()`. It also demonstrates the different exceptions that
+    can be thrown.,at__object_t_key_type}
+    */
+    reference at(const typename object_t::key_type& key)
+    {
+        // at only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            JSON_TRY
+            {
+                return m_value.object->at(key);
+            }
+            JSON_CATCH (std::out_of_range&)
+            {
+                // create better exception explanation
+                JSON_THROW(out_of_range::create(403, "key '" + key + "' not found"));
+            }
+        }
+        else
+        {
+            JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name())));
+        }
+    }
+
+    /*!
+    @brief access specified object element with bounds checking
+
+    Returns a const reference to the element at with specified key @a key,
+    with bounds checking.
+
+    @param[in] key  key of the element to access
+
+    @return const reference to the element at key @a key
+
+    @throw type_error.304 if the JSON value is not an object; in this case,
+    calling `at` with a key makes no sense. See example below.
+    @throw out_of_range.403 if the key @a key is is not stored in the object;
+    that is, `find(key) == end()`. See example below.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes in the JSON value.
+
+    @complexity Logarithmic in the size of the container.
+
+    @sa @ref operator[](const typename object_t::key_type&) for unchecked
+    access by reference
+    @sa @ref value() for access by value with a default value
+
+    @since version 1.0.0
+
+    @liveexample{The example below shows how object elements can be read using
+    `at()`. It also demonstrates the different exceptions that can be thrown.,
+    at__object_t_key_type_const}
+    */
+    const_reference at(const typename object_t::key_type& key) const
+    {
+        // at only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            JSON_TRY
+            {
+                return m_value.object->at(key);
+            }
+            JSON_CATCH (std::out_of_range&)
+            {
+                // create better exception explanation
+                JSON_THROW(out_of_range::create(403, "key '" + key + "' not found"));
+            }
+        }
+        else
+        {
+            JSON_THROW(type_error::create(304, "cannot use at() with " + std::string(type_name())));
+        }
+    }
+
+    /*!
+    @brief access specified array element
+
+    Returns a reference to the element at specified location @a idx.
+
+    @note If @a idx is beyond the range of the array (i.e., `idx >= size()`),
+    then the array is silently filled up with `null` values to make `idx` a
+    valid reference to the last stored element.
+
+    @param[in] idx  index of the element to access
+
+    @return reference to the element at index @a idx
+
+    @throw type_error.305 if the JSON value is not an array or null; in that
+    cases, using the [] operator with an index makes no sense.
+
+    @complexity Constant if @a idx is in the range of the array. Otherwise
+    linear in `idx - size()`.
+
+    @liveexample{The example below shows how array elements can be read and
+    written using `[]` operator. Note the addition of `null`
+    values.,operatorarray__size_type}
+
+    @since version 1.0.0
+    */
+    reference operator[](size_type idx)
+    {
+        // implicitly convert null value to an empty array
+        if (is_null())
+        {
+            m_type = value_t::array;
+            m_value.array = create<array_t>();
+            assert_invariant();
+        }
+
+        // operator[] only works for arrays
+        if (JSON_LIKELY(is_array()))
+        {
+            // fill up array with null values if given idx is outside range
+            if (idx >= m_value.array->size())
+            {
+                m_value.array->insert(m_value.array->end(),
+                                      idx - m_value.array->size() + 1,
+                                      basic_json());
+            }
+
+            return m_value.array->operator[](idx);
+        }
+
+        JSON_THROW(type_error::create(305, "cannot use operator[] with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief access specified array element
+
+    Returns a const reference to the element at specified location @a idx.
+
+    @param[in] idx  index of the element to access
+
+    @return const reference to the element at index @a idx
+
+    @throw type_error.305 if the JSON value is not an array; in that case,
+    using the [] operator with an index makes no sense.
+
+    @complexity Constant.
+
+    @liveexample{The example below shows how array elements can be read using
+    the `[]` operator.,operatorarray__size_type_const}
+
+    @since version 1.0.0
+    */
+    const_reference operator[](size_type idx) const
+    {
+        // const operator[] only works for arrays
+        if (JSON_LIKELY(is_array()))
+        {
+            return m_value.array->operator[](idx);
+        }
+
+        JSON_THROW(type_error::create(305, "cannot use operator[] with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief access specified object element
+
+    Returns a reference to the element at with specified key @a key.
+
+    @note If @a key is not found in the object, then it is silently added to
+    the object and filled with a `null` value to make `key` a valid reference.
+    In case the value was `null` before, it is converted to an object.
+
+    @param[in] key  key of the element to access
+
+    @return reference to the element at key @a key
+
+    @throw type_error.305 if the JSON value is not an object or null; in that
+    cases, using the [] operator with a key makes no sense.
+
+    @complexity Logarithmic in the size of the container.
+
+    @liveexample{The example below shows how object elements can be read and
+    written using the `[]` operator.,operatorarray__key_type}
+
+    @sa @ref at(const typename object_t::key_type&) for access by reference
+    with range checking
+    @sa @ref value() for access by value with a default value
+
+    @since version 1.0.0
+    */
+    reference operator[](const typename object_t::key_type& key)
+    {
+        // implicitly convert null value to an empty object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value.object = create<object_t>();
+            assert_invariant();
+        }
+
+        // operator[] only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            return m_value.object->operator[](key);
+        }
+
+        JSON_THROW(type_error::create(305, "cannot use operator[] with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief read-only access specified object element
+
+    Returns a const reference to the element at with specified key @a key. No
+    bounds checking is performed.
+
+    @warning If the element with key @a key does not exist, the behavior is
+    undefined.
+
+    @param[in] key  key of the element to access
+
+    @return const reference to the element at key @a key
+
+    @pre The element with key @a key must exist. **This precondition is
+         enforced with an assertion.**
+
+    @throw type_error.305 if the JSON value is not an object; in that case,
+    using the [] operator with a key makes no sense.
+
+    @complexity Logarithmic in the size of the container.
+
+    @liveexample{The example below shows how object elements can be read using
+    the `[]` operator.,operatorarray__key_type_const}
+
+    @sa @ref at(const typename object_t::key_type&) for access by reference
+    with range checking
+    @sa @ref value() for access by value with a default value
+
+    @since version 1.0.0
+    */
+    const_reference operator[](const typename object_t::key_type& key) const
+    {
+        // const operator[] only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            assert(m_value.object->find(key) != m_value.object->end());
+            return m_value.object->find(key)->second;
+        }
+
+        JSON_THROW(type_error::create(305, "cannot use operator[] with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief access specified object element
+
+    Returns a reference to the element at with specified key @a key.
+
+    @note If @a key is not found in the object, then it is silently added to
+    the object and filled with a `null` value to make `key` a valid reference.
+    In case the value was `null` before, it is converted to an object.
+
+    @param[in] key  key of the element to access
+
+    @return reference to the element at key @a key
+
+    @throw type_error.305 if the JSON value is not an object or null; in that
+    cases, using the [] operator with a key makes no sense.
+
+    @complexity Logarithmic in the size of the container.
+
+    @liveexample{The example below shows how object elements can be read and
+    written using the `[]` operator.,operatorarray__key_type}
+
+    @sa @ref at(const typename object_t::key_type&) for access by reference
+    with range checking
+    @sa @ref value() for access by value with a default value
+
+    @since version 1.1.0
+    */
+    template<typename T>
+    reference operator[](T* key)
+    {
+        // implicitly convert null to object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value = value_t::object;
+            assert_invariant();
+        }
+
+        // at only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            return m_value.object->operator[](key);
+        }
+
+        JSON_THROW(type_error::create(305, "cannot use operator[] with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief read-only access specified object element
+
+    Returns a const reference to the element at with specified key @a key. No
+    bounds checking is performed.
+
+    @warning If the element with key @a key does not exist, the behavior is
+    undefined.
+
+    @param[in] key  key of the element to access
+
+    @return const reference to the element at key @a key
+
+    @pre The element with key @a key must exist. **This precondition is
+         enforced with an assertion.**
+
+    @throw type_error.305 if the JSON value is not an object; in that case,
+    using the [] operator with a key makes no sense.
+
+    @complexity Logarithmic in the size of the container.
+
+    @liveexample{The example below shows how object elements can be read using
+    the `[]` operator.,operatorarray__key_type_const}
+
+    @sa @ref at(const typename object_t::key_type&) for access by reference
+    with range checking
+    @sa @ref value() for access by value with a default value
+
+    @since version 1.1.0
+    */
+    template<typename T>
+    const_reference operator[](T* key) const
+    {
+        // at only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            assert(m_value.object->find(key) != m_value.object->end());
+            return m_value.object->find(key)->second;
+        }
+
+        JSON_THROW(type_error::create(305, "cannot use operator[] with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief access specified object element with default value
+
+    Returns either a copy of an object's element at the specified key @a key
+    or a given default value if no element with key @a key exists.
+
+    The function is basically equivalent to executing
+    @code {.cpp}
+    try {
+        return at(key);
+    } catch(out_of_range) {
+        return default_value;
+    }
+    @endcode
+
+    @note Unlike @ref at(const typename object_t::key_type&), this function
+    does not throw if the given key @a key was not found.
+
+    @note Unlike @ref operator[](const typename object_t::key_type& key), this
+    function does not implicitly add an element to the position defined by @a
+    key. This function is furthermore also applicable to const objects.
+
+    @param[in] key  key of the element to access
+    @param[in] default_value  the value to return if @a key is not found
+
+    @tparam ValueType type compatible to JSON values, for instance `int` for
+    JSON integer numbers, `bool` for JSON booleans, or `std::vector` types for
+    JSON arrays. Note the type of the expected value at @a key and the default
+    value @a default_value must be compatible.
+
+    @return copy of the element at key @a key or @a default_value if @a key
+    is not found
+
+    @throw type_error.306 if the JSON value is not an object; in that case,
+    using `value()` with a key makes no sense.
+
+    @complexity Logarithmic in the size of the container.
+
+    @liveexample{The example below shows how object elements can be queried
+    with a default value.,basic_json__value}
+
+    @sa @ref at(const typename object_t::key_type&) for access by reference
+    with range checking
+    @sa @ref operator[](const typename object_t::key_type&) for unchecked
+    access by reference
+
+    @since version 1.0.0
+    */
+    template<class ValueType, typename std::enable_if<
+                 std::is_convertible<basic_json_t, ValueType>::value, int>::type = 0>
+    ValueType value(const typename object_t::key_type& key, const ValueType& default_value) const
+    {
+        // at only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            // if key is found, return value and given default value otherwise
+            const auto it = find(key);
+            if (it != end())
+            {
+                return *it;
+            }
+
+            return default_value;
+        }
+
+        JSON_THROW(type_error::create(306, "cannot use value() with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief overload for a default value of type const char*
+    @copydoc basic_json::value(const typename object_t::key_type&, ValueType) const
+    */
+    string_t value(const typename object_t::key_type& key, const char* default_value) const
+    {
+        return value(key, string_t(default_value));
+    }
+
+    /*!
+    @brief access specified object element via JSON Pointer with default value
+
+    Returns either a copy of an object's element at the specified key @a key
+    or a given default value if no element with key @a key exists.
+
+    The function is basically equivalent to executing
+    @code {.cpp}
+    try {
+        return at(ptr);
+    } catch(out_of_range) {
+        return default_value;
+    }
+    @endcode
+
+    @note Unlike @ref at(const json_pointer&), this function does not throw
+    if the given key @a key was not found.
+
+    @param[in] ptr  a JSON pointer to the element to access
+    @param[in] default_value  the value to return if @a ptr found no value
+
+    @tparam ValueType type compatible to JSON values, for instance `int` for
+    JSON integer numbers, `bool` for JSON booleans, or `std::vector` types for
+    JSON arrays. Note the type of the expected value at @a key and the default
+    value @a default_value must be compatible.
+
+    @return copy of the element at key @a key or @a default_value if @a key
+    is not found
+
+    @throw type_error.306 if the JSON value is not an object; in that case,
+    using `value()` with a key makes no sense.
+
+    @complexity Logarithmic in the size of the container.
+
+    @liveexample{The example below shows how object elements can be queried
+    with a default value.,basic_json__value_ptr}
+
+    @sa @ref operator[](const json_pointer&) for unchecked access by reference
+
+    @since version 2.0.2
+    */
+    template<class ValueType, typename std::enable_if<
+                 std::is_convertible<basic_json_t, ValueType>::value, int>::type = 0>
+    ValueType value(const json_pointer& ptr, const ValueType& default_value) const
+    {
+        // at only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            // if pointer resolves a value, return it or use default value
+            JSON_TRY
+            {
+                return ptr.get_checked(this);
+            }
+            JSON_INTERNAL_CATCH (out_of_range&)
+            {
+                return default_value;
+            }
+        }
+
+        JSON_THROW(type_error::create(306, "cannot use value() with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief overload for a default value of type const char*
+    @copydoc basic_json::value(const json_pointer&, ValueType) const
+    */
+    string_t value(const json_pointer& ptr, const char* default_value) const
+    {
+        return value(ptr, string_t(default_value));
+    }
+
+    /*!
+    @brief access the first element
+
+    Returns a reference to the first element in the container. For a JSON
+    container `c`, the expression `c.front()` is equivalent to `*c.begin()`.
+
+    @return In case of a structured type (array or object), a reference to the
+    first element is returned. In case of number, string, or boolean values, a
+    reference to the value is returned.
+
+    @complexity Constant.
+
+    @pre The JSON value must not be `null` (would throw `std::out_of_range`)
+    or an empty array or object (undefined behavior, **guarded by
+    assertions**).
+    @post The JSON value remains unchanged.
+
+    @throw invalid_iterator.214 when called on `null` value
+
+    @liveexample{The following code shows an example for `front()`.,front}
+
+    @sa @ref back() -- access the last element
+
+    @since version 1.0.0
+    */
+    reference front()
+    {
+        return *begin();
+    }
+
+    /*!
+    @copydoc basic_json::front()
+    */
+    const_reference front() const
+    {
+        return *cbegin();
+    }
+
+    /*!
+    @brief access the last element
+
+    Returns a reference to the last element in the container. For a JSON
+    container `c`, the expression `c.back()` is equivalent to
+    @code {.cpp}
+    auto tmp = c.end();
+    --tmp;
+    return *tmp;
+    @endcode
+
+    @return In case of a structured type (array or object), a reference to the
+    last element is returned. In case of number, string, or boolean values, a
+    reference to the value is returned.
+
+    @complexity Constant.
+
+    @pre The JSON value must not be `null` (would throw `std::out_of_range`)
+    or an empty array or object (undefined behavior, **guarded by
+    assertions**).
+    @post The JSON value remains unchanged.
+
+    @throw invalid_iterator.214 when called on a `null` value. See example
+    below.
+
+    @liveexample{The following code shows an example for `back()`.,back}
+
+    @sa @ref front() -- access the first element
+
+    @since version 1.0.0
+    */
+    reference back()
+    {
+        auto tmp = end();
+        --tmp;
+        return *tmp;
+    }
+
+    /*!
+    @copydoc basic_json::back()
+    */
+    const_reference back() const
+    {
+        auto tmp = cend();
+        --tmp;
+        return *tmp;
+    }
+
+    /*!
+    @brief remove element given an iterator
+
+    Removes the element specified by iterator @a pos. The iterator @a pos must
+    be valid and dereferenceable. Thus the `end()` iterator (which is valid,
+    but is not dereferenceable) cannot be used as a value for @a pos.
+
+    If called on a primitive type other than `null`, the resulting JSON value
+    will be `null`.
+
+    @param[in] pos iterator to the element to remove
+    @return Iterator following the last removed element. If the iterator @a
+    pos refers to the last element, the `end()` iterator is returned.
+
+    @tparam IteratorType an @ref iterator or @ref const_iterator
+
+    @post Invalidates iterators and references at or after the point of the
+    erase, including the `end()` iterator.
+
+    @throw type_error.307 if called on a `null` value; example: `"cannot use
+    erase() with null"`
+    @throw invalid_iterator.202 if called on an iterator which does not belong
+    to the current JSON value; example: `"iterator does not fit current
+    value"`
+    @throw invalid_iterator.205 if called on a primitive type with invalid
+    iterator (i.e., any iterator which is not `begin()`); example: `"iterator
+    out of range"`
+
+    @complexity The complexity depends on the type:
+    - objects: amortized constant
+    - arrays: linear in distance between @a pos and the end of the container
+    - strings: linear in the length of the string
+    - other types: constant
+
+    @liveexample{The example shows the result of `erase()` for different JSON
+    types.,erase__IteratorType}
+
+    @sa @ref erase(IteratorType, IteratorType) -- removes the elements in
+    the given range
+    @sa @ref erase(const typename object_t::key_type&) -- removes the element
+    from an object at the given key
+    @sa @ref erase(const size_type) -- removes the element from an array at
+    the given index
+
+    @since version 1.0.0
+    */
+    template<class IteratorType, typename std::enable_if<
+                 std::is_same<IteratorType, typename basic_json_t::iterator>::value or
+                 std::is_same<IteratorType, typename basic_json_t::const_iterator>::value, int>::type
+             = 0>
+    IteratorType erase(IteratorType pos)
+    {
+        // make sure iterator fits the current value
+        if (JSON_UNLIKELY(this != pos.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value"));
+        }
+
+        IteratorType result = end();
+
+        switch (m_type)
+        {
+            case value_t::boolean:
+            case value_t::number_float:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::string:
+            {
+                if (JSON_UNLIKELY(not pos.m_it.primitive_iterator.is_begin()))
+                {
+                    JSON_THROW(invalid_iterator::create(205, "iterator out of range"));
+                }
+
+                if (is_string())
+                {
+                    AllocatorType<string_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_value.string);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_value.string, 1);
+                    m_value.string = nullptr;
+                }
+
+                m_type = value_t::null;
+                assert_invariant();
+                break;
+            }
+
+            case value_t::object:
+            {
+                result.m_it.object_iterator = m_value.object->erase(pos.m_it.object_iterator);
+                break;
+            }
+
+            case value_t::array:
+            {
+                result.m_it.array_iterator = m_value.array->erase(pos.m_it.array_iterator);
+                break;
+            }
+
+            default:
+                JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name())));
+        }
+
+        return result;
+    }
+
+    /*!
+    @brief remove elements given an iterator range
+
+    Removes the element specified by the range `[first; last)`. The iterator
+    @a first does not need to be dereferenceable if `first == last`: erasing
+    an empty range is a no-op.
+
+    If called on a primitive type other than `null`, the resulting JSON value
+    will be `null`.
+
+    @param[in] first iterator to the beginning of the range to remove
+    @param[in] last iterator past the end of the range to remove
+    @return Iterator following the last removed element. If the iterator @a
+    second refers to the last element, the `end()` iterator is returned.
+
+    @tparam IteratorType an @ref iterator or @ref const_iterator
+
+    @post Invalidates iterators and references at or after the point of the
+    erase, including the `end()` iterator.
+
+    @throw type_error.307 if called on a `null` value; example: `"cannot use
+    erase() with null"`
+    @throw invalid_iterator.203 if called on iterators which does not belong
+    to the current JSON value; example: `"iterators do not fit current value"`
+    @throw invalid_iterator.204 if called on a primitive type with invalid
+    iterators (i.e., if `first != begin()` and `last != end()`); example:
+    `"iterators out of range"`
+
+    @complexity The complexity depends on the type:
+    - objects: `log(size()) + std::distance(first, last)`
+    - arrays: linear in the distance between @a first and @a last, plus linear
+      in the distance between @a last and end of the container
+    - strings: linear in the length of the string
+    - other types: constant
+
+    @liveexample{The example shows the result of `erase()` for different JSON
+    types.,erase__IteratorType_IteratorType}
+
+    @sa @ref erase(IteratorType) -- removes the element at a given position
+    @sa @ref erase(const typename object_t::key_type&) -- removes the element
+    from an object at the given key
+    @sa @ref erase(const size_type) -- removes the element from an array at
+    the given index
+
+    @since version 1.0.0
+    */
+    template<class IteratorType, typename std::enable_if<
+                 std::is_same<IteratorType, typename basic_json_t::iterator>::value or
+                 std::is_same<IteratorType, typename basic_json_t::const_iterator>::value, int>::type
+             = 0>
+    IteratorType erase(IteratorType first, IteratorType last)
+    {
+        // make sure iterator fits the current value
+        if (JSON_UNLIKELY(this != first.m_object or this != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(203, "iterators do not fit current value"));
+        }
+
+        IteratorType result = end();
+
+        switch (m_type)
+        {
+            case value_t::boolean:
+            case value_t::number_float:
+            case value_t::number_integer:
+            case value_t::number_unsigned:
+            case value_t::string:
+            {
+                if (JSON_LIKELY(not first.m_it.primitive_iterator.is_begin()
+                                or not last.m_it.primitive_iterator.is_end()))
+                {
+                    JSON_THROW(invalid_iterator::create(204, "iterators out of range"));
+                }
+
+                if (is_string())
+                {
+                    AllocatorType<string_t> alloc;
+                    std::allocator_traits<decltype(alloc)>::destroy(alloc, m_value.string);
+                    std::allocator_traits<decltype(alloc)>::deallocate(alloc, m_value.string, 1);
+                    m_value.string = nullptr;
+                }
+
+                m_type = value_t::null;
+                assert_invariant();
+                break;
+            }
+
+            case value_t::object:
+            {
+                result.m_it.object_iterator = m_value.object->erase(first.m_it.object_iterator,
+                                              last.m_it.object_iterator);
+                break;
+            }
+
+            case value_t::array:
+            {
+                result.m_it.array_iterator = m_value.array->erase(first.m_it.array_iterator,
+                                             last.m_it.array_iterator);
+                break;
+            }
+
+            default:
+                JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name())));
+        }
+
+        return result;
+    }
+
+    /*!
+    @brief remove element from a JSON object given a key
+
+    Removes elements from a JSON object with the key value @a key.
+
+    @param[in] key value of the elements to remove
+
+    @return Number of elements removed. If @a ObjectType is the default
+    `std::map` type, the return value will always be `0` (@a key was not
+    found) or `1` (@a key was found).
+
+    @post References and iterators to the erased elements are invalidated.
+    Other references and iterators are not affected.
+
+    @throw type_error.307 when called on a type other than JSON object;
+    example: `"cannot use erase() with null"`
+
+    @complexity `log(size()) + count(key)`
+
+    @liveexample{The example shows the effect of `erase()`.,erase__key_type}
+
+    @sa @ref erase(IteratorType) -- removes the element at a given position
+    @sa @ref erase(IteratorType, IteratorType) -- removes the elements in
+    the given range
+    @sa @ref erase(const size_type) -- removes the element from an array at
+    the given index
+
+    @since version 1.0.0
+    */
+    size_type erase(const typename object_t::key_type& key)
+    {
+        // this erase only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            return m_value.object->erase(key);
+        }
+
+        JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief remove element from a JSON array given an index
+
+    Removes element from a JSON array at the index @a idx.
+
+    @param[in] idx index of the element to remove
+
+    @throw type_error.307 when called on a type other than JSON object;
+    example: `"cannot use erase() with null"`
+    @throw out_of_range.401 when `idx >= size()`; example: `"array index 17
+    is out of range"`
+
+    @complexity Linear in distance between @a idx and the end of the container.
+
+    @liveexample{The example shows the effect of `erase()`.,erase__size_type}
+
+    @sa @ref erase(IteratorType) -- removes the element at a given position
+    @sa @ref erase(IteratorType, IteratorType) -- removes the elements in
+    the given range
+    @sa @ref erase(const typename object_t::key_type&) -- removes the element
+    from an object at the given key
+
+    @since version 1.0.0
+    */
+    void erase(const size_type idx)
+    {
+        // this erase only works for arrays
+        if (JSON_LIKELY(is_array()))
+        {
+            if (JSON_UNLIKELY(idx >= size()))
+            {
+                JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range"));
+            }
+
+            m_value.array->erase(m_value.array->begin() + static_cast<difference_type>(idx));
+        }
+        else
+        {
+            JSON_THROW(type_error::create(307, "cannot use erase() with " + std::string(type_name())));
+        }
+    }
+
+    /// @}
+
+
+    ////////////
+    // lookup //
+    ////////////
+
+    /// @name lookup
+    /// @{
+
+    /*!
+    @brief find an element in a JSON object
+
+    Finds an element in a JSON object with key equivalent to @a key. If the
+    element is not found or the JSON value is not an object, end() is
+    returned.
+
+    @note This method always returns @ref end() when executed on a JSON type
+          that is not an object.
+
+    @param[in] key key value of the element to search for.
+
+    @return Iterator to an element with key equivalent to @a key. If no such
+    element is found or the JSON value is not an object, past-the-end (see
+    @ref end()) iterator is returned.
+
+    @complexity Logarithmic in the size of the JSON object.
+
+    @liveexample{The example shows how `find()` is used.,find__key_type}
+
+    @since version 1.0.0
+    */
+    template<typename KeyT>
+    iterator find(KeyT&& key)
+    {
+        auto result = end();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_value.object->find(std::forward<KeyT>(key));
+        }
+
+        return result;
+    }
+
+    /*!
+    @brief find an element in a JSON object
+    @copydoc find(KeyT&&)
+    */
+    template<typename KeyT>
+    const_iterator find(KeyT&& key) const
+    {
+        auto result = cend();
+
+        if (is_object())
+        {
+            result.m_it.object_iterator = m_value.object->find(std::forward<KeyT>(key));
+        }
+
+        return result;
+    }
+
+    /*!
+    @brief returns the number of occurrences of a key in a JSON object
+
+    Returns the number of elements with key @a key. If ObjectType is the
+    default `std::map` type, the return value will always be `0` (@a key was
+    not found) or `1` (@a key was found).
+
+    @note This method always returns `0` when executed on a JSON type that is
+          not an object.
+
+    @param[in] key key value of the element to count
+
+    @return Number of elements with key @a key. If the JSON value is not an
+    object, the return value will be `0`.
+
+    @complexity Logarithmic in the size of the JSON object.
+
+    @liveexample{The example shows how `count()` is used.,count}
+
+    @since version 1.0.0
+    */
+    template<typename KeyT>
+    size_type count(KeyT&& key) const
+    {
+        // return 0 for all nonobject types
+        return is_object() ? m_value.object->count(std::forward<KeyT>(key)) : 0;
+    }
+
+    /// @}
+
+
+    ///////////////
+    // iterators //
+    ///////////////
+
+    /// @name iterators
+    /// @{
+
+    /*!
+    @brief returns an iterator to the first element
+
+    Returns an iterator to the first element.
+
+    @image html range-begin-end.svg "Illustration from cppreference.com"
+
+    @return iterator to the first element
+
+    @complexity Constant.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is constant.
+
+    @liveexample{The following code shows an example for `begin()`.,begin}
+
+    @sa @ref cbegin() -- returns a const iterator to the beginning
+    @sa @ref end() -- returns an iterator to the end
+    @sa @ref cend() -- returns a const iterator to the end
+
+    @since version 1.0.0
+    */
+    iterator begin() noexcept
+    {
+        iterator result(this);
+        result.set_begin();
+        return result;
+    }
+
+    /*!
+    @copydoc basic_json::cbegin()
+    */
+    const_iterator begin() const noexcept
+    {
+        return cbegin();
+    }
+
+    /*!
+    @brief returns a const iterator to the first element
+
+    Returns a const iterator to the first element.
+
+    @image html range-begin-end.svg "Illustration from cppreference.com"
+
+    @return const iterator to the first element
+
+    @complexity Constant.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is constant.
+    - Has the semantics of `const_cast<const basic_json&>(*this).begin()`.
+
+    @liveexample{The following code shows an example for `cbegin()`.,cbegin}
+
+    @sa @ref begin() -- returns an iterator to the beginning
+    @sa @ref end() -- returns an iterator to the end
+    @sa @ref cend() -- returns a const iterator to the end
+
+    @since version 1.0.0
+    */
+    const_iterator cbegin() const noexcept
+    {
+        const_iterator result(this);
+        result.set_begin();
+        return result;
+    }
+
+    /*!
+    @brief returns an iterator to one past the last element
+
+    Returns an iterator to one past the last element.
+
+    @image html range-begin-end.svg "Illustration from cppreference.com"
+
+    @return iterator one past the last element
+
+    @complexity Constant.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is constant.
+
+    @liveexample{The following code shows an example for `end()`.,end}
+
+    @sa @ref cend() -- returns a const iterator to the end
+    @sa @ref begin() -- returns an iterator to the beginning
+    @sa @ref cbegin() -- returns a const iterator to the beginning
+
+    @since version 1.0.0
+    */
+    iterator end() noexcept
+    {
+        iterator result(this);
+        result.set_end();
+        return result;
+    }
+
+    /*!
+    @copydoc basic_json::cend()
+    */
+    const_iterator end() const noexcept
+    {
+        return cend();
+    }
+
+    /*!
+    @brief returns a const iterator to one past the last element
+
+    Returns a const iterator to one past the last element.
+
+    @image html range-begin-end.svg "Illustration from cppreference.com"
+
+    @return const iterator one past the last element
+
+    @complexity Constant.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is constant.
+    - Has the semantics of `const_cast<const basic_json&>(*this).end()`.
+
+    @liveexample{The following code shows an example for `cend()`.,cend}
+
+    @sa @ref end() -- returns an iterator to the end
+    @sa @ref begin() -- returns an iterator to the beginning
+    @sa @ref cbegin() -- returns a const iterator to the beginning
+
+    @since version 1.0.0
+    */
+    const_iterator cend() const noexcept
+    {
+        const_iterator result(this);
+        result.set_end();
+        return result;
+    }
+
+    /*!
+    @brief returns an iterator to the reverse-beginning
+
+    Returns an iterator to the reverse-beginning; that is, the last element.
+
+    @image html range-rbegin-rend.svg "Illustration from cppreference.com"
+
+    @complexity Constant.
+
+    @requirement This function helps `basic_json` satisfying the
+    [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer)
+    requirements:
+    - The complexity is constant.
+    - Has the semantics of `reverse_iterator(end())`.
+
+    @liveexample{The following code shows an example for `rbegin()`.,rbegin}
+
+    @sa @ref crbegin() -- returns a const reverse iterator to the beginning
+    @sa @ref rend() -- returns a reverse iterator to the end
+    @sa @ref crend() -- returns a const reverse iterator to the end
+
+    @since version 1.0.0
+    */
+    reverse_iterator rbegin() noexcept
+    {
+        return reverse_iterator(end());
+    }
+
+    /*!
+    @copydoc basic_json::crbegin()
+    */
+    const_reverse_iterator rbegin() const noexcept
+    {
+        return crbegin();
+    }
+
+    /*!
+    @brief returns an iterator to the reverse-end
+
+    Returns an iterator to the reverse-end; that is, one before the first
+    element.
+
+    @image html range-rbegin-rend.svg "Illustration from cppreference.com"
+
+    @complexity Constant.
+
+    @requirement This function helps `basic_json` satisfying the
+    [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer)
+    requirements:
+    - The complexity is constant.
+    - Has the semantics of `reverse_iterator(begin())`.
+
+    @liveexample{The following code shows an example for `rend()`.,rend}
+
+    @sa @ref crend() -- returns a const reverse iterator to the end
+    @sa @ref rbegin() -- returns a reverse iterator to the beginning
+    @sa @ref crbegin() -- returns a const reverse iterator to the beginning
+
+    @since version 1.0.0
+    */
+    reverse_iterator rend() noexcept
+    {
+        return reverse_iterator(begin());
+    }
+
+    /*!
+    @copydoc basic_json::crend()
+    */
+    const_reverse_iterator rend() const noexcept
+    {
+        return crend();
+    }
+
+    /*!
+    @brief returns a const reverse iterator to the last element
+
+    Returns a const iterator to the reverse-beginning; that is, the last
+    element.
+
+    @image html range-rbegin-rend.svg "Illustration from cppreference.com"
+
+    @complexity Constant.
+
+    @requirement This function helps `basic_json` satisfying the
+    [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer)
+    requirements:
+    - The complexity is constant.
+    - Has the semantics of `const_cast<const basic_json&>(*this).rbegin()`.
+
+    @liveexample{The following code shows an example for `crbegin()`.,crbegin}
+
+    @sa @ref rbegin() -- returns a reverse iterator to the beginning
+    @sa @ref rend() -- returns a reverse iterator to the end
+    @sa @ref crend() -- returns a const reverse iterator to the end
+
+    @since version 1.0.0
+    */
+    const_reverse_iterator crbegin() const noexcept
+    {
+        return const_reverse_iterator(cend());
+    }
+
+    /*!
+    @brief returns a const reverse iterator to one before the first
+
+    Returns a const reverse iterator to the reverse-end; that is, one before
+    the first element.
+
+    @image html range-rbegin-rend.svg "Illustration from cppreference.com"
+
+    @complexity Constant.
+
+    @requirement This function helps `basic_json` satisfying the
+    [ReversibleContainer](https://en.cppreference.com/w/cpp/named_req/ReversibleContainer)
+    requirements:
+    - The complexity is constant.
+    - Has the semantics of `const_cast<const basic_json&>(*this).rend()`.
+
+    @liveexample{The following code shows an example for `crend()`.,crend}
+
+    @sa @ref rend() -- returns a reverse iterator to the end
+    @sa @ref rbegin() -- returns a reverse iterator to the beginning
+    @sa @ref crbegin() -- returns a const reverse iterator to the beginning
+
+    @since version 1.0.0
+    */
+    const_reverse_iterator crend() const noexcept
+    {
+        return const_reverse_iterator(cbegin());
+    }
+
+  public:
+    /*!
+    @brief wrapper to access iterator member functions in range-based for
+
+    This function allows to access @ref iterator::key() and @ref
+    iterator::value() during range-based for loops. In these loops, a
+    reference to the JSON values is returned, so there is no access to the
+    underlying iterator.
+
+    For loop without iterator_wrapper:
+
+    @code{cpp}
+    for (auto it = j_object.begin(); it != j_object.end(); ++it)
+    {
+        std::cout << "key: " << it.key() << ", value:" << it.value() << '\n';
+    }
+    @endcode
+
+    Range-based for loop without iterator proxy:
+
+    @code{cpp}
+    for (auto it : j_object)
+    {
+        // "it" is of type json::reference and has no key() member
+        std::cout << "value: " << it << '\n';
+    }
+    @endcode
+
+    Range-based for loop with iterator proxy:
+
+    @code{cpp}
+    for (auto it : json::iterator_wrapper(j_object))
+    {
+        std::cout << "key: " << it.key() << ", value:" << it.value() << '\n';
+    }
+    @endcode
+
+    @note When iterating over an array, `key()` will return the index of the
+          element as string (see example).
+
+    @param[in] ref  reference to a JSON value
+    @return iteration proxy object wrapping @a ref with an interface to use in
+            range-based for loops
+
+    @liveexample{The following code shows how the wrapper is used,iterator_wrapper}
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes in the JSON value.
+
+    @complexity Constant.
+
+    @note The name of this function is not yet final and may change in the
+    future.
+
+    @deprecated This stream operator is deprecated and will be removed in
+                future 4.0.0 of the library. Please use @ref items() instead;
+                that is, replace `json::iterator_wrapper(j)` with `j.items()`.
+    */
+    JSON_DEPRECATED
+    static iteration_proxy<iterator> iterator_wrapper(reference ref) noexcept
+    {
+        return ref.items();
+    }
+
+    /*!
+    @copydoc iterator_wrapper(reference)
+    */
+    JSON_DEPRECATED
+    static iteration_proxy<const_iterator> iterator_wrapper(const_reference ref) noexcept
+    {
+        return ref.items();
+    }
+
+    /*!
+    @brief helper to access iterator member functions in range-based for
+
+    This function allows to access @ref iterator::key() and @ref
+    iterator::value() during range-based for loops. In these loops, a
+    reference to the JSON values is returned, so there is no access to the
+    underlying iterator.
+
+    For loop without `items()` function:
+
+    @code{cpp}
+    for (auto it = j_object.begin(); it != j_object.end(); ++it)
+    {
+        std::cout << "key: " << it.key() << ", value:" << it.value() << '\n';
+    }
+    @endcode
+
+    Range-based for loop without `items()` function:
+
+    @code{cpp}
+    for (auto it : j_object)
+    {
+        // "it" is of type json::reference and has no key() member
+        std::cout << "value: " << it << '\n';
+    }
+    @endcode
+
+    Range-based for loop with `items()` function:
+
+    @code{cpp}
+    for (auto it : j_object.items())
+    {
+        std::cout << "key: " << it.key() << ", value:" << it.value() << '\n';
+    }
+    @endcode
+
+    @note When iterating over an array, `key()` will return the index of the
+          element as string (see example). For primitive types (e.g., numbers),
+          `key()` returns an empty string.
+
+    @return iteration proxy object wrapping @a ref with an interface to use in
+            range-based for loops
+
+    @liveexample{The following code shows how the function is used.,items}
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes in the JSON value.
+
+    @complexity Constant.
+
+    @since version 3.1.0.
+    */
+    iteration_proxy<iterator> items() noexcept
+    {
+        return iteration_proxy<iterator>(*this);
+    }
+
+    /*!
+    @copydoc items()
+    */
+    iteration_proxy<const_iterator> items() const noexcept
+    {
+        return iteration_proxy<const_iterator>(*this);
+    }
+
+    /// @}
+
+
+    //////////////
+    // capacity //
+    //////////////
+
+    /// @name capacity
+    /// @{
+
+    /*!
+    @brief checks whether the container is empty.
+
+    Checks if a JSON value has no elements (i.e. whether its @ref size is `0`).
+
+    @return The return value depends on the different types and is
+            defined as follows:
+            Value type  | return value
+            ----------- | -------------
+            null        | `true`
+            boolean     | `false`
+            string      | `false`
+            number      | `false`
+            object      | result of function `object_t::empty()`
+            array       | result of function `array_t::empty()`
+
+    @liveexample{The following code uses `empty()` to check if a JSON
+    object contains any elements.,empty}
+
+    @complexity Constant, as long as @ref array_t and @ref object_t satisfy
+    the Container concept; that is, their `empty()` functions have constant
+    complexity.
+
+    @iterators No changes.
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @note This function does not return whether a string stored as JSON value
+    is empty - it returns whether the JSON container itself is empty which is
+    false in the case of a string.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is constant.
+    - Has the semantics of `begin() == end()`.
+
+    @sa @ref size() -- returns the number of elements
+
+    @since version 1.0.0
+    */
+    bool empty() const noexcept
+    {
+        switch (m_type)
+        {
+            case value_t::null:
+            {
+                // null values are empty
+                return true;
+            }
+
+            case value_t::array:
+            {
+                // delegate call to array_t::empty()
+                return m_value.array->empty();
+            }
+
+            case value_t::object:
+            {
+                // delegate call to object_t::empty()
+                return m_value.object->empty();
+            }
+
+            default:
+            {
+                // all other types are nonempty
+                return false;
+            }
+        }
+    }
+
+    /*!
+    @brief returns the number of elements
+
+    Returns the number of elements in a JSON value.
+
+    @return The return value depends on the different types and is
+            defined as follows:
+            Value type  | return value
+            ----------- | -------------
+            null        | `0`
+            boolean     | `1`
+            string      | `1`
+            number      | `1`
+            object      | result of function object_t::size()
+            array       | result of function array_t::size()
+
+    @liveexample{The following code calls `size()` on the different value
+    types.,size}
+
+    @complexity Constant, as long as @ref array_t and @ref object_t satisfy
+    the Container concept; that is, their size() functions have constant
+    complexity.
+
+    @iterators No changes.
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @note This function does not return the length of a string stored as JSON
+    value - it returns the number of elements in the JSON value which is 1 in
+    the case of a string.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is constant.
+    - Has the semantics of `std::distance(begin(), end())`.
+
+    @sa @ref empty() -- checks whether the container is empty
+    @sa @ref max_size() -- returns the maximal number of elements
+
+    @since version 1.0.0
+    */
+    size_type size() const noexcept
+    {
+        switch (m_type)
+        {
+            case value_t::null:
+            {
+                // null values are empty
+                return 0;
+            }
+
+            case value_t::array:
+            {
+                // delegate call to array_t::size()
+                return m_value.array->size();
+            }
+
+            case value_t::object:
+            {
+                // delegate call to object_t::size()
+                return m_value.object->size();
+            }
+
+            default:
+            {
+                // all other types have size 1
+                return 1;
+            }
+        }
+    }
+
+    /*!
+    @brief returns the maximum possible number of elements
+
+    Returns the maximum number of elements a JSON value is able to hold due to
+    system or library implementation limitations, i.e. `std::distance(begin(),
+    end())` for the JSON value.
+
+    @return The return value depends on the different types and is
+            defined as follows:
+            Value type  | return value
+            ----------- | -------------
+            null        | `0` (same as `size()`)
+            boolean     | `1` (same as `size()`)
+            string      | `1` (same as `size()`)
+            number      | `1` (same as `size()`)
+            object      | result of function `object_t::max_size()`
+            array       | result of function `array_t::max_size()`
+
+    @liveexample{The following code calls `max_size()` on the different value
+    types. Note the output is implementation specific.,max_size}
+
+    @complexity Constant, as long as @ref array_t and @ref object_t satisfy
+    the Container concept; that is, their `max_size()` functions have constant
+    complexity.
+
+    @iterators No changes.
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @requirement This function helps `basic_json` satisfying the
+    [Container](https://en.cppreference.com/w/cpp/named_req/Container)
+    requirements:
+    - The complexity is constant.
+    - Has the semantics of returning `b.size()` where `b` is the largest
+      possible JSON value.
+
+    @sa @ref size() -- returns the number of elements
+
+    @since version 1.0.0
+    */
+    size_type max_size() const noexcept
+    {
+        switch (m_type)
+        {
+            case value_t::array:
+            {
+                // delegate call to array_t::max_size()
+                return m_value.array->max_size();
+            }
+
+            case value_t::object:
+            {
+                // delegate call to object_t::max_size()
+                return m_value.object->max_size();
+            }
+
+            default:
+            {
+                // all other types have max_size() == size()
+                return size();
+            }
+        }
+    }
+
+    /// @}
+
+
+    ///////////////
+    // modifiers //
+    ///////////////
+
+    /// @name modifiers
+    /// @{
+
+    /*!
+    @brief clears the contents
+
+    Clears the content of a JSON value and resets it to the default value as
+    if @ref basic_json(value_t) would have been called with the current value
+    type from @ref type():
+
+    Value type  | initial value
+    ----------- | -------------
+    null        | `null`
+    boolean     | `false`
+    string      | `""`
+    number      | `0`
+    object      | `{}`
+    array       | `[]`
+
+    @post Has the same effect as calling
+    @code {.cpp}
+    *this = basic_json(type());
+    @endcode
+
+    @liveexample{The example below shows the effect of `clear()` to different
+    JSON types.,clear}
+
+    @complexity Linear in the size of the JSON value.
+
+    @iterators All iterators, pointers and references related to this container
+               are invalidated.
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @sa @ref basic_json(value_t) -- constructor that creates an object with the
+        same value than calling `clear()`
+
+    @since version 1.0.0
+    */
+    void clear() noexcept
+    {
+        switch (m_type)
+        {
+            case value_t::number_integer:
+            {
+                m_value.number_integer = 0;
+                break;
+            }
+
+            case value_t::number_unsigned:
+            {
+                m_value.number_unsigned = 0;
+                break;
+            }
+
+            case value_t::number_float:
+            {
+                m_value.number_float = 0.0;
+                break;
+            }
+
+            case value_t::boolean:
+            {
+                m_value.boolean = false;
+                break;
+            }
+
+            case value_t::string:
+            {
+                m_value.string->clear();
+                break;
+            }
+
+            case value_t::array:
+            {
+                m_value.array->clear();
+                break;
+            }
+
+            case value_t::object:
+            {
+                m_value.object->clear();
+                break;
+            }
+
+            default:
+                break;
+        }
+    }
+
+    /*!
+    @brief add an object to an array
+
+    Appends the given element @a val to the end of the JSON value. If the
+    function is called on a JSON null value, an empty array is created before
+    appending @a val.
+
+    @param[in] val the value to add to the JSON array
+
+    @throw type_error.308 when called on a type other than JSON array or
+    null; example: `"cannot use push_back() with number"`
+
+    @complexity Amortized constant.
+
+    @liveexample{The example shows how `push_back()` and `+=` can be used to
+    add elements to a JSON array. Note how the `null` value was silently
+    converted to a JSON array.,push_back}
+
+    @since version 1.0.0
+    */
+    void push_back(basic_json&& val)
+    {
+        // push_back only works for null objects or arrays
+        if (JSON_UNLIKELY(not(is_null() or is_array())))
+        {
+            JSON_THROW(type_error::create(308, "cannot use push_back() with " + std::string(type_name())));
+        }
+
+        // transform null object into an array
+        if (is_null())
+        {
+            m_type = value_t::array;
+            m_value = value_t::array;
+            assert_invariant();
+        }
+
+        // add element to array (move semantics)
+        m_value.array->push_back(std::move(val));
+        // invalidate object
+        val.m_type = value_t::null;
+    }
+
+    /*!
+    @brief add an object to an array
+    @copydoc push_back(basic_json&&)
+    */
+    reference operator+=(basic_json&& val)
+    {
+        push_back(std::move(val));
+        return *this;
+    }
+
+    /*!
+    @brief add an object to an array
+    @copydoc push_back(basic_json&&)
+    */
+    void push_back(const basic_json& val)
+    {
+        // push_back only works for null objects or arrays
+        if (JSON_UNLIKELY(not(is_null() or is_array())))
+        {
+            JSON_THROW(type_error::create(308, "cannot use push_back() with " + std::string(type_name())));
+        }
+
+        // transform null object into an array
+        if (is_null())
+        {
+            m_type = value_t::array;
+            m_value = value_t::array;
+            assert_invariant();
+        }
+
+        // add element to array
+        m_value.array->push_back(val);
+    }
+
+    /*!
+    @brief add an object to an array
+    @copydoc push_back(basic_json&&)
+    */
+    reference operator+=(const basic_json& val)
+    {
+        push_back(val);
+        return *this;
+    }
+
+    /*!
+    @brief add an object to an object
+
+    Inserts the given element @a val to the JSON object. If the function is
+    called on a JSON null value, an empty object is created before inserting
+    @a val.
+
+    @param[in] val the value to add to the JSON object
+
+    @throw type_error.308 when called on a type other than JSON object or
+    null; example: `"cannot use push_back() with number"`
+
+    @complexity Logarithmic in the size of the container, O(log(`size()`)).
+
+    @liveexample{The example shows how `push_back()` and `+=` can be used to
+    add elements to a JSON object. Note how the `null` value was silently
+    converted to a JSON object.,push_back__object_t__value}
+
+    @since version 1.0.0
+    */
+    void push_back(const typename object_t::value_type& val)
+    {
+        // push_back only works for null objects or objects
+        if (JSON_UNLIKELY(not(is_null() or is_object())))
+        {
+            JSON_THROW(type_error::create(308, "cannot use push_back() with " + std::string(type_name())));
+        }
+
+        // transform null object into an object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value = value_t::object;
+            assert_invariant();
+        }
+
+        // add element to array
+        m_value.object->insert(val);
+    }
+
+    /*!
+    @brief add an object to an object
+    @copydoc push_back(const typename object_t::value_type&)
+    */
+    reference operator+=(const typename object_t::value_type& val)
+    {
+        push_back(val);
+        return *this;
+    }
+
+    /*!
+    @brief add an object to an object
+
+    This function allows to use `push_back` with an initializer list. In case
+
+    1. the current value is an object,
+    2. the initializer list @a init contains only two elements, and
+    3. the first element of @a init is a string,
+
+    @a init is converted into an object element and added using
+    @ref push_back(const typename object_t::value_type&). Otherwise, @a init
+    is converted to a JSON value and added using @ref push_back(basic_json&&).
+
+    @param[in] init  an initializer list
+
+    @complexity Linear in the size of the initializer list @a init.
+
+    @note This function is required to resolve an ambiguous overload error,
+          because pairs like `{"key", "value"}` can be both interpreted as
+          `object_t::value_type` or `std::initializer_list<basic_json>`, see
+          https://github.com/nlohmann/json/issues/235 for more information.
+
+    @liveexample{The example shows how initializer lists are treated as
+    objects when possible.,push_back__initializer_list}
+    */
+    void push_back(initializer_list_t init)
+    {
+        if (is_object() and init.size() == 2 and (*init.begin())->is_string())
+        {
+            basic_json&& key = init.begin()->moved_or_copied();
+            push_back(typename object_t::value_type(
+                          std::move(key.get_ref<string_t&>()), (init.begin() + 1)->moved_or_copied()));
+        }
+        else
+        {
+            push_back(basic_json(init));
+        }
+    }
+
+    /*!
+    @brief add an object to an object
+    @copydoc push_back(initializer_list_t)
+    */
+    reference operator+=(initializer_list_t init)
+    {
+        push_back(init);
+        return *this;
+    }
+
+    /*!
+    @brief add an object to an array
+
+    Creates a JSON value from the passed parameters @a args to the end of the
+    JSON value. If the function is called on a JSON null value, an empty array
+    is created before appending the value created from @a args.
+
+    @param[in] args arguments to forward to a constructor of @ref basic_json
+    @tparam Args compatible types to create a @ref basic_json object
+
+    @throw type_error.311 when called on a type other than JSON array or
+    null; example: `"cannot use emplace_back() with number"`
+
+    @complexity Amortized constant.
+
+    @liveexample{The example shows how `push_back()` can be used to add
+    elements to a JSON array. Note how the `null` value was silently converted
+    to a JSON array.,emplace_back}
+
+    @since version 2.0.8
+    */
+    template<class... Args>
+    void emplace_back(Args&& ... args)
+    {
+        // emplace_back only works for null objects or arrays
+        if (JSON_UNLIKELY(not(is_null() or is_array())))
+        {
+            JSON_THROW(type_error::create(311, "cannot use emplace_back() with " + std::string(type_name())));
+        }
+
+        // transform null object into an array
+        if (is_null())
+        {
+            m_type = value_t::array;
+            m_value = value_t::array;
+            assert_invariant();
+        }
+
+        // add element to array (perfect forwarding)
+        m_value.array->emplace_back(std::forward<Args>(args)...);
+    }
+
+    /*!
+    @brief add an object to an object if key does not exist
+
+    Inserts a new element into a JSON object constructed in-place with the
+    given @a args if there is no element with the key in the container. If the
+    function is called on a JSON null value, an empty object is created before
+    appending the value created from @a args.
+
+    @param[in] args arguments to forward to a constructor of @ref basic_json
+    @tparam Args compatible types to create a @ref basic_json object
+
+    @return a pair consisting of an iterator to the inserted element, or the
+            already-existing element if no insertion happened, and a bool
+            denoting whether the insertion took place.
+
+    @throw type_error.311 when called on a type other than JSON object or
+    null; example: `"cannot use emplace() with number"`
+
+    @complexity Logarithmic in the size of the container, O(log(`size()`)).
+
+    @liveexample{The example shows how `emplace()` can be used to add elements
+    to a JSON object. Note how the `null` value was silently converted to a
+    JSON object. Further note how no value is added if there was already one
+    value stored with the same key.,emplace}
+
+    @since version 2.0.8
+    */
+    template<class... Args>
+    std::pair<iterator, bool> emplace(Args&& ... args)
+    {
+        // emplace only works for null objects or arrays
+        if (JSON_UNLIKELY(not(is_null() or is_object())))
+        {
+            JSON_THROW(type_error::create(311, "cannot use emplace() with " + std::string(type_name())));
+        }
+
+        // transform null object into an object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value = value_t::object;
+            assert_invariant();
+        }
+
+        // add element to array (perfect forwarding)
+        auto res = m_value.object->emplace(std::forward<Args>(args)...);
+        // create result iterator and set iterator to the result of emplace
+        auto it = begin();
+        it.m_it.object_iterator = res.first;
+
+        // return pair of iterator and boolean
+        return {it, res.second};
+    }
+
+    /*!
+    @brief inserts element
+
+    Inserts element @a val before iterator @a pos.
+
+    @param[in] pos iterator before which the content will be inserted; may be
+    the end() iterator
+    @param[in] val element to insert
+    @return iterator pointing to the inserted @a val.
+
+    @throw type_error.309 if called on JSON values other than arrays;
+    example: `"cannot use insert() with string"`
+    @throw invalid_iterator.202 if @a pos is not an iterator of *this;
+    example: `"iterator does not fit current value"`
+
+    @complexity Constant plus linear in the distance between @a pos and end of
+    the container.
+
+    @liveexample{The example shows how `insert()` is used.,insert}
+
+    @since version 1.0.0
+    */
+    iterator insert(const_iterator pos, const basic_json& val)
+    {
+        // insert only works for arrays
+        if (JSON_LIKELY(is_array()))
+        {
+            // check if iterator pos fits to this JSON value
+            if (JSON_UNLIKELY(pos.m_object != this))
+            {
+                JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value"));
+            }
+
+            // insert to array and return iterator
+            iterator result(this);
+            result.m_it.array_iterator = m_value.array->insert(pos.m_it.array_iterator, val);
+            return result;
+        }
+
+        JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief inserts element
+    @copydoc insert(const_iterator, const basic_json&)
+    */
+    iterator insert(const_iterator pos, basic_json&& val)
+    {
+        return insert(pos, val);
+    }
+
+    /*!
+    @brief inserts elements
+
+    Inserts @a cnt copies of @a val before iterator @a pos.
+
+    @param[in] pos iterator before which the content will be inserted; may be
+    the end() iterator
+    @param[in] cnt number of copies of @a val to insert
+    @param[in] val element to insert
+    @return iterator pointing to the first element inserted, or @a pos if
+    `cnt==0`
+
+    @throw type_error.309 if called on JSON values other than arrays; example:
+    `"cannot use insert() with string"`
+    @throw invalid_iterator.202 if @a pos is not an iterator of *this;
+    example: `"iterator does not fit current value"`
+
+    @complexity Linear in @a cnt plus linear in the distance between @a pos
+    and end of the container.
+
+    @liveexample{The example shows how `insert()` is used.,insert__count}
+
+    @since version 1.0.0
+    */
+    iterator insert(const_iterator pos, size_type cnt, const basic_json& val)
+    {
+        // insert only works for arrays
+        if (JSON_LIKELY(is_array()))
+        {
+            // check if iterator pos fits to this JSON value
+            if (JSON_UNLIKELY(pos.m_object != this))
+            {
+                JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value"));
+            }
+
+            // insert to array and return iterator
+            iterator result(this);
+            result.m_it.array_iterator = m_value.array->insert(pos.m_it.array_iterator, cnt, val);
+            return result;
+        }
+
+        JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name())));
+    }
+
+    /*!
+    @brief inserts elements
+
+    Inserts elements from range `[first, last)` before iterator @a pos.
+
+    @param[in] pos iterator before which the content will be inserted; may be
+    the end() iterator
+    @param[in] first begin of the range of elements to insert
+    @param[in] last end of the range of elements to insert
+
+    @throw type_error.309 if called on JSON values other than arrays; example:
+    `"cannot use insert() with string"`
+    @throw invalid_iterator.202 if @a pos is not an iterator of *this;
+    example: `"iterator does not fit current value"`
+    @throw invalid_iterator.210 if @a first and @a last do not belong to the
+    same JSON value; example: `"iterators do not fit"`
+    @throw invalid_iterator.211 if @a first or @a last are iterators into
+    container for which insert is called; example: `"passed iterators may not
+    belong to container"`
+
+    @return iterator pointing to the first element inserted, or @a pos if
+    `first==last`
+
+    @complexity Linear in `std::distance(first, last)` plus linear in the
+    distance between @a pos and end of the container.
+
+    @liveexample{The example shows how `insert()` is used.,insert__range}
+
+    @since version 1.0.0
+    */
+    iterator insert(const_iterator pos, const_iterator first, const_iterator last)
+    {
+        // insert only works for arrays
+        if (JSON_UNLIKELY(not is_array()))
+        {
+            JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name())));
+        }
+
+        // check if iterator pos fits to this JSON value
+        if (JSON_UNLIKELY(pos.m_object != this))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value"));
+        }
+
+        // check if range iterators belong to the same JSON object
+        if (JSON_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(210, "iterators do not fit"));
+        }
+
+        if (JSON_UNLIKELY(first.m_object == this))
+        {
+            JSON_THROW(invalid_iterator::create(211, "passed iterators may not belong to container"));
+        }
+
+        // insert to array and return iterator
+        iterator result(this);
+        result.m_it.array_iterator = m_value.array->insert(
+                                         pos.m_it.array_iterator,
+                                         first.m_it.array_iterator,
+                                         last.m_it.array_iterator);
+        return result;
+    }
+
+    /*!
+    @brief inserts elements
+
+    Inserts elements from initializer list @a ilist before iterator @a pos.
+
+    @param[in] pos iterator before which the content will be inserted; may be
+    the end() iterator
+    @param[in] ilist initializer list to insert the values from
+
+    @throw type_error.309 if called on JSON values other than arrays; example:
+    `"cannot use insert() with string"`
+    @throw invalid_iterator.202 if @a pos is not an iterator of *this;
+    example: `"iterator does not fit current value"`
+
+    @return iterator pointing to the first element inserted, or @a pos if
+    `ilist` is empty
+
+    @complexity Linear in `ilist.size()` plus linear in the distance between
+    @a pos and end of the container.
+
+    @liveexample{The example shows how `insert()` is used.,insert__ilist}
+
+    @since version 1.0.0
+    */
+    iterator insert(const_iterator pos, initializer_list_t ilist)
+    {
+        // insert only works for arrays
+        if (JSON_UNLIKELY(not is_array()))
+        {
+            JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name())));
+        }
+
+        // check if iterator pos fits to this JSON value
+        if (JSON_UNLIKELY(pos.m_object != this))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterator does not fit current value"));
+        }
+
+        // insert to array and return iterator
+        iterator result(this);
+        result.m_it.array_iterator = m_value.array->insert(pos.m_it.array_iterator, ilist.begin(), ilist.end());
+        return result;
+    }
+
+    /*!
+    @brief inserts elements
+
+    Inserts elements from range `[first, last)`.
+
+    @param[in] first begin of the range of elements to insert
+    @param[in] last end of the range of elements to insert
+
+    @throw type_error.309 if called on JSON values other than objects; example:
+    `"cannot use insert() with string"`
+    @throw invalid_iterator.202 if iterator @a first or @a last does does not
+    point to an object; example: `"iterators first and last must point to
+    objects"`
+    @throw invalid_iterator.210 if @a first and @a last do not belong to the
+    same JSON value; example: `"iterators do not fit"`
+
+    @complexity Logarithmic: `O(N*log(size() + N))`, where `N` is the number
+    of elements to insert.
+
+    @liveexample{The example shows how `insert()` is used.,insert__range_object}
+
+    @since version 3.0.0
+    */
+    void insert(const_iterator first, const_iterator last)
+    {
+        // insert only works for objects
+        if (JSON_UNLIKELY(not is_object()))
+        {
+            JSON_THROW(type_error::create(309, "cannot use insert() with " + std::string(type_name())));
+        }
+
+        // check if range iterators belong to the same JSON object
+        if (JSON_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(210, "iterators do not fit"));
+        }
+
+        // passed iterators must belong to objects
+        if (JSON_UNLIKELY(not first.m_object->is_object()))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterators first and last must point to objects"));
+        }
+
+        m_value.object->insert(first.m_it.object_iterator, last.m_it.object_iterator);
+    }
+
+    /*!
+    @brief updates a JSON object from another object, overwriting existing keys
+
+    Inserts all values from JSON object @a j and overwrites existing keys.
+
+    @param[in] j  JSON object to read values from
+
+    @throw type_error.312 if called on JSON values other than objects; example:
+    `"cannot use update() with string"`
+
+    @complexity O(N*log(size() + N)), where N is the number of elements to
+                insert.
+
+    @liveexample{The example shows how `update()` is used.,update}
+
+    @sa https://docs.python.org/3.6/library/stdtypes.html#dict.update
+
+    @since version 3.0.0
+    */
+    void update(const_reference j)
+    {
+        // implicitly convert null value to an empty object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value.object = create<object_t>();
+            assert_invariant();
+        }
+
+        if (JSON_UNLIKELY(not is_object()))
+        {
+            JSON_THROW(type_error::create(312, "cannot use update() with " + std::string(type_name())));
+        }
+        if (JSON_UNLIKELY(not j.is_object()))
+        {
+            JSON_THROW(type_error::create(312, "cannot use update() with " + std::string(j.type_name())));
+        }
+
+        for (auto it = j.cbegin(); it != j.cend(); ++it)
+        {
+            m_value.object->operator[](it.key()) = it.value();
+        }
+    }
+
+    /*!
+    @brief updates a JSON object from another object, overwriting existing keys
+
+    Inserts all values from from range `[first, last)` and overwrites existing
+    keys.
+
+    @param[in] first begin of the range of elements to insert
+    @param[in] last end of the range of elements to insert
+
+    @throw type_error.312 if called on JSON values other than objects; example:
+    `"cannot use update() with string"`
+    @throw invalid_iterator.202 if iterator @a first or @a last does does not
+    point to an object; example: `"iterators first and last must point to
+    objects"`
+    @throw invalid_iterator.210 if @a first and @a last do not belong to the
+    same JSON value; example: `"iterators do not fit"`
+
+    @complexity O(N*log(size() + N)), where N is the number of elements to
+                insert.
+
+    @liveexample{The example shows how `update()` is used__range.,update}
+
+    @sa https://docs.python.org/3.6/library/stdtypes.html#dict.update
+
+    @since version 3.0.0
+    */
+    void update(const_iterator first, const_iterator last)
+    {
+        // implicitly convert null value to an empty object
+        if (is_null())
+        {
+            m_type = value_t::object;
+            m_value.object = create<object_t>();
+            assert_invariant();
+        }
+
+        if (JSON_UNLIKELY(not is_object()))
+        {
+            JSON_THROW(type_error::create(312, "cannot use update() with " + std::string(type_name())));
+        }
+
+        // check if range iterators belong to the same JSON object
+        if (JSON_UNLIKELY(first.m_object != last.m_object))
+        {
+            JSON_THROW(invalid_iterator::create(210, "iterators do not fit"));
+        }
+
+        // passed iterators must belong to objects
+        if (JSON_UNLIKELY(not first.m_object->is_object()
+                          or not last.m_object->is_object()))
+        {
+            JSON_THROW(invalid_iterator::create(202, "iterators first and last must point to objects"));
+        }
+
+        for (auto it = first; it != last; ++it)
+        {
+            m_value.object->operator[](it.key()) = it.value();
+        }
+    }
+
+    /*!
+    @brief exchanges the values
+
+    Exchanges the contents of the JSON value with those of @a other. Does not
+    invoke any move, copy, or swap operations on individual elements. All
+    iterators and references remain valid. The past-the-end iterator is
+    invalidated.
+
+    @param[in,out] other JSON value to exchange the contents with
+
+    @complexity Constant.
+
+    @liveexample{The example below shows how JSON values can be swapped with
+    `swap()`.,swap__reference}
+
+    @since version 1.0.0
+    */
+    void swap(reference other) noexcept (
+        std::is_nothrow_move_constructible<value_t>::value and
+        std::is_nothrow_move_assignable<value_t>::value and
+        std::is_nothrow_move_constructible<json_value>::value and
+        std::is_nothrow_move_assignable<json_value>::value
+    )
+    {
+        std::swap(m_type, other.m_type);
+        std::swap(m_value, other.m_value);
+        assert_invariant();
+    }
+
+    /*!
+    @brief exchanges the values
+
+    Exchanges the contents of a JSON array with those of @a other. Does not
+    invoke any move, copy, or swap operations on individual elements. All
+    iterators and references remain valid. The past-the-end iterator is
+    invalidated.
+
+    @param[in,out] other array to exchange the contents with
+
+    @throw type_error.310 when JSON value is not an array; example: `"cannot
+    use swap() with string"`
+
+    @complexity Constant.
+
+    @liveexample{The example below shows how arrays can be swapped with
+    `swap()`.,swap__array_t}
+
+    @since version 1.0.0
+    */
+    void swap(array_t& other)
+    {
+        // swap only works for arrays
+        if (JSON_LIKELY(is_array()))
+        {
+            std::swap(*(m_value.array), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name())));
+        }
+    }
+
+    /*!
+    @brief exchanges the values
+
+    Exchanges the contents of a JSON object with those of @a other. Does not
+    invoke any move, copy, or swap operations on individual elements. All
+    iterators and references remain valid. The past-the-end iterator is
+    invalidated.
+
+    @param[in,out] other object to exchange the contents with
+
+    @throw type_error.310 when JSON value is not an object; example:
+    `"cannot use swap() with string"`
+
+    @complexity Constant.
+
+    @liveexample{The example below shows how objects can be swapped with
+    `swap()`.,swap__object_t}
+
+    @since version 1.0.0
+    */
+    void swap(object_t& other)
+    {
+        // swap only works for objects
+        if (JSON_LIKELY(is_object()))
+        {
+            std::swap(*(m_value.object), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name())));
+        }
+    }
+
+    /*!
+    @brief exchanges the values
+
+    Exchanges the contents of a JSON string with those of @a other. Does not
+    invoke any move, copy, or swap operations on individual elements. All
+    iterators and references remain valid. The past-the-end iterator is
+    invalidated.
+
+    @param[in,out] other string to exchange the contents with
+
+    @throw type_error.310 when JSON value is not a string; example: `"cannot
+    use swap() with boolean"`
+
+    @complexity Constant.
+
+    @liveexample{The example below shows how strings can be swapped with
+    `swap()`.,swap__string_t}
+
+    @since version 1.0.0
+    */
+    void swap(string_t& other)
+    {
+        // swap only works for strings
+        if (JSON_LIKELY(is_string()))
+        {
+            std::swap(*(m_value.string), other);
+        }
+        else
+        {
+            JSON_THROW(type_error::create(310, "cannot use swap() with " + std::string(type_name())));
+        }
+    }
+
+    /// @}
+
+  public:
+    //////////////////////////////////////////
+    // lexicographical comparison operators //
+    //////////////////////////////////////////
+
+    /// @name lexicographical comparison operators
+    /// @{
+
+    /*!
+    @brief comparison: equal
+
+    Compares two JSON values for equality according to the following rules:
+    - Two JSON values are equal if (1) they are from the same type and (2)
+      their stored values are the same according to their respective
+      `operator==`.
+    - Integer and floating-point numbers are automatically converted before
+      comparison. Note than two NaN values are always treated as unequal.
+    - Two JSON null values are equal.
+
+    @note Floating-point inside JSON values numbers are compared with
+    `json::number_float_t::operator==` which is `double::operator==` by
+    default. To compare floating-point while respecting an epsilon, an alternative
+    [comparison function](https://github.com/mariokonrad/marnav/blob/master/src/marnav/math/floatingpoint.hpp#L34-#L39)
+    could be used, for instance
+    @code {.cpp}
+    template<typename T, typename = typename std::enable_if<std::is_floating_point<T>::value, T>::type>
+    inline bool is_same(T a, T b, T epsilon = std::numeric_limits<T>::epsilon()) noexcept
+    {
+        return std::abs(a - b) <= epsilon;
+    }
+    @endcode
+
+    @note NaN values never compare equal to themselves or to other NaN values.
+
+    @param[in] lhs  first JSON value to consider
+    @param[in] rhs  second JSON value to consider
+    @return whether the values @a lhs and @a rhs are equal
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @complexity Linear.
+
+    @liveexample{The example demonstrates comparing several JSON
+    types.,operator__equal}
+
+    @since version 1.0.0
+    */
+    friend bool operator==(const_reference lhs, const_reference rhs) noexcept
+    {
+        const auto lhs_type = lhs.type();
+        const auto rhs_type = rhs.type();
+
+        if (lhs_type == rhs_type)
+        {
+            switch (lhs_type)
+            {
+                case value_t::array:
+                    return (*lhs.m_value.array == *rhs.m_value.array);
+
+                case value_t::object:
+                    return (*lhs.m_value.object == *rhs.m_value.object);
+
+                case value_t::null:
+                    return true;
+
+                case value_t::string:
+                    return (*lhs.m_value.string == *rhs.m_value.string);
+
+                case value_t::boolean:
+                    return (lhs.m_value.boolean == rhs.m_value.boolean);
+
+                case value_t::number_integer:
+                    return (lhs.m_value.number_integer == rhs.m_value.number_integer);
+
+                case value_t::number_unsigned:
+                    return (lhs.m_value.number_unsigned == rhs.m_value.number_unsigned);
+
+                case value_t::number_float:
+                    return (lhs.m_value.number_float == rhs.m_value.number_float);
+
+                default:
+                    return false;
+            }
+        }
+        else if (lhs_type == value_t::number_integer and rhs_type == value_t::number_float)
+        {
+            return (static_cast<number_float_t>(lhs.m_value.number_integer) == rhs.m_value.number_float);
+        }
+        else if (lhs_type == value_t::number_float and rhs_type == value_t::number_integer)
+        {
+            return (lhs.m_value.number_float == static_cast<number_float_t>(rhs.m_value.number_integer));
+        }
+        else if (lhs_type == value_t::number_unsigned and rhs_type == value_t::number_float)
+        {
+            return (static_cast<number_float_t>(lhs.m_value.number_unsigned) == rhs.m_value.number_float);
+        }
+        else if (lhs_type == value_t::number_float and rhs_type == value_t::number_unsigned)
+        {
+            return (lhs.m_value.number_float == static_cast<number_float_t>(rhs.m_value.number_unsigned));
+        }
+        else if (lhs_type == value_t::number_unsigned and rhs_type == value_t::number_integer)
+        {
+            return (static_cast<number_integer_t>(lhs.m_value.number_unsigned) == rhs.m_value.number_integer);
+        }
+        else if (lhs_type == value_t::number_integer and rhs_type == value_t::number_unsigned)
+        {
+            return (lhs.m_value.number_integer == static_cast<number_integer_t>(rhs.m_value.number_unsigned));
+        }
+
+        return false;
+    }
+
+    /*!
+    @brief comparison: equal
+    @copydoc operator==(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator==(const_reference lhs, const ScalarType rhs) noexcept
+    {
+        return (lhs == basic_json(rhs));
+    }
+
+    /*!
+    @brief comparison: equal
+    @copydoc operator==(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator==(const ScalarType lhs, const_reference rhs) noexcept
+    {
+        return (basic_json(lhs) == rhs);
+    }
+
+    /*!
+    @brief comparison: not equal
+
+    Compares two JSON values for inequality by calculating `not (lhs == rhs)`.
+
+    @param[in] lhs  first JSON value to consider
+    @param[in] rhs  second JSON value to consider
+    @return whether the values @a lhs and @a rhs are not equal
+
+    @complexity Linear.
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @liveexample{The example demonstrates comparing several JSON
+    types.,operator__notequal}
+
+    @since version 1.0.0
+    */
+    friend bool operator!=(const_reference lhs, const_reference rhs) noexcept
+    {
+        return not (lhs == rhs);
+    }
+
+    /*!
+    @brief comparison: not equal
+    @copydoc operator!=(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator!=(const_reference lhs, const ScalarType rhs) noexcept
+    {
+        return (lhs != basic_json(rhs));
+    }
+
+    /*!
+    @brief comparison: not equal
+    @copydoc operator!=(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator!=(const ScalarType lhs, const_reference rhs) noexcept
+    {
+        return (basic_json(lhs) != rhs);
+    }
+
+    /*!
+    @brief comparison: less than
+
+    Compares whether one JSON value @a lhs is less than another JSON value @a
+    rhs according to the following rules:
+    - If @a lhs and @a rhs have the same type, the values are compared using
+      the default `<` operator.
+    - Integer and floating-point numbers are automatically converted before
+      comparison
+    - In case @a lhs and @a rhs have different types, the values are ignored
+      and the order of the types is considered, see
+      @ref operator<(const value_t, const value_t).
+
+    @param[in] lhs  first JSON value to consider
+    @param[in] rhs  second JSON value to consider
+    @return whether @a lhs is less than @a rhs
+
+    @complexity Linear.
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @liveexample{The example demonstrates comparing several JSON
+    types.,operator__less}
+
+    @since version 1.0.0
+    */
+    friend bool operator<(const_reference lhs, const_reference rhs) noexcept
+    {
+        const auto lhs_type = lhs.type();
+        const auto rhs_type = rhs.type();
+
+        if (lhs_type == rhs_type)
+        {
+            switch (lhs_type)
+            {
+                case value_t::array:
+                    return (*lhs.m_value.array) < (*rhs.m_value.array);
+
+                case value_t::object:
+                    return *lhs.m_value.object < *rhs.m_value.object;
+
+                case value_t::null:
+                    return false;
+
+                case value_t::string:
+                    return *lhs.m_value.string < *rhs.m_value.string;
+
+                case value_t::boolean:
+                    return lhs.m_value.boolean < rhs.m_value.boolean;
+
+                case value_t::number_integer:
+                    return lhs.m_value.number_integer < rhs.m_value.number_integer;
+
+                case value_t::number_unsigned:
+                    return lhs.m_value.number_unsigned < rhs.m_value.number_unsigned;
+
+                case value_t::number_float:
+                    return lhs.m_value.number_float < rhs.m_value.number_float;
+
+                default:
+                    return false;
+            }
+        }
+        else if (lhs_type == value_t::number_integer and rhs_type == value_t::number_float)
+        {
+            return static_cast<number_float_t>(lhs.m_value.number_integer) < rhs.m_value.number_float;
+        }
+        else if (lhs_type == value_t::number_float and rhs_type == value_t::number_integer)
+        {
+            return lhs.m_value.number_float < static_cast<number_float_t>(rhs.m_value.number_integer);
+        }
+        else if (lhs_type == value_t::number_unsigned and rhs_type == value_t::number_float)
+        {
+            return static_cast<number_float_t>(lhs.m_value.number_unsigned) < rhs.m_value.number_float;
+        }
+        else if (lhs_type == value_t::number_float and rhs_type == value_t::number_unsigned)
+        {
+            return lhs.m_value.number_float < static_cast<number_float_t>(rhs.m_value.number_unsigned);
+        }
+        else if (lhs_type == value_t::number_integer and rhs_type == value_t::number_unsigned)
+        {
+            return lhs.m_value.number_integer < static_cast<number_integer_t>(rhs.m_value.number_unsigned);
+        }
+        else if (lhs_type == value_t::number_unsigned and rhs_type == value_t::number_integer)
+        {
+            return static_cast<number_integer_t>(lhs.m_value.number_unsigned) < rhs.m_value.number_integer;
+        }
+
+        // We only reach this line if we cannot compare values. In that case,
+        // we compare types. Note we have to call the operator explicitly,
+        // because MSVC has problems otherwise.
+        return operator<(lhs_type, rhs_type);
+    }
+
+    /*!
+    @brief comparison: less than
+    @copydoc operator<(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<(const_reference lhs, const ScalarType rhs) noexcept
+    {
+        return (lhs < basic_json(rhs));
+    }
+
+    /*!
+    @brief comparison: less than
+    @copydoc operator<(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<(const ScalarType lhs, const_reference rhs) noexcept
+    {
+        return (basic_json(lhs) < rhs);
+    }
+
+    /*!
+    @brief comparison: less than or equal
+
+    Compares whether one JSON value @a lhs is less than or equal to another
+    JSON value by calculating `not (rhs < lhs)`.
+
+    @param[in] lhs  first JSON value to consider
+    @param[in] rhs  second JSON value to consider
+    @return whether @a lhs is less than or equal to @a rhs
+
+    @complexity Linear.
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @liveexample{The example demonstrates comparing several JSON
+    types.,operator__greater}
+
+    @since version 1.0.0
+    */
+    friend bool operator<=(const_reference lhs, const_reference rhs) noexcept
+    {
+        return not (rhs < lhs);
+    }
+
+    /*!
+    @brief comparison: less than or equal
+    @copydoc operator<=(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<=(const_reference lhs, const ScalarType rhs) noexcept
+    {
+        return (lhs <= basic_json(rhs));
+    }
+
+    /*!
+    @brief comparison: less than or equal
+    @copydoc operator<=(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator<=(const ScalarType lhs, const_reference rhs) noexcept
+    {
+        return (basic_json(lhs) <= rhs);
+    }
+
+    /*!
+    @brief comparison: greater than
+
+    Compares whether one JSON value @a lhs is greater than another
+    JSON value by calculating `not (lhs <= rhs)`.
+
+    @param[in] lhs  first JSON value to consider
+    @param[in] rhs  second JSON value to consider
+    @return whether @a lhs is greater than to @a rhs
+
+    @complexity Linear.
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @liveexample{The example demonstrates comparing several JSON
+    types.,operator__lessequal}
+
+    @since version 1.0.0
+    */
+    friend bool operator>(const_reference lhs, const_reference rhs) noexcept
+    {
+        return not (lhs <= rhs);
+    }
+
+    /*!
+    @brief comparison: greater than
+    @copydoc operator>(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>(const_reference lhs, const ScalarType rhs) noexcept
+    {
+        return (lhs > basic_json(rhs));
+    }
+
+    /*!
+    @brief comparison: greater than
+    @copydoc operator>(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>(const ScalarType lhs, const_reference rhs) noexcept
+    {
+        return (basic_json(lhs) > rhs);
+    }
+
+    /*!
+    @brief comparison: greater than or equal
+
+    Compares whether one JSON value @a lhs is greater than or equal to another
+    JSON value by calculating `not (lhs < rhs)`.
+
+    @param[in] lhs  first JSON value to consider
+    @param[in] rhs  second JSON value to consider
+    @return whether @a lhs is greater than or equal to @a rhs
+
+    @complexity Linear.
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @liveexample{The example demonstrates comparing several JSON
+    types.,operator__greaterequal}
+
+    @since version 1.0.0
+    */
+    friend bool operator>=(const_reference lhs, const_reference rhs) noexcept
+    {
+        return not (lhs < rhs);
+    }
+
+    /*!
+    @brief comparison: greater than or equal
+    @copydoc operator>=(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>=(const_reference lhs, const ScalarType rhs) noexcept
+    {
+        return (lhs >= basic_json(rhs));
+    }
+
+    /*!
+    @brief comparison: greater than or equal
+    @copydoc operator>=(const_reference, const_reference)
+    */
+    template<typename ScalarType, typename std::enable_if<
+                 std::is_scalar<ScalarType>::value, int>::type = 0>
+    friend bool operator>=(const ScalarType lhs, const_reference rhs) noexcept
+    {
+        return (basic_json(lhs) >= rhs);
+    }
+
+    /// @}
+
+    ///////////////////
+    // serialization //
+    ///////////////////
+
+    /// @name serialization
+    /// @{
+
+    /*!
+    @brief serialize to stream
+
+    Serialize the given JSON value @a j to the output stream @a o. The JSON
+    value will be serialized using the @ref dump member function.
+
+    - The indentation of the output can be controlled with the member variable
+      `width` of the output stream @a o. For instance, using the manipulator
+      `std::setw(4)` on @a o sets the indentation level to `4` and the
+      serialization result is the same as calling `dump(4)`.
+
+    - The indentation character can be controlled with the member variable
+      `fill` of the output stream @a o. For instance, the manipulator
+      `std::setfill('\\t')` sets indentation to use a tab character rather than
+      the default space character.
+
+    @param[in,out] o  stream to serialize to
+    @param[in] j  JSON value to serialize
+
+    @return the stream @a o
+
+    @throw type_error.316 if a string stored inside the JSON value is not
+                          UTF-8 encoded
+
+    @complexity Linear.
+
+    @liveexample{The example below shows the serialization with different
+    parameters to `width` to adjust the indentation level.,operator_serialize}
+
+    @since version 1.0.0; indentation character added in version 3.0.0
+    */
+    friend std::ostream& operator<<(std::ostream& o, const basic_json& j)
+    {
+        // read width member and use it as indentation parameter if nonzero
+        const bool pretty_print = (o.width() > 0);
+        const auto indentation = (pretty_print ? o.width() : 0);
+
+        // reset width to 0 for subsequent calls to this stream
+        o.width(0);
+
+        // do the actual serialization
+        serializer s(detail::output_adapter<char>(o), o.fill());
+        s.dump(j, pretty_print, false, static_cast<unsigned int>(indentation));
+        return o;
+    }
+
+    /*!
+    @brief serialize to stream
+    @deprecated This stream operator is deprecated and will be removed in
+                future 4.0.0 of the library. Please use
+                @ref operator<<(std::ostream&, const basic_json&)
+                instead; that is, replace calls like `j >> o;` with `o << j;`.
+    @since version 1.0.0; deprecated since version 3.0.0
+    */
+    JSON_DEPRECATED
+    friend std::ostream& operator>>(const basic_json& j, std::ostream& o)
+    {
+        return o << j;
+    }
+
+    /// @}
+
+
+    /////////////////////
+    // deserialization //
+    /////////////////////
+
+    /// @name deserialization
+    /// @{
+
+    /*!
+    @brief deserialize from a compatible input
+
+    This function reads from a compatible input. Examples are:
+    - an array of 1-byte values
+    - strings with character/literal type with size of 1 byte
+    - input streams
+    - container with contiguous storage of 1-byte values. Compatible container
+      types include `std::vector`, `std::string`, `std::array`,
+      `std::valarray`, and `std::initializer_list`. Furthermore, C-style
+      arrays can be used with `std::begin()`/`std::end()`. User-defined
+      containers can be used as long as they implement random-access iterators
+      and a contiguous storage.
+
+    @pre Each element of the container has a size of 1 byte. Violating this
+    precondition yields undefined behavior. **This precondition is enforced
+    with a static assertion.**
+
+    @pre The container storage is contiguous. Violating this precondition
+    yields undefined behavior. **This precondition is enforced with an
+    assertion.**
+    @pre Each element of the container has a size of 1 byte. Violating this
+    precondition yields undefined behavior. **This precondition is enforced
+    with a static assertion.**
+
+    @warning There is no way to enforce all preconditions at compile-time. If
+             the function is called with a noncompliant container and with
+             assertions switched off, the behavior is undefined and will most
+             likely yield segmentation violation.
+
+    @param[in] i  input to read from
+    @param[in] cb  a parser callback function of type @ref parser_callback_t
+    which is used to control the deserialization by filtering unwanted values
+    (optional)
+
+    @return result of the deserialization
+
+    @throw parse_error.101 if a parse error occurs; example: `""unexpected end
+    of input; expected string literal""`
+    @throw parse_error.102 if to_unicode fails or surrogate error
+    @throw parse_error.103 if to_unicode fails
+
+    @complexity Linear in the length of the input. The parser is a predictive
+    LL(1) parser. The complexity can be higher if the parser callback function
+    @a cb has a super-linear complexity.
+
+    @note A UTF-8 byte order mark is silently ignored.
+
+    @liveexample{The example below demonstrates the `parse()` function reading
+    from an array.,parse__array__parser_callback_t}
+
+    @liveexample{The example below demonstrates the `parse()` function with
+    and without callback function.,parse__string__parser_callback_t}
+
+    @liveexample{The example below demonstrates the `parse()` function with
+    and without callback function.,parse__istream__parser_callback_t}
+
+    @liveexample{The example below demonstrates the `parse()` function reading
+    from a contiguous container.,parse__contiguouscontainer__parser_callback_t}
+
+    @since version 2.0.3 (contiguous containers)
+    */
+    static basic_json parse(detail::input_adapter&& i,
+                            const parser_callback_t cb = nullptr,
+                            const bool allow_exceptions = true)
+    {
+        basic_json result;
+        parser(i, cb, allow_exceptions).parse(true, result);
+        return result;
+    }
+
+    static bool accept(detail::input_adapter&& i)
+    {
+        return parser(i).accept(true);
+    }
+
+    /*!
+    @brief generate SAX events
+
+    The SAX event lister must follow the interface of @ref json_sax.
+
+    This function reads from a compatible input. Examples are:
+    - an array of 1-byte values
+    - strings with character/literal type with size of 1 byte
+    - input streams
+    - container with contiguous storage of 1-byte values. Compatible container
+      types include `std::vector`, `std::string`, `std::array`,
+      `std::valarray`, and `std::initializer_list`. Furthermore, C-style
+      arrays can be used with `std::begin()`/`std::end()`. User-defined
+      containers can be used as long as they implement random-access iterators
+      and a contiguous storage.
+
+    @pre Each element of the container has a size of 1 byte. Violating this
+    precondition yields undefined behavior. **This precondition is enforced
+    with a static assertion.**
+
+    @pre The container storage is contiguous. Violating this precondition
+    yields undefined behavior. **This precondition is enforced with an
+    assertion.**
+    @pre Each element of the container has a size of 1 byte. Violating this
+    precondition yields undefined behavior. **This precondition is enforced
+    with a static assertion.**
+
+    @warning There is no way to enforce all preconditions at compile-time. If
+             the function is called with a noncompliant container and with
+             assertions switched off, the behavior is undefined and will most
+             likely yield segmentation violation.
+
+    @param[in] i  input to read from
+    @param[in,out] sax  SAX event listener
+    @param[in] format  the format to parse (JSON, CBOR, MessagePack, or UBJSON)
+    @param[in] strict  whether the input has to be consumed completely
+
+    @return return value of the last processed SAX event
+
+    @throw parse_error.101 if a parse error occurs; example: `""unexpected end
+    of input; expected string literal""`
+    @throw parse_error.102 if to_unicode fails or surrogate error
+    @throw parse_error.103 if to_unicode fails
+
+    @complexity Linear in the length of the input. The parser is a predictive
+    LL(1) parser. The complexity can be higher if the SAX consumer @a sax has
+    a super-linear complexity.
+
+    @note A UTF-8 byte order mark is silently ignored.
+
+    @liveexample{The example below demonstrates the `sax_parse()` function
+    reading from string and processing the events with a user-defined SAX
+    event consumer.,sax_parse}
+
+    @since version 3.2.0
+    */
+    template <typename SAX>
+    static bool sax_parse(detail::input_adapter&& i, SAX* sax,
+                          input_format_t format = input_format_t::json,
+                          const bool strict = true)
+    {
+        assert(sax);
+        switch (format)
+        {
+            case input_format_t::json:
+                return parser(std::move(i)).sax_parse(sax, strict);
+            default:
+                return detail::binary_reader<basic_json, SAX>(std::move(i)).sax_parse(format, sax, strict);
+        }
+    }
+
+    /*!
+    @brief deserialize from an iterator range with contiguous storage
+
+    This function reads from an iterator range of a container with contiguous
+    storage of 1-byte values. Compatible container types include
+    `std::vector`, `std::string`, `std::array`, `std::valarray`, and
+    `std::initializer_list`. Furthermore, C-style arrays can be used with
+    `std::begin()`/`std::end()`. User-defined containers can be used as long
+    as they implement random-access iterators and a contiguous storage.
+
+    @pre The iterator range is contiguous. Violating this precondition yields
+    undefined behavior. **This precondition is enforced with an assertion.**
+    @pre Each element in the range has a size of 1 byte. Violating this
+    precondition yields undefined behavior. **This precondition is enforced
+    with a static assertion.**
+
+    @warning There is no way to enforce all preconditions at compile-time. If
+             the function is called with noncompliant iterators and with
+             assertions switched off, the behavior is undefined and will most
+             likely yield segmentation violation.
+
+    @tparam IteratorType iterator of container with contiguous storage
+    @param[in] first  begin of the range to parse (included)
+    @param[in] last  end of the range to parse (excluded)
+    @param[in] cb  a parser callback function of type @ref parser_callback_t
+    which is used to control the deserialization by filtering unwanted values
+    (optional)
+    @param[in] allow_exceptions  whether to throw exceptions in case of a
+    parse error (optional, true by default)
+
+    @return result of the deserialization
+
+    @throw parse_error.101 in case of an unexpected token
+    @throw parse_error.102 if to_unicode fails or surrogate error
+    @throw parse_error.103 if to_unicode fails
+
+    @complexity Linear in the length of the input. The parser is a predictive
+    LL(1) parser. The complexity can be higher if the parser callback function
+    @a cb has a super-linear complexity.
+
+    @note A UTF-8 byte order mark is silently ignored.
+
+    @liveexample{The example below demonstrates the `parse()` function reading
+    from an iterator range.,parse__iteratortype__parser_callback_t}
+
+    @since version 2.0.3
+    */
+    template<class IteratorType, typename std::enable_if<
+                 std::is_base_of<
+                     std::random_access_iterator_tag,
+                     typename std::iterator_traits<IteratorType>::iterator_category>::value, int>::type = 0>
+    static basic_json parse(IteratorType first, IteratorType last,
+                            const parser_callback_t cb = nullptr,
+                            const bool allow_exceptions = true)
+    {
+        basic_json result;
+        parser(detail::input_adapter(first, last), cb, allow_exceptions).parse(true, result);
+        return result;
+    }
+
+    template<class IteratorType, typename std::enable_if<
+                 std::is_base_of<
+                     std::random_access_iterator_tag,
+                     typename std::iterator_traits<IteratorType>::iterator_category>::value, int>::type = 0>
+    static bool accept(IteratorType first, IteratorType last)
+    {
+        return parser(detail::input_adapter(first, last)).accept(true);
+    }
+
+    template<class IteratorType, class SAX, typename std::enable_if<
+                 std::is_base_of<
+                     std::random_access_iterator_tag,
+                     typename std::iterator_traits<IteratorType>::iterator_category>::value, int>::type = 0>
+    static bool sax_parse(IteratorType first, IteratorType last, SAX* sax)
+    {
+        return parser(detail::input_adapter(first, last)).sax_parse(sax);
+    }
+
+    /*!
+    @brief deserialize from stream
+    @deprecated This stream operator is deprecated and will be removed in
+                version 4.0.0 of the library. Please use
+                @ref operator>>(std::istream&, basic_json&)
+                instead; that is, replace calls like `j << i;` with `i >> j;`.
+    @since version 1.0.0; deprecated since version 3.0.0
+    */
+    JSON_DEPRECATED
+    friend std::istream& operator<<(basic_json& j, std::istream& i)
+    {
+        return operator>>(i, j);
+    }
+
+    /*!
+    @brief deserialize from stream
+
+    Deserializes an input stream to a JSON value.
+
+    @param[in,out] i  input stream to read a serialized JSON value from
+    @param[in,out] j  JSON value to write the deserialized input to
+
+    @throw parse_error.101 in case of an unexpected token
+    @throw parse_error.102 if to_unicode fails or surrogate error
+    @throw parse_error.103 if to_unicode fails
+
+    @complexity Linear in the length of the input. The parser is a predictive
+    LL(1) parser.
+
+    @note A UTF-8 byte order mark is silently ignored.
+
+    @liveexample{The example below shows how a JSON value is constructed by
+    reading a serialization from a stream.,operator_deserialize}
+
+    @sa parse(std::istream&, const parser_callback_t) for a variant with a
+    parser callback function to filter values while parsing
+
+    @since version 1.0.0
+    */
+    friend std::istream& operator>>(std::istream& i, basic_json& j)
+    {
+        parser(detail::input_adapter(i)).parse(false, j);
+        return i;
+    }
+
+    /// @}
+
+    ///////////////////////////
+    // convenience functions //
+    ///////////////////////////
+
+    /*!
+    @brief return the type as string
+
+    Returns the type name as string to be used in error messages - usually to
+    indicate that a function was called on a wrong JSON type.
+
+    @return a string representation of a the @a m_type member:
+            Value type  | return value
+            ----------- | -------------
+            null        | `"null"`
+            boolean     | `"boolean"`
+            string      | `"string"`
+            number      | `"number"` (for all number types)
+            object      | `"object"`
+            array       | `"array"`
+            discarded   | `"discarded"`
+
+    @exceptionsafety No-throw guarantee: this function never throws exceptions.
+
+    @complexity Constant.
+
+    @liveexample{The following code exemplifies `type_name()` for all JSON
+    types.,type_name}
+
+    @sa @ref type() -- return the type of the JSON value
+    @sa @ref operator value_t() -- return the type of the JSON value (implicit)
+
+    @since version 1.0.0, public since 2.1.0, `const char*` and `noexcept`
+    since 3.0.0
+    */
+    const char* type_name() const noexcept
+    {
+        {
+            switch (m_type)
+            {
+                case value_t::null:
+                    return "null";
+                case value_t::object:
+                    return "object";
+                case value_t::array:
+                    return "array";
+                case value_t::string:
+                    return "string";
+                case value_t::boolean:
+                    return "boolean";
+                case value_t::discarded:
+                    return "discarded";
+                default:
+                    return "number";
+            }
+        }
+    }
+
+
+  private:
+    //////////////////////
+    // member variables //
+    //////////////////////
+
+    /// the type of the current element
+    value_t m_type = value_t::null;
+
+    /// the value of the current element
+    json_value m_value = {};
+
+    //////////////////////////////////////////
+    // binary serialization/deserialization //
+    //////////////////////////////////////////
+
+    /// @name binary serialization/deserialization support
+    /// @{
+
+  public:
+    /*!
+    @brief create a CBOR serialization of a given JSON value
+
+    Serializes a given JSON value @a j to a byte vector using the CBOR (Concise
+    Binary Object Representation) serialization format. CBOR is a binary
+    serialization format which aims to be more compact than JSON itself, yet
+    more efficient to parse.
+
+    The library uses the following mapping from JSON values types to
+    CBOR types according to the CBOR specification (RFC 7049):
+
+    JSON value type | value/range                                | CBOR type                          | first byte
+    --------------- | ------------------------------------------ | ---------------------------------- | ---------------
+    null            | `null`                                     | Null                               | 0xF6
+    boolean         | `true`                                     | True                               | 0xF5
+    boolean         | `false`                                    | False                              | 0xF4
+    number_integer  | -9223372036854775808..-2147483649          | Negative integer (8 bytes follow)  | 0x3B
+    number_integer  | -2147483648..-32769                        | Negative integer (4 bytes follow)  | 0x3A
+    number_integer  | -32768..-129                               | Negative integer (2 bytes follow)  | 0x39
+    number_integer  | -128..-25                                  | Negative integer (1 byte follow)   | 0x38
+    number_integer  | -24..-1                                    | Negative integer                   | 0x20..0x37
+    number_integer  | 0..23                                      | Integer                            | 0x00..0x17
+    number_integer  | 24..255                                    | Unsigned integer (1 byte follow)   | 0x18
+    number_integer  | 256..65535                                 | Unsigned integer (2 bytes follow)  | 0x19
+    number_integer  | 65536..4294967295                          | Unsigned integer (4 bytes follow)  | 0x1A
+    number_integer  | 4294967296..18446744073709551615           | Unsigned integer (8 bytes follow)  | 0x1B
+    number_unsigned | 0..23                                      | Integer                            | 0x00..0x17
+    number_unsigned | 24..255                                    | Unsigned integer (1 byte follow)   | 0x18
+    number_unsigned | 256..65535                                 | Unsigned integer (2 bytes follow)  | 0x19
+    number_unsigned | 65536..4294967295                          | Unsigned integer (4 bytes follow)  | 0x1A
+    number_unsigned | 4294967296..18446744073709551615           | Unsigned integer (8 bytes follow)  | 0x1B
+    number_float    | *any value*                                | Double-Precision Float             | 0xFB
+    string          | *length*: 0..23                            | UTF-8 string                       | 0x60..0x77
+    string          | *length*: 23..255                          | UTF-8 string (1 byte follow)       | 0x78
+    string          | *length*: 256..65535                       | UTF-8 string (2 bytes follow)      | 0x79
+    string          | *length*: 65536..4294967295                | UTF-8 string (4 bytes follow)      | 0x7A
+    string          | *length*: 4294967296..18446744073709551615 | UTF-8 string (8 bytes follow)      | 0x7B
+    array           | *size*: 0..23                              | array                              | 0x80..0x97
+    array           | *size*: 23..255                            | array (1 byte follow)              | 0x98
+    array           | *size*: 256..65535                         | array (2 bytes follow)             | 0x99
+    array           | *size*: 65536..4294967295                  | array (4 bytes follow)             | 0x9A
+    array           | *size*: 4294967296..18446744073709551615   | array (8 bytes follow)             | 0x9B
+    object          | *size*: 0..23                              | map                                | 0xA0..0xB7
+    object          | *size*: 23..255                            | map (1 byte follow)                | 0xB8
+    object          | *size*: 256..65535                         | map (2 bytes follow)               | 0xB9
+    object          | *size*: 65536..4294967295                  | map (4 bytes follow)               | 0xBA
+    object          | *size*: 4294967296..18446744073709551615   | map (8 bytes follow)               | 0xBB
+
+    @note The mapping is **complete** in the sense that any JSON value type
+          can be converted to a CBOR value.
+
+    @note If NaN or Infinity are stored inside a JSON number, they are
+          serialized properly. This behavior differs from the @ref dump()
+          function which serializes NaN or Infinity to `null`.
+
+    @note The following CBOR types are not used in the conversion:
+          - byte strings (0x40..0x5F)
+          - UTF-8 strings terminated by "break" (0x7F)
+          - arrays terminated by "break" (0x9F)
+          - maps terminated by "break" (0xBF)
+          - date/time (0xC0..0xC1)
+          - bignum (0xC2..0xC3)
+          - decimal fraction (0xC4)
+          - bigfloat (0xC5)
+          - tagged items (0xC6..0xD4, 0xD8..0xDB)
+          - expected conversions (0xD5..0xD7)
+          - simple values (0xE0..0xF3, 0xF8)
+          - undefined (0xF7)
+          - half and single-precision floats (0xF9-0xFA)
+          - break (0xFF)
+
+    @param[in] j  JSON value to serialize
+    @return MessagePack serialization as byte vector
+
+    @complexity Linear in the size of the JSON value @a j.
+
+    @liveexample{The example shows the serialization of a JSON value to a byte
+    vector in CBOR format.,to_cbor}
+
+    @sa http://cbor.io
+    @sa @ref from_cbor(detail::input_adapter, const bool strict) for the
+        analogous deserialization
+    @sa @ref to_msgpack(const basic_json&) for the related MessagePack format
+    @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the
+             related UBJSON format
+
+    @since version 2.0.9
+    */
+    static std::vector<uint8_t> to_cbor(const basic_json& j)
+    {
+        std::vector<uint8_t> result;
+        to_cbor(j, result);
+        return result;
+    }
+
+    static void to_cbor(const basic_json& j, detail::output_adapter<uint8_t> o)
+    {
+        binary_writer<uint8_t>(o).write_cbor(j);
+    }
+
+    static void to_cbor(const basic_json& j, detail::output_adapter<char> o)
+    {
+        binary_writer<char>(o).write_cbor(j);
+    }
+
+    /*!
+    @brief create a MessagePack serialization of a given JSON value
+
+    Serializes a given JSON value @a j to a byte vector using the MessagePack
+    serialization format. MessagePack is a binary serialization format which
+    aims to be more compact than JSON itself, yet more efficient to parse.
+
+    The library uses the following mapping from JSON values types to
+    MessagePack types according to the MessagePack specification:
+
+    JSON value type | value/range                       | MessagePack type | first byte
+    --------------- | --------------------------------- | ---------------- | ----------
+    null            | `null`                            | nil              | 0xC0
+    boolean         | `true`                            | true             | 0xC3
+    boolean         | `false`                           | false            | 0xC2
+    number_integer  | -9223372036854775808..-2147483649 | int64            | 0xD3
+    number_integer  | -2147483648..-32769               | int32            | 0xD2
+    number_integer  | -32768..-129                      | int16            | 0xD1
+    number_integer  | -128..-33                         | int8             | 0xD0
+    number_integer  | -32..-1                           | negative fixint  | 0xE0..0xFF
+    number_integer  | 0..127                            | positive fixint  | 0x00..0x7F
+    number_integer  | 128..255                          | uint 8           | 0xCC
+    number_integer  | 256..65535                        | uint 16          | 0xCD
+    number_integer  | 65536..4294967295                 | uint 32          | 0xCE
+    number_integer  | 4294967296..18446744073709551615  | uint 64          | 0xCF
+    number_unsigned | 0..127                            | positive fixint  | 0x00..0x7F
+    number_unsigned | 128..255                          | uint 8           | 0xCC
+    number_unsigned | 256..65535                        | uint 16          | 0xCD
+    number_unsigned | 65536..4294967295                 | uint 32          | 0xCE
+    number_unsigned | 4294967296..18446744073709551615  | uint 64          | 0xCF
+    number_float    | *any value*                       | float 64         | 0xCB
+    string          | *length*: 0..31                   | fixstr           | 0xA0..0xBF
+    string          | *length*: 32..255                 | str 8            | 0xD9
+    string          | *length*: 256..65535              | str 16           | 0xDA
+    string          | *length*: 65536..4294967295       | str 32           | 0xDB
+    array           | *size*: 0..15                     | fixarray         | 0x90..0x9F
+    array           | *size*: 16..65535                 | array 16         | 0xDC
+    array           | *size*: 65536..4294967295         | array 32         | 0xDD
+    object          | *size*: 0..15                     | fix map          | 0x80..0x8F
+    object          | *size*: 16..65535                 | map 16           | 0xDE
+    object          | *size*: 65536..4294967295         | map 32           | 0xDF
+
+    @note The mapping is **complete** in the sense that any JSON value type
+          can be converted to a MessagePack value.
+
+    @note The following values can **not** be converted to a MessagePack value:
+          - strings with more than 4294967295 bytes
+          - arrays with more than 4294967295 elements
+          - objects with more than 4294967295 elements
+
+    @note The following MessagePack types are not used in the conversion:
+          - bin 8 - bin 32 (0xC4..0xC6)
+          - ext 8 - ext 32 (0xC7..0xC9)
+          - float 32 (0xCA)
+          - fixext 1 - fixext 16 (0xD4..0xD8)
+
+    @note Any MessagePack output created @ref to_msgpack can be successfully
+          parsed by @ref from_msgpack.
+
+    @note If NaN or Infinity are stored inside a JSON number, they are
+          serialized properly. This behavior differs from the @ref dump()
+          function which serializes NaN or Infinity to `null`.
+
+    @param[in] j  JSON value to serialize
+    @return MessagePack serialization as byte vector
+
+    @complexity Linear in the size of the JSON value @a j.
+
+    @liveexample{The example shows the serialization of a JSON value to a byte
+    vector in MessagePack format.,to_msgpack}
+
+    @sa http://msgpack.org
+    @sa @ref from_msgpack(const std::vector<uint8_t>&, const size_t) for the
+        analogous deserialization
+    @sa @ref to_cbor(const basic_json& for the related CBOR format
+    @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the
+             related UBJSON format
+
+    @since version 2.0.9
+    */
+    static std::vector<uint8_t> to_msgpack(const basic_json& j)
+    {
+        std::vector<uint8_t> result;
+        to_msgpack(j, result);
+        return result;
+    }
+
+    static void to_msgpack(const basic_json& j, detail::output_adapter<uint8_t> o)
+    {
+        binary_writer<uint8_t>(o).write_msgpack(j);
+    }
+
+    static void to_msgpack(const basic_json& j, detail::output_adapter<char> o)
+    {
+        binary_writer<char>(o).write_msgpack(j);
+    }
+
+    /*!
+    @brief create a UBJSON serialization of a given JSON value
+
+    Serializes a given JSON value @a j to a byte vector using the UBJSON
+    (Universal Binary JSON) serialization format. UBJSON aims to be more compact
+    than JSON itself, yet more efficient to parse.
+
+    The library uses the following mapping from JSON values types to
+    UBJSON types according to the UBJSON specification:
+
+    JSON value type | value/range                       | UBJSON type | marker
+    --------------- | --------------------------------- | ----------- | ------
+    null            | `null`                            | null        | `Z`
+    boolean         | `true`                            | true        | `T`
+    boolean         | `false`                           | false       | `F`
+    number_integer  | -9223372036854775808..-2147483649 | int64       | `L`
+    number_integer  | -2147483648..-32769               | int32       | `l`
+    number_integer  | -32768..-129                      | int16       | `I`
+    number_integer  | -128..127                         | int8        | `i`
+    number_integer  | 128..255                          | uint8       | `U`
+    number_integer  | 256..32767                        | int16       | `I`
+    number_integer  | 32768..2147483647                 | int32       | `l`
+    number_integer  | 2147483648..9223372036854775807   | int64       | `L`
+    number_unsigned | 0..127                            | int8        | `i`
+    number_unsigned | 128..255                          | uint8       | `U`
+    number_unsigned | 256..32767                        | int16       | `I`
+    number_unsigned | 32768..2147483647                 | int32       | `l`
+    number_unsigned | 2147483648..9223372036854775807   | int64       | `L`
+    number_float    | *any value*                       | float64     | `D`
+    string          | *with shortest length indicator*  | string      | `S`
+    array           | *see notes on optimized format*   | array       | `[`
+    object          | *see notes on optimized format*   | map         | `{`
+
+    @note The mapping is **complete** in the sense that any JSON value type
+          can be converted to a UBJSON value.
+
+    @note The following values can **not** be converted to a UBJSON value:
+          - strings with more than 9223372036854775807 bytes (theoretical)
+          - unsigned integer numbers above 9223372036854775807
+
+    @note The following markers are not used in the conversion:
+          - `Z`: no-op values are not created.
+          - `C`: single-byte strings are serialized with `S` markers.
+
+    @note Any UBJSON output created @ref to_ubjson can be successfully parsed
+          by @ref from_ubjson.
+
+    @note If NaN or Infinity are stored inside a JSON number, they are
+          serialized properly. This behavior differs from the @ref dump()
+          function which serializes NaN or Infinity to `null`.
+
+    @note The optimized formats for containers are supported: Parameter
+          @a use_size adds size information to the beginning of a container and
+          removes the closing marker. Parameter @a use_type further checks
+          whether all elements of a container have the same type and adds the
+          type marker to the beginning of the container. The @a use_type
+          parameter must only be used together with @a use_size = true. Note
+          that @a use_size = true alone may result in larger representations -
+          the benefit of this parameter is that the receiving side is
+          immediately informed on the number of elements of the container.
+
+    @param[in] j  JSON value to serialize
+    @param[in] use_size  whether to add size annotations to container types
+    @param[in] use_type  whether to add type annotations to container types
+                         (must be combined with @a use_size = true)
+    @return UBJSON serialization as byte vector
+
+    @complexity Linear in the size of the JSON value @a j.
+
+    @liveexample{The example shows the serialization of a JSON value to a byte
+    vector in UBJSON format.,to_ubjson}
+
+    @sa http://ubjson.org
+    @sa @ref from_ubjson(detail::input_adapter, const bool strict) for the
+        analogous deserialization
+    @sa @ref to_cbor(const basic_json& for the related CBOR format
+    @sa @ref to_msgpack(const basic_json&) for the related MessagePack format
+
+    @since version 3.1.0
+    */
+    static std::vector<uint8_t> to_ubjson(const basic_json& j,
+                                          const bool use_size = false,
+                                          const bool use_type = false)
+    {
+        std::vector<uint8_t> result;
+        to_ubjson(j, result, use_size, use_type);
+        return result;
+    }
+
+    static void to_ubjson(const basic_json& j, detail::output_adapter<uint8_t> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<uint8_t>(o).write_ubjson(j, use_size, use_type);
+    }
+
+    static void to_ubjson(const basic_json& j, detail::output_adapter<char> o,
+                          const bool use_size = false, const bool use_type = false)
+    {
+        binary_writer<char>(o).write_ubjson(j, use_size, use_type);
+    }
+
+    /*!
+    @brief create a JSON value from an input in CBOR format
+
+    Deserializes a given input @a i to a JSON value using the CBOR (Concise
+    Binary Object Representation) serialization format.
+
+    The library maps CBOR types to JSON value types as follows:
+
+    CBOR type              | JSON value type | first byte
+    ---------------------- | --------------- | ----------
+    Integer                | number_unsigned | 0x00..0x17
+    Unsigned integer       | number_unsigned | 0x18
+    Unsigned integer       | number_unsigned | 0x19
+    Unsigned integer       | number_unsigned | 0x1A
+    Unsigned integer       | number_unsigned | 0x1B
+    Negative integer       | number_integer  | 0x20..0x37
+    Negative integer       | number_integer  | 0x38
+    Negative integer       | number_integer  | 0x39
+    Negative integer       | number_integer  | 0x3A
+    Negative integer       | number_integer  | 0x3B
+    Negative integer       | number_integer  | 0x40..0x57
+    UTF-8 string           | string          | 0x60..0x77
+    UTF-8 string           | string          | 0x78
+    UTF-8 string           | string          | 0x79
+    UTF-8 string           | string          | 0x7A
+    UTF-8 string           | string          | 0x7B
+    UTF-8 string           | string          | 0x7F
+    array                  | array           | 0x80..0x97
+    array                  | array           | 0x98
+    array                  | array           | 0x99
+    array                  | array           | 0x9A
+    array                  | array           | 0x9B
+    array                  | array           | 0x9F
+    map                    | object          | 0xA0..0xB7
+    map                    | object          | 0xB8
+    map                    | object          | 0xB9
+    map                    | object          | 0xBA
+    map                    | object          | 0xBB
+    map                    | object          | 0xBF
+    False                  | `false`         | 0xF4
+    True                   | `true`          | 0xF5
+    Nill                   | `null`          | 0xF6
+    Half-Precision Float   | number_float    | 0xF9
+    Single-Precision Float | number_float    | 0xFA
+    Double-Precision Float | number_float    | 0xFB
+
+    @warning The mapping is **incomplete** in the sense that not all CBOR
+             types can be converted to a JSON value. The following CBOR types
+             are not supported and will yield parse errors (parse_error.112):
+             - byte strings (0x40..0x5F)
+             - date/time (0xC0..0xC1)
+             - bignum (0xC2..0xC3)
+             - decimal fraction (0xC4)
+             - bigfloat (0xC5)
+             - tagged items (0xC6..0xD4, 0xD8..0xDB)
+             - expected conversions (0xD5..0xD7)
+             - simple values (0xE0..0xF3, 0xF8)
+             - undefined (0xF7)
+
+    @warning CBOR allows map keys of any type, whereas JSON only allows
+             strings as keys in object values. Therefore, CBOR maps with keys
+             other than UTF-8 strings are rejected (parse_error.113).
+
+    @note Any CBOR output created @ref to_cbor can be successfully parsed by
+          @ref from_cbor.
+
+    @param[in] i  an input in CBOR format convertible to an input adapter
+    @param[in] strict  whether to expect the input to be consumed until EOF
+                       (true by default)
+    @param[in] allow_exceptions  whether to throw exceptions in case of a
+    parse error (optional, true by default)
+
+    @return deserialized JSON value
+
+    @throw parse_error.110 if the given input ends prematurely or the end of
+    file was not reached when @a strict was set to true
+    @throw parse_error.112 if unsupported features from CBOR were
+    used in the given input @a v or if the input is not valid CBOR
+    @throw parse_error.113 if a string was expected as map key, but not found
+
+    @complexity Linear in the size of the input @a i.
+
+    @liveexample{The example shows the deserialization of a byte vector in CBOR
+    format to a JSON value.,from_cbor}
+
+    @sa http://cbor.io
+    @sa @ref to_cbor(const basic_json&) for the analogous serialization
+    @sa @ref from_msgpack(detail::input_adapter, const bool, const bool) for the
+        related MessagePack format
+    @sa @ref from_ubjson(detail::input_adapter, const bool, const bool) for the
+        related UBJSON format
+
+    @since version 2.0.9; parameter @a start_index since 2.1.1; changed to
+           consume input adapters, removed start_index parameter, and added
+           @a strict parameter since 3.0.0; added @allow_exceptions parameter
+           since 3.2.0
+    */
+    static basic_json from_cbor(detail::input_adapter&& i,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        const bool res = binary_reader(detail::input_adapter(i)).sax_parse(input_format_t::cbor, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /*!
+    @copydoc from_cbor(detail::input_adapter, const bool, const bool)
+    */
+    template<typename A1, typename A2,
+             detail::enable_if_t<std::is_constructible<detail::input_adapter, A1, A2>::value, int> = 0>
+    static basic_json from_cbor(A1 && a1, A2 && a2,
+                                const bool strict = true,
+                                const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        const bool res = binary_reader(detail::input_adapter(std::forward<A1>(a1), std::forward<A2>(a2))).sax_parse(input_format_t::cbor, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /*!
+    @brief create a JSON value from an input in MessagePack format
+
+    Deserializes a given input @a i to a JSON value using the MessagePack
+    serialization format.
+
+    The library maps MessagePack types to JSON value types as follows:
+
+    MessagePack type | JSON value type | first byte
+    ---------------- | --------------- | ----------
+    positive fixint  | number_unsigned | 0x00..0x7F
+    fixmap           | object          | 0x80..0x8F
+    fixarray         | array           | 0x90..0x9F
+    fixstr           | string          | 0xA0..0xBF
+    nil              | `null`          | 0xC0
+    false            | `false`         | 0xC2
+    true             | `true`          | 0xC3
+    float 32         | number_float    | 0xCA
+    float 64         | number_float    | 0xCB
+    uint 8           | number_unsigned | 0xCC
+    uint 16          | number_unsigned | 0xCD
+    uint 32          | number_unsigned | 0xCE
+    uint 64          | number_unsigned | 0xCF
+    int 8            | number_integer  | 0xD0
+    int 16           | number_integer  | 0xD1
+    int 32           | number_integer  | 0xD2
+    int 64           | number_integer  | 0xD3
+    str 8            | string          | 0xD9
+    str 16           | string          | 0xDA
+    str 32           | string          | 0xDB
+    array 16         | array           | 0xDC
+    array 32         | array           | 0xDD
+    map 16           | object          | 0xDE
+    map 32           | object          | 0xDF
+    negative fixint  | number_integer  | 0xE0-0xFF
+
+    @warning The mapping is **incomplete** in the sense that not all
+             MessagePack types can be converted to a JSON value. The following
+             MessagePack types are not supported and will yield parse errors:
+              - bin 8 - bin 32 (0xC4..0xC6)
+              - ext 8 - ext 32 (0xC7..0xC9)
+              - fixext 1 - fixext 16 (0xD4..0xD8)
+
+    @note Any MessagePack output created @ref to_msgpack can be successfully
+          parsed by @ref from_msgpack.
+
+    @param[in] i  an input in MessagePack format convertible to an input
+                  adapter
+    @param[in] strict  whether to expect the input to be consumed until EOF
+                       (true by default)
+    @param[in] allow_exceptions  whether to throw exceptions in case of a
+    parse error (optional, true by default)
+
+    @return deserialized JSON value
+
+    @throw parse_error.110 if the given input ends prematurely or the end of
+    file was not reached when @a strict was set to true
+    @throw parse_error.112 if unsupported features from MessagePack were
+    used in the given input @a i or if the input is not valid MessagePack
+    @throw parse_error.113 if a string was expected as map key, but not found
+
+    @complexity Linear in the size of the input @a i.
+
+    @liveexample{The example shows the deserialization of a byte vector in
+    MessagePack format to a JSON value.,from_msgpack}
+
+    @sa http://msgpack.org
+    @sa @ref to_msgpack(const basic_json&) for the analogous serialization
+    @sa @ref from_cbor(detail::input_adapter, const bool, const bool) for the
+        related CBOR format
+    @sa @ref from_ubjson(detail::input_adapter, const bool, const bool) for
+        the related UBJSON format
+
+    @since version 2.0.9; parameter @a start_index since 2.1.1; changed to
+           consume input adapters, removed start_index parameter, and added
+           @a strict parameter since 3.0.0; added @allow_exceptions parameter
+           since 3.2.0
+    */
+    static basic_json from_msgpack(detail::input_adapter&& i,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        const bool res = binary_reader(detail::input_adapter(i)).sax_parse(input_format_t::msgpack, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /*!
+    @copydoc from_msgpack(detail::input_adapter, const bool, const bool)
+    */
+    template<typename A1, typename A2,
+             detail::enable_if_t<std::is_constructible<detail::input_adapter, A1, A2>::value, int> = 0>
+    static basic_json from_msgpack(A1 && a1, A2 && a2,
+                                   const bool strict = true,
+                                   const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        const bool res = binary_reader(detail::input_adapter(std::forward<A1>(a1), std::forward<A2>(a2))).sax_parse(input_format_t::msgpack, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /*!
+    @brief create a JSON value from an input in UBJSON format
+
+    Deserializes a given input @a i to a JSON value using the UBJSON (Universal
+    Binary JSON) serialization format.
+
+    The library maps UBJSON types to JSON value types as follows:
+
+    UBJSON type | JSON value type                         | marker
+    ----------- | --------------------------------------- | ------
+    no-op       | *no value, next value is read*          | `N`
+    null        | `null`                                  | `Z`
+    false       | `false`                                 | `F`
+    true        | `true`                                  | `T`
+    float32     | number_float                            | `d`
+    float64     | number_float                            | `D`
+    uint8       | number_unsigned                         | `U`
+    int8        | number_integer                          | `i`
+    int16       | number_integer                          | `I`
+    int32       | number_integer                          | `l`
+    int64       | number_integer                          | `L`
+    string      | string                                  | `S`
+    char        | string                                  | `C`
+    array       | array (optimized values are supported)  | `[`
+    object      | object (optimized values are supported) | `{`
+
+    @note The mapping is **complete** in the sense that any UBJSON value can
+          be converted to a JSON value.
+
+    @param[in] i  an input in UBJSON format convertible to an input adapter
+    @param[in] strict  whether to expect the input to be consumed until EOF
+                       (true by default)
+    @param[in] allow_exceptions  whether to throw exceptions in case of a
+    parse error (optional, true by default)
+
+    @return deserialized JSON value
+
+    @throw parse_error.110 if the given input ends prematurely or the end of
+    file was not reached when @a strict was set to true
+    @throw parse_error.112 if a parse error occurs
+    @throw parse_error.113 if a string could not be parsed successfully
+
+    @complexity Linear in the size of the input @a i.
+
+    @liveexample{The example shows the deserialization of a byte vector in
+    UBJSON format to a JSON value.,from_ubjson}
+
+    @sa http://ubjson.org
+    @sa @ref to_ubjson(const basic_json&, const bool, const bool) for the
+             analogous serialization
+    @sa @ref from_cbor(detail::input_adapter, const bool, const bool) for the
+        related CBOR format
+    @sa @ref from_msgpack(detail::input_adapter, const bool, const bool) for
+        the related MessagePack format
+
+    @since version 3.1.0; added @allow_exceptions parameter since 3.2.0
+    */
+    static basic_json from_ubjson(detail::input_adapter&& i,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        const bool res = binary_reader(detail::input_adapter(i)).sax_parse(input_format_t::ubjson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /*!
+    @copydoc from_ubjson(detail::input_adapter, const bool, const bool)
+    */
+    template<typename A1, typename A2,
+             detail::enable_if_t<std::is_constructible<detail::input_adapter, A1, A2>::value, int> = 0>
+    static basic_json from_ubjson(A1 && a1, A2 && a2,
+                                  const bool strict = true,
+                                  const bool allow_exceptions = true)
+    {
+        basic_json result;
+        detail::json_sax_dom_parser<basic_json> sdp(result, allow_exceptions);
+        const bool res = binary_reader(detail::input_adapter(std::forward<A1>(a1), std::forward<A2>(a2))).sax_parse(input_format_t::ubjson, &sdp, strict);
+        return res ? result : basic_json(value_t::discarded);
+    }
+
+    /// @}
+
+    //////////////////////////
+    // JSON Pointer support //
+    //////////////////////////
+
+    /// @name JSON Pointer functions
+    /// @{
+
+    /*!
+    @brief access specified element via JSON Pointer
+
+    Uses a JSON pointer to retrieve a reference to the respective JSON value.
+    No bound checking is performed. Similar to @ref operator[](const typename
+    object_t::key_type&), `null` values are created in arrays and objects if
+    necessary.
+
+    In particular:
+    - If the JSON pointer points to an object key that does not exist, it
+      is created an filled with a `null` value before a reference to it
+      is returned.
+    - If the JSON pointer points to an array index that does not exist, it
+      is created an filled with a `null` value before a reference to it
+      is returned. All indices between the current maximum and the given
+      index are also filled with `null`.
+    - The special value `-` is treated as a synonym for the index past the
+      end.
+
+    @param[in] ptr  a JSON pointer
+
+    @return reference to the element pointed to by @a ptr
+
+    @complexity Constant.
+
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+
+    @liveexample{The behavior is shown in the example.,operatorjson_pointer}
+
+    @since version 2.0.0
+    */
+    reference operator[](const json_pointer& ptr)
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    /*!
+    @brief access specified element via JSON Pointer
+
+    Uses a JSON pointer to retrieve a reference to the respective JSON value.
+    No bound checking is performed. The function does not change the JSON
+    value; no `null` values are created. In particular, the the special value
+    `-` yields an exception.
+
+    @param[in] ptr  JSON pointer to the desired element
+
+    @return const reference to the element pointed to by @a ptr
+
+    @complexity Constant.
+
+    @throw parse_error.106   if an array index begins with '0'
+    @throw parse_error.109   if an array index was not a number
+    @throw out_of_range.402  if the array index '-' is used
+    @throw out_of_range.404  if the JSON pointer can not be resolved
+
+    @liveexample{The behavior is shown in the example.,operatorjson_pointer_const}
+
+    @since version 2.0.0
+    */
+    const_reference operator[](const json_pointer& ptr) const
+    {
+        return ptr.get_unchecked(this);
+    }
+
+    /*!
+    @brief access specified element via JSON Pointer
+
+    Returns a reference to the element at with specified JSON pointer @a ptr,
+    with bounds checking.
+
+    @param[in] ptr  JSON pointer to the desired element
+
+    @return reference to the element pointed to by @a ptr
+
+    @throw parse_error.106 if an array index in the passed JSON pointer @a ptr
+    begins with '0'. See example below.
+
+    @throw parse_error.109 if an array index in the passed JSON pointer @a ptr
+    is not a number. See example below.
+
+    @throw out_of_range.401 if an array index in the passed JSON pointer @a ptr
+    is out of range. See example below.
+
+    @throw out_of_range.402 if the array index '-' is used in the passed JSON
+    pointer @a ptr. As `at` provides checked access (and no elements are
+    implicitly inserted), the index '-' is always invalid. See example below.
+
+    @throw out_of_range.403 if the JSON pointer describes a key of an object
+    which cannot be found. See example below.
+
+    @throw out_of_range.404 if the JSON pointer @a ptr can not be resolved.
+    See example below.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes in the JSON value.
+
+    @complexity Constant.
+
+    @since version 2.0.0
+
+    @liveexample{The behavior is shown in the example.,at_json_pointer}
+    */
+    reference at(const json_pointer& ptr)
+    {
+        return ptr.get_checked(this);
+    }
+
+    /*!
+    @brief access specified element via JSON Pointer
+
+    Returns a const reference to the element at with specified JSON pointer @a
+    ptr, with bounds checking.
+
+    @param[in] ptr  JSON pointer to the desired element
+
+    @return reference to the element pointed to by @a ptr
+
+    @throw parse_error.106 if an array index in the passed JSON pointer @a ptr
+    begins with '0'. See example below.
+
+    @throw parse_error.109 if an array index in the passed JSON pointer @a ptr
+    is not a number. See example below.
+
+    @throw out_of_range.401 if an array index in the passed JSON pointer @a ptr
+    is out of range. See example below.
+
+    @throw out_of_range.402 if the array index '-' is used in the passed JSON
+    pointer @a ptr. As `at` provides checked access (and no elements are
+    implicitly inserted), the index '-' is always invalid. See example below.
+
+    @throw out_of_range.403 if the JSON pointer describes a key of an object
+    which cannot be found. See example below.
+
+    @throw out_of_range.404 if the JSON pointer @a ptr can not be resolved.
+    See example below.
+
+    @exceptionsafety Strong guarantee: if an exception is thrown, there are no
+    changes in the JSON value.
+
+    @complexity Constant.
+
+    @since version 2.0.0
+
+    @liveexample{The behavior is shown in the example.,at_json_pointer_const}
+    */
+    const_reference at(const json_pointer& ptr) const
+    {
+        return ptr.get_checked(this);
+    }
+
+    /*!
+    @brief return flattened JSON value
+
+    The function creates a JSON object whose keys are JSON pointers (see [RFC
+    6901](https://tools.ietf.org/html/rfc6901)) and whose values are all
+    primitive. The original JSON value can be restored using the @ref
+    unflatten() function.
+
+    @return an object that maps JSON pointers to primitive values
+
+    @note Empty objects and arrays are flattened to `null` and will not be
+          reconstructed correctly by the @ref unflatten() function.
+
+    @complexity Linear in the size the JSON value.
+
+    @liveexample{The following code shows how a JSON object is flattened to an
+    object whose keys consist of JSON pointers.,flatten}
+
+    @sa @ref unflatten() for the reverse function
+
+    @since version 2.0.0
+    */
+    basic_json flatten() const
+    {
+        basic_json result(value_t::object);
+        json_pointer::flatten("", *this, result);
+        return result;
+    }
+
+    /*!
+    @brief unflatten a previously flattened JSON value
+
+    The function restores the arbitrary nesting of a JSON value that has been
+    flattened before using the @ref flatten() function. The JSON value must
+    meet certain constraints:
+    1. The value must be an object.
+    2. The keys must be JSON pointers (see
+       [RFC 6901](https://tools.ietf.org/html/rfc6901))
+    3. The mapped values must be primitive JSON types.
+
+    @return the original JSON from a flattened version
+
+    @note Empty objects and arrays are flattened by @ref flatten() to `null`
+          values and can not unflattened to their original type. Apart from
+          this example, for a JSON value `j`, the following is always true:
+          `j == j.flatten().unflatten()`.
+
+    @complexity Linear in the size the JSON value.
+
+    @throw type_error.314  if value is not an object
+    @throw type_error.315  if object values are not primitive
+
+    @liveexample{The following code shows how a flattened JSON object is
+    unflattened into the original nested JSON object.,unflatten}
+
+    @sa @ref flatten() for the reverse function
+
+    @since version 2.0.0
+    */
+    basic_json unflatten() const
+    {
+        return json_pointer::unflatten(*this);
+    }
+
+    /// @}
+
+    //////////////////////////
+    // JSON Patch functions //
+    //////////////////////////
+
+    /// @name JSON Patch functions
+    /// @{
+
+    /*!
+    @brief applies a JSON patch
+
+    [JSON Patch](http://jsonpatch.com) defines a JSON document structure for
+    expressing a sequence of operations to apply to a JSON) document. With
+    this function, a JSON Patch is applied to the current JSON value by
+    executing all operations from the patch.
+
+    @param[in] json_patch  JSON patch document
+    @return patched document
+
+    @note The application of a patch is atomic: Either all operations succeed
+          and the patched document is returned or an exception is thrown. In
+          any case, the original value is not changed: the patch is applied
+          to a copy of the value.
+
+    @throw parse_error.104 if the JSON patch does not consist of an array of
+    objects
+
+    @throw parse_error.105 if the JSON patch is malformed (e.g., mandatory
+    attributes are missing); example: `"operation add must have member path"`
+
+    @throw out_of_range.401 if an array index is out of range.
+
+    @throw out_of_range.403 if a JSON pointer inside the patch could not be
+    resolved successfully in the current JSON value; example: `"key baz not
+    found"`
+
+    @throw out_of_range.405 if JSON pointer has no parent ("add", "remove",
+    "move")
+
+    @throw other_error.501 if "test" operation was unsuccessful
+
+    @complexity Linear in the size of the JSON value and the length of the
+    JSON patch. As usually only a fraction of the JSON value is affected by
+    the patch, the complexity can usually be neglected.
+
+    @liveexample{The following code shows how a JSON patch is applied to a
+    value.,patch}
+
+    @sa @ref diff -- create a JSON patch by comparing two JSON values
+
+    @sa [RFC 6902 (JSON Patch)](https://tools.ietf.org/html/rfc6902)
+    @sa [RFC 6901 (JSON Pointer)](https://tools.ietf.org/html/rfc6901)
+
+    @since version 2.0.0
+    */
+    basic_json patch(const basic_json& json_patch) const
+    {
+        // make a working copy to apply the patch to
+        basic_json result = *this;
+
+        // the valid JSON Patch operations
+        enum class patch_operations {add, remove, replace, move, copy, test, invalid};
+
+        const auto get_op = [](const std::string & op)
+        {
+            if (op == "add")
+            {
+                return patch_operations::add;
+            }
+            if (op == "remove")
+            {
+                return patch_operations::remove;
+            }
+            if (op == "replace")
+            {
+                return patch_operations::replace;
+            }
+            if (op == "move")
+            {
+                return patch_operations::move;
+            }
+            if (op == "copy")
+            {
+                return patch_operations::copy;
+            }
+            if (op == "test")
+            {
+                return patch_operations::test;
+            }
+
+            return patch_operations::invalid;
+        };
+
+        // wrapper for "add" operation; add value at ptr
+        const auto operation_add = [&result](json_pointer & ptr, basic_json val)
+        {
+            // adding to the root of the target document means replacing it
+            if (ptr.is_root())
+            {
+                result = val;
+            }
+            else
+            {
+                // make sure the top element of the pointer exists
+                json_pointer top_pointer = ptr.top();
+                if (top_pointer != ptr)
+                {
+                    result.at(top_pointer);
+                }
+
+                // get reference to parent of JSON pointer ptr
+                const auto last_path = ptr.pop_back();
+                basic_json& parent = result[ptr];
+
+                switch (parent.m_type)
+                {
+                    case value_t::null:
+                    case value_t::object:
+                    {
+                        // use operator[] to add value
+                        parent[last_path] = val;
+                        break;
+                    }
+
+                    case value_t::array:
+                    {
+                        if (last_path == "-")
+                        {
+                            // special case: append to back
+                            parent.push_back(val);
+                        }
+                        else
+                        {
+                            const auto idx = json_pointer::array_index(last_path);
+                            if (JSON_UNLIKELY(static_cast<size_type>(idx) > parent.size()))
+                            {
+                                // avoid undefined behavior
+                                JSON_THROW(out_of_range::create(401, "array index " + std::to_string(idx) + " is out of range"));
+                            }
+                            else
+                            {
+                                // default case: insert add offset
+                                parent.insert(parent.begin() + static_cast<difference_type>(idx), val);
+                            }
+                        }
+                        break;
+                    }
+
+                    // LCOV_EXCL_START
+                    default:
+                    {
+                        // if there exists a parent it cannot be primitive
+                        assert(false);
+                    }
+                        // LCOV_EXCL_STOP
+                }
+            }
+        };
+
+        // wrapper for "remove" operation; remove value at ptr
+        const auto operation_remove = [&result](json_pointer & ptr)
+        {
+            // get reference to parent of JSON pointer ptr
+            const auto last_path = ptr.pop_back();
+            basic_json& parent = result.at(ptr);
+
+            // remove child
+            if (parent.is_object())
+            {
+                // perform range check
+                auto it = parent.find(last_path);
+                if (JSON_LIKELY(it != parent.end()))
+                {
+                    parent.erase(it);
+                }
+                else
+                {
+                    JSON_THROW(out_of_range::create(403, "key '" + last_path + "' not found"));
+                }
+            }
+            else if (parent.is_array())
+            {
+                // note erase performs range check
+                parent.erase(static_cast<size_type>(json_pointer::array_index(last_path)));
+            }
+        };
+
+        // type check: top level value must be an array
+        if (JSON_UNLIKELY(not json_patch.is_array()))
+        {
+            JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects"));
+        }
+
+        // iterate and apply the operations
+        for (const auto& val : json_patch)
+        {
+            // wrapper to get a value for an operation
+            const auto get_value = [&val](const std::string & op,
+                                          const std::string & member,
+                                          bool string_type) -> basic_json &
+            {
+                // find value
+                auto it = val.m_value.object->find(member);
+
+                // context-sensitive error message
+                const auto error_msg = (op == "op") ? "operation" : "operation '" + op + "'";
+
+                // check if desired value is present
+                if (JSON_UNLIKELY(it == val.m_value.object->end()))
+                {
+                    JSON_THROW(parse_error::create(105, 0, error_msg + " must have member '" + member + "'"));
+                }
+
+                // check if result is of type string
+                if (JSON_UNLIKELY(string_type and not it->second.is_string()))
+                {
+                    JSON_THROW(parse_error::create(105, 0, error_msg + " must have string member '" + member + "'"));
+                }
+
+                // no error: return value
+                return it->second;
+            };
+
+            // type check: every element of the array must be an object
+            if (JSON_UNLIKELY(not val.is_object()))
+            {
+                JSON_THROW(parse_error::create(104, 0, "JSON patch must be an array of objects"));
+            }
+
+            // collect mandatory members
+            const std::string op = get_value("op", "op", true);
+            const std::string path = get_value(op, "path", true);
+            json_pointer ptr(path);
+
+            switch (get_op(op))
+            {
+                case patch_operations::add:
+                {
+                    operation_add(ptr, get_value("add", "value", false));
+                    break;
+                }
+
+                case patch_operations::remove:
+                {
+                    operation_remove(ptr);
+                    break;
+                }
+
+                case patch_operations::replace:
+                {
+                    // the "path" location must exist - use at()
+                    result.at(ptr) = get_value("replace", "value", false);
+                    break;
+                }
+
+                case patch_operations::move:
+                {
+                    const std::string from_path = get_value("move", "from", true);
+                    json_pointer from_ptr(from_path);
+
+                    // the "from" location must exist - use at()
+                    basic_json v = result.at(from_ptr);
+
+                    // The move operation is functionally identical to a
+                    // "remove" operation on the "from" location, followed
+                    // immediately by an "add" operation at the target
+                    // location with the value that was just removed.
+                    operation_remove(from_ptr);
+                    operation_add(ptr, v);
+                    break;
+                }
+
+                case patch_operations::copy:
+                {
+                    const std::string from_path = get_value("copy", "from", true);
+                    const json_pointer from_ptr(from_path);
+
+                    // the "from" location must exist - use at()
+                    basic_json v = result.at(from_ptr);
+
+                    // The copy is functionally identical to an "add"
+                    // operation at the target location using the value
+                    // specified in the "from" member.
+                    operation_add(ptr, v);
+                    break;
+                }
+
+                case patch_operations::test:
+                {
+                    bool success = false;
+                    JSON_TRY
+                    {
+                        // check if "value" matches the one at "path"
+                        // the "path" location must exist - use at()
+                        success = (result.at(ptr) == get_value("test", "value", false));
+                    }
+                    JSON_INTERNAL_CATCH (out_of_range&)
+                    {
+                        // ignore out of range errors: success remains false
+                    }
+
+                    // throw an exception if test fails
+                    if (JSON_UNLIKELY(not success))
+                    {
+                        JSON_THROW(other_error::create(501, "unsuccessful: " + val.dump()));
+                    }
+
+                    break;
+                }
+
+                case patch_operations::invalid:
+                {
+                    // op must be "add", "remove", "replace", "move", "copy", or
+                    // "test"
+                    JSON_THROW(parse_error::create(105, 0, "operation value '" + op + "' is invalid"));
+                }
+            }
+        }
+
+        return result;
+    }
+
+    /*!
+    @brief creates a diff as a JSON patch
+
+    Creates a [JSON Patch](http://jsonpatch.com) so that value @a source can
+    be changed into the value @a target by calling @ref patch function.
+
+    @invariant For two JSON values @a source and @a target, the following code
+    yields always `true`:
+    @code {.cpp}
+    source.patch(diff(source, target)) == target;
+    @endcode
+
+    @note Currently, only `remove`, `add`, and `replace` operations are
+          generated.
+
+    @param[in] source  JSON value to compare from
+    @param[in] target  JSON value to compare against
+    @param[in] path    helper value to create JSON pointers
+
+    @return a JSON patch to convert the @a source to @a target
+
+    @complexity Linear in the lengths of @a source and @a target.
+
+    @liveexample{The following code shows how a JSON patch is created as a
+    diff for two JSON values.,diff}
+
+    @sa @ref patch -- apply a JSON patch
+    @sa @ref merge_patch -- apply a JSON Merge Patch
+
+    @sa [RFC 6902 (JSON Patch)](https://tools.ietf.org/html/rfc6902)
+
+    @since version 2.0.0
+    */
+    static basic_json diff(const basic_json& source, const basic_json& target,
+                           const std::string& path = "")
+    {
+        // the patch
+        basic_json result(value_t::array);
+
+        // if the values are the same, return empty patch
+        if (source == target)
+        {
+            return result;
+        }
+
+        if (source.type() != target.type())
+        {
+            // different types: replace value
+            result.push_back(
+            {
+                {"op", "replace"}, {"path", path}, {"value", target}
+            });
+        }
+        else
+        {
+            switch (source.type())
+            {
+                case value_t::array:
+                {
+                    // first pass: traverse common elements
+                    std::size_t i = 0;
+                    while (i < source.size() and i < target.size())
+                    {
+                        // recursive call to compare array values at index i
+                        auto temp_diff = diff(source[i], target[i], path + "/" + std::to_string(i));
+                        result.insert(result.end(), temp_diff.begin(), temp_diff.end());
+                        ++i;
+                    }
+
+                    // i now reached the end of at least one array
+                    // in a second pass, traverse the remaining elements
+
+                    // remove my remaining elements
+                    const auto end_index = static_cast<difference_type>(result.size());
+                    while (i < source.size())
+                    {
+                        // add operations in reverse order to avoid invalid
+                        // indices
+                        result.insert(result.begin() + end_index, object(
+                        {
+                            {"op", "remove"},
+                            {"path", path + "/" + std::to_string(i)}
+                        }));
+                        ++i;
+                    }
+
+                    // add other remaining elements
+                    while (i < target.size())
+                    {
+                        result.push_back(
+                        {
+                            {"op", "add"},
+                            {"path", path + "/" + std::to_string(i)},
+                            {"value", target[i]}
+                        });
+                        ++i;
+                    }
+
+                    break;
+                }
+
+                case value_t::object:
+                {
+                    // first pass: traverse this object's elements
+                    for (auto it = source.cbegin(); it != source.cend(); ++it)
+                    {
+                        // escape the key name to be used in a JSON patch
+                        const auto key = json_pointer::escape(it.key());
+
+                        if (target.find(it.key()) != target.end())
+                        {
+                            // recursive call to compare object values at key it
+                            auto temp_diff = diff(it.value(), target[it.key()], path + "/" + key);
+                            result.insert(result.end(), temp_diff.begin(), temp_diff.end());
+                        }
+                        else
+                        {
+                            // found a key that is not in o -> remove it
+                            result.push_back(object(
+                            {
+                                {"op", "remove"}, {"path", path + "/" + key}
+                            }));
+                        }
+                    }
+
+                    // second pass: traverse other object's elements
+                    for (auto it = target.cbegin(); it != target.cend(); ++it)
+                    {
+                        if (source.find(it.key()) == source.end())
+                        {
+                            // found a key that is not in this -> add it
+                            const auto key = json_pointer::escape(it.key());
+                            result.push_back(
+                            {
+                                {"op", "add"}, {"path", path + "/" + key},
+                                {"value", it.value()}
+                            });
+                        }
+                    }
+
+                    break;
+                }
+
+                default:
+                {
+                    // both primitive type: replace value
+                    result.push_back(
+                    {
+                        {"op", "replace"}, {"path", path}, {"value", target}
+                    });
+                    break;
+                }
+            }
+        }
+
+        return result;
+    }
+
+    /// @}
+
+    ////////////////////////////////
+    // JSON Merge Patch functions //
+    ////////////////////////////////
+
+    /// @name JSON Merge Patch functions
+    /// @{
+
+    /*!
+    @brief applies a JSON Merge Patch
+
+    The merge patch format is primarily intended for use with the HTTP PATCH
+    method as a means of describing a set of modifications to a target
+    resource's content. This function applies a merge patch to the current
+    JSON value.
+
+    The function implements the following algorithm from Section 2 of
+    [RFC 7396 (JSON Merge Patch)](https://tools.ietf.org/html/rfc7396):
+
+    ```
+    define MergePatch(Target, Patch):
+      if Patch is an Object:
+        if Target is not an Object:
+          Target = {} // Ignore the contents and set it to an empty Object
+        for each Name/Value pair in Patch:
+          if Value is null:
+            if Name exists in Target:
+              remove the Name/Value pair from Target
+          else:
+            Target[Name] = MergePatch(Target[Name], Value)
+        return Target
+      else:
+        return Patch
+    ```
+
+    Thereby, `Target` is the current object; that is, the patch is applied to
+    the current value.
+
+    @param[in] patch  the patch to apply
+
+    @complexity Linear in the lengths of @a patch.
+
+    @liveexample{The following code shows how a JSON Merge Patch is applied to
+    a JSON document.,merge_patch}
+
+    @sa @ref patch -- apply a JSON patch
+    @sa [RFC 7396 (JSON Merge Patch)](https://tools.ietf.org/html/rfc7396)
+
+    @since version 3.0.0
+    */
+    void merge_patch(const basic_json& patch)
+    {
+        if (patch.is_object())
+        {
+            if (not is_object())
+            {
+                *this = object();
+            }
+            for (auto it = patch.begin(); it != patch.end(); ++it)
+            {
+                if (it.value().is_null())
+                {
+                    erase(it.key());
+                }
+                else
+                {
+                    operator[](it.key()).merge_patch(it.value());
+                }
+            }
+        }
+        else
+        {
+            *this = patch;
+        }
+    }
+
+    /// @}
+};
+} // namespace nlohmann
+
+///////////////////////
+// nonmember support //
+///////////////////////
+
+// specialization of std::swap, and std::hash
+namespace std
+{
+/*!
+@brief exchanges the values of two JSON objects
+
+@since version 1.0.0
+*/
+template<>
+inline void swap<nlohmann::json>(nlohmann::json& j1, nlohmann::json& j2) noexcept(
+    is_nothrow_move_constructible<nlohmann::json>::value and
+    is_nothrow_move_assignable<nlohmann::json>::value
+)
+{
+    j1.swap(j2);
+}
+
+/// hash value for JSON objects
+template<>
+struct hash<nlohmann::json>
+{
+    /*!
+    @brief return a hash value for a JSON object
+
+    @since version 1.0.0
+    */
+    std::size_t operator()(const nlohmann::json& j) const
+    {
+        // a naive hashing via the string representation
+        const auto& h = hash<nlohmann::json::string_t>();
+        return h(j.dump());
+    }
+};
+
+/// specialization for std::less<value_t>
+/// @note: do not remove the space after '<',
+///        see https://github.com/nlohmann/json/pull/679
+template<>
+struct less< ::nlohmann::detail::value_t>
+{
+    /*!
+    @brief compare two value_t enum values
+    @since version 3.0.0
+    */
+    bool operator()(nlohmann::detail::value_t lhs,
+                    nlohmann::detail::value_t rhs) const noexcept
+    {
+        return nlohmann::detail::operator<(lhs, rhs);
+    }
+};
+
+} // namespace std
+
+/*!
+@brief user-defined string literal for JSON values
+
+This operator implements a user-defined string literal for JSON objects. It
+can be used by adding `"_json"` to a string literal and returns a JSON object
+if no parse error occurred.
+
+@param[in] s  a string representation of a JSON object
+@param[in] n  the length of string @a s
+@return a JSON object
+
+@since version 1.0.0
+*/
+inline nlohmann::json operator "" _json(const char* s, std::size_t n)
+{
+    return nlohmann::json::parse(s, s + n);
+}
+
+/*!
+@brief user-defined string literal for JSON pointer
+
+This operator implements a user-defined string literal for JSON Pointers. It
+can be used by adding `"_json_pointer"` to a string literal and returns a JSON pointer
+object if no parse error occurred.
+
+@param[in] s  a string representation of a JSON Pointer
+@param[in] n  the length of string @a s
+@return a JSON pointer object
+
+@since version 2.0.0
+*/
+inline nlohmann::json::json_pointer operator "" _json_pointer(const char* s, std::size_t n)
+{
+    return nlohmann::json::json_pointer(std::string(s, n));
+}
+
+// #include <nlohmann/detail/macro_unscope.hpp>
+
+
+// restore GCC/clang diagnostic settings
+#if defined(__clang__) || defined(__GNUC__) || defined(__GNUG__)
+    #pragma GCC diagnostic pop
+#endif
+#if defined(__clang__)
+    #pragma GCC diagnostic pop
+#endif
+
+// clean up
+#undef JSON_INTERNAL_CATCH
+#undef JSON_CATCH
+#undef JSON_THROW
+#undef JSON_TRY
+#undef JSON_LIKELY
+#undef JSON_UNLIKELY
+#undef JSON_DEPRECATED
+#undef JSON_HAS_CPP_14
+#undef JSON_HAS_CPP_17
+#undef NLOHMANN_BASIC_JSON_TPL_DECLARATION
+#undef NLOHMANN_BASIC_JSON_TPL
+#undef NLOHMANN_JSON_HAS_HELPER
+
+
+#endif

ext/installfiles/mac-update/updater.tmpl.sh

@@ -1,49 +0,0 @@
-#!/bin/bash
-
-export PATH=/bin:/usr/bin:/sbin:/usr/sbin
-shopt -s expand_aliases
-
-if [ "$UID" -ne 0 ]; then
-	echo '*** Auto-updater must be run as root.'
-	exit 1
-fi
-
-scriptPath="`dirname "$0"`/`basename "$0"`"
-if [ ! -s "$scriptPath" ]; then
-	scriptPath="$0"
-	if [ ! -s "$scriptPath" ]; then
-		echo "*** Auto-updater cannot determine its own path; $scriptPath is not readable."
-		exit 2
-	fi
-fi
-
-endMarkerIndex=`grep -a -b -E '^################' "$scriptPath" | head -c 16 | cut -d : -f 1`
-if [ "$endMarkerIndex" -le 100 ]; then
-	echo 'Internal error: unable to find end of script / start of binary data marker.'
-	exit 2
-fi
-blobStart=`expr $endMarkerIndex + 17`
-if [ "$blobStart" -le "$endMarkerIndex" ]; then
-	echo 'Internal error: unable to find end of script / start of binary data marker.'
-	exit 2
-fi
-
-rm -f /tmp/ZeroTierOne-update.pkg
-tail -c +$blobStart "$scriptPath" >/tmp/ZeroTierOne-update.pkg
-chmod 0600 /tmp/ZeroTierOne-update.pkg
-
-if [ -s /tmp/ZeroTierOne-update.pkg ]; then
-	rm -f '/Library/Application Support/ZeroTier/One/latest-update.exe' '/Library/Application Support/ZeroTier/One/latest-update.json' /tmp/ZeroTierOne-update.log
-	installer -verbose -pkg /tmp/ZeroTierOne-update.pkg -target / >/tmp/ZeroTierOne-update.log 2>&1
-	rm -f /tmp/ZeroTierOne-update.pkg
-	exit 0
-else
-	echo '*** Error self-unpacking update!'
-	exit 3
-fi
-
-# Do not remove the last line or add a carriage return to it! The installer
-# looks for an unterminated line beginning with 16 #'s in itself to find
-# the binary blob data, which is appended after it.
-
-################

ext/librabbitmq/.clang-format

@@ -1,47 +0,0 @@
----
-# BasedOnStyle:  Google
-AccessModifierOffset: -1
-ConstructorInitializerIndentWidth: 4
-AlignEscapedNewlinesLeft: true
-AlignTrailingComments: true
-AllowAllParametersOfDeclarationOnNextLine: true
-AllowShortIfStatementsOnASingleLine: true
-AllowShortLoopsOnASingleLine: true
-AlwaysBreakTemplateDeclarations: true
-AlwaysBreakBeforeMultilineStrings: true
-BreakBeforeBinaryOperators: false
-BreakBeforeTernaryOperators: true
-BreakConstructorInitializersBeforeComma: false
-BinPackParameters: true
-ColumnLimit:     80
-ConstructorInitializerAllOnOneLineOrOnePerLine: true
-DerivePointerBinding: true
-ExperimentalAutoDetectBinPacking: false
-IndentCaseLabels: true
-MaxEmptyLinesToKeep: 1
-NamespaceIndentation: None
-ObjCSpaceBeforeProtocolList: false
-PenaltyBreakBeforeFirstCallParameter: 1
-PenaltyBreakComment: 60
-PenaltyBreakString: 1000
-PenaltyBreakFirstLessLess: 120
-PenaltyExcessCharacter: 1000000
-PenaltyReturnTypeOnItsOwnLine: 200
-PointerBindsToType: true
-SpacesBeforeTrailingComments: 2
-Cpp11BracedListStyle: true
-Standard:        Auto
-IndentWidth:     2
-TabWidth:        8
-UseTab:          Never
-BreakBeforeBraces: Attach
-IndentFunctionDeclarationAfterType: true
-SpacesInParentheses: false
-SpacesInAngles:  false
-SpaceInEmptyParentheses: false
-SpacesInCStyleCastParentheses: false
-SpaceAfterControlStatementKeyword: true
-SpaceBeforeAssignmentOperators: true
-ContinuationIndentWidth: 4
-...
-

ext/librabbitmq/.gitattributes

@@ -1,18 +0,0 @@
-# Default for those who don't have core.autocrlf set
-* text=auto
-
-# Things that should be treated like text (lines converted on checkout):
-*.c text
-*.h text
-*.py text
-*.cmake text
-*.md text
-# This is for the output of table_test
-*.expected text
-*.xml
-
-# Exceptions to the rule:
-*.ac text eol=lf
-*.am text eol=lf
-*.m4 text eol=lf
-

ext/librabbitmq/.gitignore

@@ -1,73 +0,0 @@
-*.la
-*.lo
-*.o
-.deps
-.dirstamp
-.libs
-/aclocal.m4
-/autom4te.cache
-/bin*
-/build
-/compile
-/config.guess
-/config.h
-/config.h.in
-/config.h.in~
-/config.log
-/config.status
-/config.sub
-/configure
-/cscope.*
-/depcomp
-/install-sh
-/libtool
-/ltmain.sh
-/missing
-/stamp-h1
-/test-suite.log
-INSTALL
-Makefile
-Makefile.in
-examples/amqp_bind
-examples/amqp_connect_timeout
-examples/amqp_consumer
-examples/amqp_exchange_declare
-examples/amqp_listen
-examples/amqp_listenq
-examples/amqp_producer
-examples/amqp_rpc_sendstring_client
-examples/amqp_sendstring
-examples/amqp_unbind
-examples/amqps_bind
-examples/amqps_connect_timeout
-examples/amqps_consumer
-examples/amqps_exchange_declare
-examples/amqps_listen
-examples/amqps_listenq
-examples/amqps_producer
-examples/amqps_sendstring
-examples/amqps_unbind
-librabbitmq.pc
-test-driver
-tests/*.log
-tests/*.trs
-tests/test_hostcheck
-tests/test_parse_url
-tests/test_status_enum
-tests/test_tables
-tools/amqp-consume
-tools/amqp-declare-queue
-tools/amqp-delete-queue
-tools/amqp-get
-tools/amqp-publish
-tools/doc/*.1
-tools/doc/*.7
-tools/doc/man-date.ent
-.ycm_extra_conf.py?
-.DS_Store
-
-# Ignore editor swap files
-*~
-*.sw?
-.#*
-\#*#

ext/librabbitmq/.gitmodules

@@ -1,6 +0,0 @@
-[submodule "codegen"]
-	path = codegen
-	url = https://github.com/rabbitmq/rabbitmq-codegen.git
-[submodule "travis/run-clang-format"]
-	path = travis/run-clang-format
-	url = https://github.com/Sarcasm/run-clang-format.git

ext/librabbitmq/.travis.yml

@@ -1,92 +0,0 @@
-# Travis-CI Build for rabbitmq-c
-# see travis-ci.org for details
-
-language: c
-
-dist: trusty
-# Currently libpopt-dev is not on the list of whitelisted apt-packages.
-sudo: true
-
-env:
-  global:
-   # The next declaration is the encrypted COVERITY_SCAN_TOKEN, created
-   #   via the "travis encrypt" command using the project repo's public key
-   - secure: "gDwqo3jHj+HHGzFKnxL/nwZhbVeh2pItw0TbeaHcLtWubUZaf85ViEQRaXPyfnbG7l0OEQq+PjyhKAfvViVq2NP0lGeeu4VM5uMZJhsCLN594BJr39Y4XzOapg0O8mEMhQ0DU2u1Zo4LMgEcRz67aosVQOj6QV30tOzp9fnxn9U="
-
-services:
-  - rabbitmq
-
-matrix:
-  include:
-    # Note that the first compiler in the matrix must be gcc, so that the
-    # coverity_scan branch hack below works correctly.
-    - compiler: gcc
-      os: linux
-      env: CONFIG=cmake
-    - compiler: gcc
-      os: linux
-      env: CONFIG=format
-    - compiler: gcc
-      os: linux
-      env: CONFIG=coverage
-    - compiler: clang
-      os: linux
-      env: CONFIG=cmake
-    - compiler: clang
-      os: linux
-      env: CONFIG=asan
-    - compiler: clang
-      os: linux
-      env: CONFIG=tsan
-    - compiler: clang
-      os: linux
-      env: CONFIG=scan-build
-    - compiler: clang
-      os: osx
-      env: CONFIG=cmake
-    - compiler: gcc
-      os: linux
-      env: NAME="openssl-1.1.0" CONFIG=cmake
-      addons:
-        apt:
-          sources:
-          - sourceline: 'ppa:ondrej/nginx-mainline'
-          packages:
-          - libssl1.1
-          - openssl
-          - libssl-dev
-
-  allow_failures:
-    - compiler: clang
-      os: linux
-      env: CONFIG=tsan
-
-before_install:
-  - |
-    if [[ "${TRAVIS_OS_NAME}" == "linux" ]]; then
-      wget -O - http://apt.llvm.org/llvm-snapshot.gpg.key | sudo apt-key add -
-      sudo apt-add-repository "deb http://apt.llvm.org/trusty/ llvm-toolchain-trusty-3.9 main"
-      sudo apt-get -q update;
-      sudo apt-get install -y clang-3.9 clang-format-3.9 libpopt-dev;
-    fi
-  # ugly hack; if running a coverity scan abort all except the 1st build
-  # see note re gcc compiler above needing to be 1st
-  # also note that branch_pattern & the TRAVIS_BRANCH check must match
-  # unfortunately COVERITY_SCAN_BRANCH isn't defined until later in the
-  # build process
-  - if ([[ "${TRAVIS_JOB_NUMBER##*.}" != "1" ]] && [[ "${TRAVIS_BRANCH}" == "coverity_scan" ]]); then false ; fi
-
-
-script:
-  # Don't bother building if this is being done in the coverity_scan branch.
-  - if [ "${COVERITY_SCAN_BRANCH}" != 1 ]; then ./travis.sh $CONFIG ; fi
-
-addons:
-  coverity_scan:
-    project:
-      name: "alanxz/rabbitmq-c"
-      description: "C AMQP client for RabbitMQ"
-    notification_email: [email protected]
-    build_command_prepend: mkdir build && pushd build && cmake .. && popd
-    build_command: cmake --build ./build
-    branch_pattern: coverity_scan

ext/librabbitmq/.ycm_extra_conf.py

@@ -1,157 +0,0 @@
-# This file is NOT licensed under the GPLv3, which is the license for the rest
-# of YouCompleteMe.
-#
-# Here's the license text for this file:
-#
-# This is free and unencumbered software released into the public domain.
-#
-# Anyone is free to copy, modify, publish, use, compile, sell, or
-# distribute this software, either in source code form or as a compiled
-# binary, for any purpose, commercial or non-commercial, and by any
-# means.
-#
-# In jurisdictions that recognize copyright laws, the author or authors
-# of this software dedicate any and all copyright interest in the
-# software to the public domain. We make this dedication for the benefit
-# of the public at large and to the detriment of our heirs and
-# successors. We intend this dedication to be an overt act of
-# relinquishment in perpetuity of all present and future rights to this
-# software under copyright law.
-#
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-# IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
-# OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
-# ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
-# OTHER DEALINGS IN THE SOFTWARE.
-#
-# For more information, please refer to <http://unlicense.org/>
-
-import os
-import ycm_core
-
-# These are the compilation flags that will be used in case there's no
-# compilation database set (by default, one is not set).
-# CHANGE THIS LIST OF FLAGS. YES, THIS IS THE DROID YOU HAVE BEEN LOOKING FOR.
-flags = [
-'-Wall',
-'-Wextra',
-# THIS IS IMPORTANT! Without a "-std=<something>" flag, clang won't know which
-# language to use when compiling headers. So it will guess. Badly. So C++
-# headers will be compiled as C headers. You don't want that so ALWAYS specify
-# a "-std=<something>".
-# For a C project, you would set this to something like 'c99' instead of
-# 'c++11'.
-'-std=gnu90',
-# ...and the same thing goes for the magic -x option which specifies the
-# language that the files to be compiled are written in. This is mostly
-# relevant for c++ headers.
-# For a C project, you would set this to 'c' instead of 'c++'.
-'-x',
-'c',
-'-I', './librabbitmq',
-'-I', './librabbitmq/unix',
-'-D', 'HAVE_POLL',
-]
-
-
-# Set this to the absolute path to the folder (NOT the file!) containing the
-# compile_commands.json file to use that instead of 'flags'. See here for
-# more details: http://clang.llvm.org/docs/JSONCompilationDatabase.html
-#
-# You can get CMake to generate this file for you by adding:
-#   set( CMAKE_EXPORT_COMPILE_COMMANDS 1 )
-# to your CMakeLists.txt file.
-#
-# Most projects will NOT need to set this to anything; you can just change the
-# 'flags' list of compilation flags. Notice that YCM itself uses that approach.
-compilation_database_folder = ''
-
-if os.path.exists( compilation_database_folder ):
-  database = ycm_core.CompilationDatabase( compilation_database_folder )
-else:
-  database = None
-
-SOURCE_EXTENSIONS = [ '.cpp', '.cxx', '.cc', '.c', '.m', '.mm' ]
-
-def DirectoryOfThisScript():
-  return os.path.dirname( os.path.abspath( __file__ ) )
-
-
-def MakeRelativePathsInFlagsAbsolute( flags, working_directory ):
-  if not working_directory:
-    return list( flags )
-  new_flags = []
-  make_next_absolute = False
-  path_flags = [ '-isystem', '-I', '-iquote', '--sysroot=' ]
-  for flag in flags:
-    new_flag = flag
-
-    if make_next_absolute:
-      make_next_absolute = False
-      if not flag.startswith( '/' ):
-        new_flag = os.path.join( working_directory, flag )
-
-    for path_flag in path_flags:
-      if flag == path_flag:
-        make_next_absolute = True
-        break
-
-      if flag.startswith( path_flag ):
-        path = flag[ len( path_flag ): ]
-        new_flag = path_flag + os.path.join( working_directory, path )
-        break
-
-    if new_flag:
-      new_flags.append( new_flag )
-  return new_flags
-
-
-def IsHeaderFile( filename ):
-  extension = os.path.splitext( filename )[ 1 ]
-  return extension in [ '.h', '.hxx', '.hpp', '.hh' ]
-
-
-def GetCompilationInfoForFile( filename ):
-  # The compilation_commands.json file generated by CMake does not have entries
-  # for header files. So we do our best by asking the db for flags for a
-  # corresponding source file, if any. If one exists, the flags for that file
-  # should be good enough.
-  if IsHeaderFile( filename ):
-    basename = os.path.splitext( filename )[ 0 ]
-    for extension in SOURCE_EXTENSIONS:
-      replacement_file = basename + extension
-      if os.path.exists( replacement_file ):
-        compilation_info = database.GetCompilationInfoForFile(
-          replacement_file )
-        if compilation_info.compiler_flags_:
-          return compilation_info
-    return None
-  return database.GetCompilationInfoForFile( filename )
-
-
-def FlagsForFile( filename, **kwargs ):
-  if database:
-    # Bear in mind that compilation_info.compiler_flags_ does NOT return a
-    # python list, but a "list-like" StringVec object
-    compilation_info = GetCompilationInfoForFile( filename )
-    if not compilation_info:
-      relative_to = DirectoryOfThisScript()
-      return {
-        'flags': MakeRelativePathsInFlagsAbsolute( flags, relative_to ),
-        'do_cache': True
-      }
-
-    final_flags = MakeRelativePathsInFlagsAbsolute(
-      compilation_info.compiler_flags_,
-      compilation_info.compiler_working_dir_ )
-
-  else:
-    relative_to = DirectoryOfThisScript()
-    final_flags = MakeRelativePathsInFlagsAbsolute( flags, relative_to )
-
-  return {
-    'flags': final_flags,
-    'do_cache': True
-  }

ext/librabbitmq/AUTHORS

@@ -1,2 +0,0 @@
-Tony Garnock-Jones <[email protected]>
-The RabbitMQ team <[email protected]>

ext/librabbitmq/CMakeLists.txt

@@ -1,343 +0,0 @@
-cmake_minimum_required(VERSION 2.8.12)
-project(rabbitmq-c "C")
-
-# Enable MACOSX_RPATH by default. See: cmake --help-policy CMP0042
-if (POLICY CMP0042)
-  cmake_policy(SET CMP0042 NEW)
-endif()
-
-set(CMAKE_MODULE_PATH ${CMAKE_MODULE_PATH} ${CMAKE_CURRENT_SOURCE_DIR}/cmake)
-
-# Follow all steps below in order to calculate new ABI version when updating the library
-# NOTE: THIS IS UNRELATED to the actual project version
-#
-# 1. If the library source code has changed at all since the last update, then increment revision
-# 2. If any interfaces have been added, removed, or changed since the last update, increment current and set revision to 0.
-# 3. If any interfaces have been added since the last public release, then increment age.
-# 4. If any interfaces have been removed since the last public release, then set age to 0.
-
-set(RMQ_SOVERSION_CURRENT   7)
-set(RMQ_SOVERSION_REVISION  0)
-set(RMQ_SOVERSION_AGE       3)
-
-math(EXPR RMQ_SOVERSION_MAJOR "${RMQ_SOVERSION_CURRENT} - ${RMQ_SOVERSION_AGE}")
-math(EXPR RMQ_SOVERSION_MINOR "${RMQ_SOVERSION_AGE}")
-math(EXPR RMQ_SOVERSION_PATCH "${RMQ_SOVERSION_REVISION}")
-
-set(RMQ_VERSION ${RMQ_SOVERSION_MAJOR}.${RMQ_SOVERSION_MINOR}.${RMQ_SOVERSION_PATCH})
-set(RMQ_SOVERSION ${RMQ_SOVERSION_MAJOR})
-
-file(STRINGS librabbitmq/amqp.h _API_VERSION_MAJOR REGEX "^#define AMQP_VERSION_MAJOR [0-9]+$")
-file(STRINGS librabbitmq/amqp.h _API_VERSION_MINOR REGEX "^#define AMQP_VERSION_MINOR [0-9]+$")
-file(STRINGS librabbitmq/amqp.h _API_VERSION_PATCH REGEX "^#define AMQP_VERSION_PATCH [0-9]+$")
-
-string(REGEX MATCH "[0-9]+" _API_VERSION_MAJOR ${_API_VERSION_MAJOR})
-string(REGEX MATCH "[0-9]+" _API_VERSION_MINOR ${_API_VERSION_MINOR})
-string(REGEX MATCH "[0-9]+" _API_VERSION_PATCH ${_API_VERSION_PATCH})
-
-# VERSION to match what is in autotools
-set(VERSION ${_API_VERSION_MAJOR}.${_API_VERSION_MINOR}.${_API_VERSION_PATCH})
-
-if (CMAKE_GENERATOR MATCHES ".*(Make|Ninja).*"
-    AND NOT CMAKE_BUILD_TYPE)
-  set(CMAKE_BUILD_TYPE "Release" CACHE STRING "Choose the type of build, options are: Debug Release RelWithDebInfo MinSizeRel." FORCE)
-  message(STATUS "CMAKE_BUILD_TYPE not specified. Creating ${CMAKE_BUILD_TYPE} build")
-endif()
-
-include(TestCInline)
-include(CheckSymbolExists)
-include(CheckLibraryExists)
-include(CMakePushCheckState)
-include(GNUInstallDirs)
-include(CheckCCompilerFlag)
-
-# Detect if we need to link against a socket library:
-cmake_push_check_state()
-if (WIN32)
-  # Always use WinSock2 on Windows
-  set(SOCKET_LIBRARIES ws2_32)
-else ()
-  # Is it in the default link?
-  check_symbol_exists(getaddrinfo "sys/types.h;sys/socket.h;netdb.h" HAVE_GETADDRINFO)
-  if (NOT (HAVE_GETADDRINFO EQUAL 1))
-    SET(CMAKE_REQUIRED_LIBRARIES "socket")
-    check_symbol_exists(getaddrinfo "sys/types.h;sys/socket.h;netdb.h" HAVE_GETADDRINFO2)
-    if (HAVE_GETADDRINFO2 EQUAL 1)
-      set(SOCKET_LIBRARIES socket)
-    else ()
-      SET(CMAKE_REQUIRED_LIBRARIES "socket;nsl")
-      check_symbol_exists(getaddrinfo "sys/types.h;sys/socket.h;netdb.h" HAVE_GETADDRINFO3)
-      if (HAVE_GETADDRINFO3 EQUAL 1)
-        set(SOCKET_LIBRARIES socket nsl)
-      else ()
-        message(FATAL_ERROR "Cannot find name resolution library (containing symbol getaddrinfo)")
-      endif ()
-    endif ()
-  endif ()
-
-  set(CMAKE_REQUIRED_LIBRARIES ${SOCKET_LIBRARIES})
-  check_symbol_exists(socket "sys/types.h;sys/socket.h" HAVE_SOCKET)
-  if (NOT HAVE_SOCKET EQUAL 1)
-    set(CMAKE_REQUIRED_LIBRARIES socket ${SOCKET_LIBRARIES})
-    check_symbol_exists(socket "sys/types.h;sys/socket.h" HAVE_SOCKET2)
-    if (HAVE_SOCKET2 EQUAL 1)
-      set(SOCKET_LIBRARIES socket ${SOCKET_LIBRARIES})
-    else ()
-      set(CMAKE_REQUIRED_LIBRARIES socket nsl ${SOCKET_LIBRARIES})
-      check_symbol_exists(socket "sys/types.h;sys/socket.h" HAVE_SOCKET3)
-      if (HAVE_SOCKET3 EQUAL 1)
-        set(SOCKET_LIBRARIES socket nsl ${SOCKET_LIBRARIES})
-      else ()
-        message(FATAL_ERROR "Cannot find socket library (containing symbol socket)")
-      endif ()
-    endif ()
-  endif ()
-endif ()
-cmake_pop_check_state()
-
-cmake_push_check_state()
-set(CMAKE_REQUIRED_LIBRARIES ${SOCKET_LIBRARIES})
-check_symbol_exists(poll poll.h HAVE_POLL)
-if (NOT HAVE_POLL)
-  if (WIN32)
-    set(HAVE_SELECT 1)
-  else()
-    check_symbol_exists(select sys/select.h HAVE_SELECT)
-  endif()
-  if (NOT HAVE_SELECT)
-    message(FATAL_ERROR "rabbitmq-c requires poll() or select() to be available")
-  endif()
-endif()
-cmake_pop_check_state()
-
-check_library_exists(rt clock_gettime "time.h" CLOCK_GETTIME_NEEDS_LIBRT)
-check_library_exists(rt posix_spawnp "spawn.h" POSIX_SPAWNP_NEEDS_LIBRT)
-if (CLOCK_GETTIME_NEEDS_LIBRT OR POSIX_SPAWNP_NEEDS_LIBRT)
-  set(LIBRT rt)
-endif()
-
-option(ENABLE_SSL_SUPPORT "Enable SSL support" ON)
-
-if (ENABLE_SSL_SUPPORT)
-  find_package(OpenSSL 0.9.8 REQUIRED)
-
-  cmake_push_check_state()
-  set(THREADS_PREFER_PTHREAD_FLAG ON)
-  find_package(Threads REQUIRED)
-  cmake_pop_check_state()
-endif()
-
-if (MSVC)
-  set(CMAKE_C_FLAGS "/W4 /nologo ${CMAKE_C_FLAGS}")
-elseif (CMAKE_C_COMPILER_ID MATCHES ".*Clang")
-  set(CMAKE_C_FLAGS "-Wall -Wextra -Wstrict-prototypes -Wno-unused-function -fno-common -fvisibility=hidden ${CMAKE_C_FLAGS}")
-elseif (CMAKE_COMPILER_IS_GNUCC)
-  set(RMQ_C_FLAGS "-Wall -Wextra -Wstrict-prototypes -Wno-unused-function -fno-common")
-  execute_process(COMMAND ${CMAKE_C_COMPILER} -dumpversion OUTPUT_VARIABLE GCC_VERSION)
-  if (GCC_VERSION VERSION_GREATER 4.0 OR GCC_VERSION VERSION_EQUAL 4.0)
-      set(RMQ_C_FLAGS "${RMQ_C_FLAGS} -fvisibility=hidden")
-  endif()
-  set(CMAKE_C_FLAGS "${RMQ_C_FLAGS} ${CMAKE_C_FLAGS}")
-endif ()
-
-CHECK_C_COMPILER_FLAG("-std=gnu90" HAVE_GNU90)
-if (HAVE_GNU90)
-  set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -std=gnu90")
-else()
-  CHECK_C_COMPILER_FLAG("-std=c90" HAVE_C90)
-  if (HAVE_C90)
-    set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -std=c90")
-  endif()
-endif()
-
-option(REGENERATE_AMQP_FRAMING "Regenerate amqp_framing.h/amqp_framing.c sources (for developer use)" OFF)
-mark_as_advanced(REGENERATE_AMQP_FRAMING)
-
-if (REGENERATE_AMQP_FRAMING)
-  find_package(PythonInterp)
-  if (NOT PYTHONINTERP_FOUND)
-    message(FATAL_ERROR "REGENERATE_AMQP_FRAMING requires Python to be available")
-  endif ()
-
-  #Determine Python Version:
-  if(PYTHON_EXECUTABLE)
-    execute_process(COMMAND "${PYTHON_EXECUTABLE}" -c
-      "import sys; sys.stdout.write(';'.join([str(x) for x in sys.version_info[:3]]))"
-      OUTPUT_VARIABLE _VERSION
-      RESULT_VARIABLE _PYTHON_VERSION_RESULT
-      ERROR_QUIET)
-    if(NOT _PYTHON_VERSION_RESULT)
-      string(REPLACE ";" "." PYTHON_VERSION_STRING "${_VERSION}")
-      list(GET _VERSION 0 PYTHON_VERSION_MAJOR)
-      list(GET _VERSION 1 PYTHON_VERSION_MINOR)
-      list(GET _VERSION 2 PYTHON_VERSION_PATCH)
-      if(PYTHON_VERSION_PATCH EQUAL 0)
-        # it's called "Python 2.7", not "2.7.0"
-        string(REGEX REPLACE "\\.0$" "" PYTHON_VERSION_STRING "${PYTHON_VERSION_STRING}")
-      endif()
-    else()
-      # sys.version predates sys.version_info, so use that
-      execute_process(COMMAND "${PYTHON_EXECUTABLE}" -c "import sys; sys.stdout.write(sys.version)"
-        OUTPUT_VARIABLE _VERSION
-        RESULT_VARIABLE _PYTHON_VERSION_RESULT
-        ERROR_QUIET)
-      if(NOT _PYTHON_VERSION_RESULT)
-        string(REGEX REPLACE " .*" "" PYTHON_VERSION_STRING "${_VERSION}")
-        string(REGEX REPLACE "^([0-9]+)\\.[0-9]+.*" "\\1" PYTHON_VERSION_MAJOR "${PYTHON_VERSION_STRING}")
-        string(REGEX REPLACE "^[0-9]+\\.([0-9])+.*" "\\1" PYTHON_VERSION_MINOR "${PYTHON_VERSION_STRING}")
-        if(PYTHON_VERSION_STRING MATCHES "^[0-9]+\\.[0-9]+\\.[0-9]+.*")
-          string(REGEX REPLACE "^[0-9]+\\.[0-9]+\\.([0-9]+).*" "\\1" PYTHON_VERSION_PATCH "${PYTHON_VERSION_STRING}")
-        else()
-          set(PYTHON_VERSION_PATCH "0")
-        endif()
-      else()
-        # sys.version was first documented for Python 1.5, so assume
-        # this is older.
-        set(PYTHON_VERSION_STRING "1.4")
-        set(PYTHON_VERSION_MAJOR "1")
-        set(PYTHON_VERSION_MAJOR "4")
-        set(PYTHON_VERSION_MAJOR "0")
-      endif()
-    endif()
-    unset(_PYTHON_VERSION_RESULT)
-    unset(_VERSION)
-  endif(PYTHON_EXECUTABLE)
-
-  # If we're running v3.x look for a 2to3 utility
-  if (PYTHON_VERSION_MAJOR GREATER 2)
-    get_filename_component(PYTHON_EXE_DIR ${PYTHON_EXECUTABLE} PATH)
-    find_program(PYTHON_2TO3_EXECUTABLE
-      NAMES 2to3
-      HINTS ${PYTHON_EXE_DIR}
-      )
-
-    if ("PYTHON_2TO3_EXECUTABLE-NOTFOUND" STREQUAL PYTHON_2TO3_EXECUTABLE)
-      message(FATAL_ERROR "Unable to find 2to3 python utility, specify python 2.7 or specify 2to3 utility")
-    endif ()
-  endif (PYTHON_VERSION_MAJOR GREATER 2)
-
-
-  #check for json or simplejson
-  execute_process(COMMAND ${PYTHON_EXECUTABLE} -c "import json"
-    RESULT_VARIABLE CHECK_PYTHON_JSON_FAILED
-  )
-
-  if (CHECK_PYTHON_JSON_FAILED)
-    execute_process(COMMAND ${PYTHON_EXECUTABLE} -c "import simplejson"
-      RESULT_VARIABLE CHECK_PYTHON_SIMPLEJSON_FAILED
-    )
-
-    if (CHECK_PYTHON_SIMPLEJSON_FAILED)
-      message(FATAL_ERROR "REGENERATE_AMQP_FRAMING requires a python with json or simplejson modules")
-    endif (CHECK_PYTHON_SIMPLEJSON_FAILED)
-  endif (CHECK_PYTHON_JSON_FAILED)
-
-
-  find_path(AMQP_CODEGEN_DIR
-    amqp_codegen.py
-    PATHS ${CMAKE_CURRENT_SOURCE_DIR}/codegen
-          ${CMAKE_CURRENT_SOURCE_DIR}/rabbitmq-codegen
-          ${CMAKE_CURRENT_SOURCE_DIR}/../rabbitmq-codegen
-          DOC "Path to directory containing amqp_codegen.py (rabbitmq-codegen)"
-          NO_DEFAULT_PATH
-          )
-
-  if (AMQP_CODEGEN_DIR STREQUAL "AMQP_CODEGEN_DIR-NOTFOUND")
-    message(SEND_ERROR "REGENERATE_AMQP_FRAMING requires the amqp_codegen.py script. If this is a git clone you can:\n\ngit submodule init\ngit submodule update\n\n Or set AMQP_CODEGEN_DIR to directory containing amqp_codegen.py")
-  else ()
-    message(STATUS "Found amqp_codegen.py in ${AMQP_CODEGEN_DIR}")
-  endif()
-endif (REGENERATE_AMQP_FRAMING)
-
-find_package(POPT)
-find_package(XmlTo)
-find_package(Doxygen)
-
-if (POPT_FOUND AND XmlTo_FOUND)
-  set(DO_DOCS ON)
-endif()
-
-
-option(BUILD_SHARED_LIBS "Build rabbitmq-c as a shared library" ON)
-option(BUILD_STATIC_LIBS "Build rabbitmq-c as a static library" ON)
-
-option(BUILD_EXAMPLES "Build Examples" ON)
-option(BUILD_TOOLS "Build Tools (requires POPT Library)" ${POPT_FOUND})
-option(BUILD_TOOLS_DOCS "Build man pages for Tools (requires xmlto)" ${DO_DOCS})
-option(BUILD_TESTS "Build tests (run tests with make test)" ON)
-option(BUILD_API_DOCS "Build Doxygen API docs" ${DOXYGEN_FOUND})
-
-if (NOT BUILD_SHARED_LIBS AND NOT BUILD_STATIC_LIBS)
-    message(FATAL_ERROR "One or both of BUILD_SHARED_LIBS or BUILD_STATIC_LIBS must be set to ON to build")
-endif()
-
-add_subdirectory(librabbitmq)
-
-if (BUILD_EXAMPLES)
-  add_subdirectory(examples)
-endif ()
-
-if (BUILD_TOOLS)
-  if (POPT_FOUND)
-    add_subdirectory(tools)
-  else ()
-    message(WARNING "POpt library was not found. Tools will not be built")
-  endif ()
-endif ()
-
-if (BUILD_TESTS)
-  if (NOT BUILD_STATIC_LIBS)
-    message(FATAL_ERROR
-      "Tests can only be built against static libraries "
-      "(set BUILD_STATIC_LIBS=ON)")
-  endif ()
-  enable_testing()
-  add_subdirectory(tests)
-endif (BUILD_TESTS)
-
-if (BUILD_API_DOCS)
-  if (NOT DOXYGEN_FOUND)
-    message(FATAL_ERROR "Doxygen is required to build the API documentation")
-  endif ()
-  configure_file(${CMAKE_CURRENT_SOURCE_DIR}/docs/Doxyfile.in ${CMAKE_CURRENT_BINARY_DIR}/docs/Doxyfile @ONLY)
-
-  add_custom_target(docs
-    COMMAND ${DOXYGEN_EXECUTABLE}
-    VERBATIM
-    WORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}/docs
-    DEPENDS rabbitmq
-    COMMENT "Generating API documentation"
-    SOURCES ${CMAKE_CURRENT_SOURCE_DIR}/docs/Doxyfile.in
-    )
-endif ()
-
-set(libs_private ${SOCKET_LIBRARIES} ${LIBRT})
-if (ENABLE_SSL_SUPPORT)
-  set(requires_private "openssl")
-  set(libs_private ${libs_private} ${CMAKE_THREAD_LIBS_INIT})
-endif()
-
-set(prefix ${CMAKE_INSTALL_PREFIX})
-set(exec_prefix "\${prefix}")
-set(libdir "\${exec_prefix}/${CMAKE_INSTALL_LIBDIR}")
-set(includedir "\${prefix}/${CMAKE_INSTALL_INCLUDEDIR}")
-
-configure_file(cmake/config.h.in ${CMAKE_CURRENT_BINARY_DIR}/librabbitmq/config.h)
-configure_file(librabbitmq.pc.in ${CMAKE_CURRENT_BINARY_DIR}/librabbitmq.pc @ONLY)
-
-install(FILES
-  ${CMAKE_CURRENT_BINARY_DIR}/librabbitmq.pc
-  DESTINATION ${CMAKE_INSTALL_LIBDIR}/pkgconfig
-  )
-
-if (BUILD_SHARED_LIBS)
-  message(STATUS "Building rabbitmq as a shared library - yes")
-else ()
-  message(STATUS "Building rabbitmq as a shared library - no")
-endif ()
-
-if (BUILD_STATIC_LIBS)
-  message(STATUS "Building rabbitmq as a static library - yes")
-else ()
-  message(STATUS "Building rabbitmq as a static library - no")
-endif ()

ext/librabbitmq/CONTRIBUTING.md

@@ -1,26 +0,0 @@
-Contributing to rabbitmq-c
-==========================
-
-Thanks for contributing to rabbitmq-c. I firmly believe that participation helps
-make open source software great. With that there are a few things that can be
-done to make our interaction a bit smoother.
-
-Please use the following guidelines when creating an issue or submitting a 
-pull request
-
-Creating an issue
------------------
-When submitting an issue its helpful to know the following
- - What version of rabbitmq-c are you using?
- - What operating system and version are you running on?
- - What compiler and version are you running?
- -
- - If its a build system issue: which build system are you using (
-
-
-Submitting a pull-request
--------------------------
-I love to get code contributions, a few things that can help out:
- - Make sure your commits are rebased on the current master branch
- - Please collapse your commits down to a couple logical commits
-

ext/librabbitmq/ChangeLog.md

@@ -1,221 +0,0 @@
-# Change Log
-## v0.9.0 - 2018-05-08
-### Added:
-- amqp-publish: added support for specifying headers via the -H flag
-- Add support for specifying timeout for amqp_login calls via
-  amqp_set_handshake_timeout
-- Add support for specifying timeouts in RPC-style AMQP methods via
-  amqp_set_rpc_timeout
-- Add define for `AMQP_DEFAULT_VHOST`
-- Support for SSL SNI
-- Support for OpenSSL v1.1.0
-
-### Changed:
-- rabbitmq-c now requires Windows Vista or better
-- rabbitmq-c enables TCP keep-alive by default on platforms that support it
-- dropped support for compiling rabbitmq-c without threading support
-- OpenSSL is no longer un-intialized automatically by default. OpenSSL can be
-  explicitly initialized by calling amqp_initialize_ssl_library and
-  uninitialized by calling amqp_uninitialize_ssl_library.
-
-### Fixed:
-- Correct bugs in processing of --url flag in tools (#364).
-- Improve documentation on AMQP_SASL_METHOD_EXTERNAL (#349)
-- Improve support for compiling under mingw-w64
-- Better support for handing SIGPIPE on Linux over SSL (#401)
-- Improve publish performance on Linux by not specifying MSG_MORE on last part
-  of message.
-- Fix connection logic where multiple hostnames won't be tried if connection to
-  doesn't fail immediately (#430)
-
-### Removed:
-- autotools build system has been removed
-- many duplicate amqps_* examples, they did not add a lot of value
-
-
-## v0.8.0 - 2016-04-09
-### Added:
-- SSL: peer certificate and hostname validation can now be controlled separately
-  using `amqp_ssl_socket_set_verify_peer` and
-  `amqp_ssl_socket_set_verify_hostname`.
-- SSL: the desire SSL version range can now be specified using the
-  `amqp_ssl_socket_set_ssl_versions` function.
-- Add flags to SSL examples on controlling hostname verification.
-
-### Changed:
-- SSL: SSLv2, and SSLv3 have been disabled by default.
-- SSL: OpenSSL hostname validation has been improved.
-- Win32 debug information is built with /Z7 on MSVC to embed debug info instead
-  of using a .pdb
-
-### Fixed:
-- Connection failure results in hang on Win32 (#297, #346)
-- Rabbitmq-c may block when attempting to close an SSL socket (#313)
-- amqp_parse_url does not correctly initialize default parameters (#319)
-- x509 objects are leaked in verify_hostname (#323)
-- TCP_NOPUSH doesn't work under cygwin (#335)
-
-### Deprecated
-- SSL: `amqp_ssl_socket_set_verify` is being replaced by
-  `amqp_ssl_socket_set_verify_peer` and `amqp_ssl_socket_set_verify_hostname`.
-
-### Removed:
-- OpenVMS build system and related files.
-- Unmaintained PolarSSL, CyaSSL, and gnuTLS SSL backends
-
-## Changes since v0.7.0 (a.k.a., v0.7.1)
-- `41fa9df` Autoconf: add missing files in build system
-- `ef73c06` Win32: Use WSAEWOULDBLOCK instead of EWOULDBLOCK on Win32
-- `ceca348` CI: use travis-ci container based builds
-- `393e2df` Lib: if channel_max is 0 use server's channel_max
-- `ff47574` Lib: fix build on OpenBSD
-- `8429496...0ac6430` CI: enable CI on Mac OS X in travis-ci
-
-## Changes since v0.6.0 (a.k.a., v0.7.0)
-- `3379812` Tools: Add support for heartbeats
-- `d7029db` CI: Add continuous integration on Win32 using Appveyor
-- `a5f7ffb` Tests: only link against static libraries
-- `a16ad45...9cf7a3b`  Lib: add support for EXTERNAL SASL method
-- `038a9ed` Lib: fix incorrect parameters to WSAPoll on Win32
-- `a240c69...14ae307` Lib: use non-blocking sockets internally
-- `8d1d5cc`, `5498dc6` Lib: simplify timer/timeout logic
-- `61fc4e1` Lib: add support for heartbeat checks in blocking send calls
-- `f462c0f...3546a70` Lib: Fix warnings on Win32
-- `ba9d8ba...112a54d` Lib: Add support for RabbitMQ auth failure extension
-- `fb8e318` Lib: allow calling functions to override client-properties
-- `3ef3f5f` examples: replace usleep() with nanosleep()
-- `9027a94` Lib: add AMQP_VERSION code
-- `9ee1718` Lib: fix res maybe returned uninitialized in amqp_merge_capbilities
-- `22a36db` Lib: Fix SSL_connection status check
-- `abbefd4` Lib: Fix issues with c89 compatiblity
-- `2bc1f9b...816cbfc` Lib: perf improvements when sending small messages by
-  hinting to the OS message boundaries.
-- `be2e6dd...784a0e9` Lib: add select()-based timeout implementation
-- `91db548...8d77b4c` CI: add ubsan, asan, and tsan CI builds
-
-## Changes since v0.5.2 (a.k.a., v0.6.0)
-- `e1746f9` Tools: Enable support for SSL in tools.
-- `9626dd5` Lib: ABI CHANGE: enable support for auto_delete, internal flags to
-     amqp_exchange_declare
-- `ee54e27`, `656f833` Lib: check for double-close in SSL/TCP socket impl
-- `cf2760d` Lib: allocate struct when method has no field.
-- `513ad4a` Lib: add support for SANs in OpenSSL socket impl.
-- `5348c69` Lib: add functions to get negotiated frame_max and heartbeat parms.
-
-## Changes since v0.5.1 (a.k.a., v0.5.2)
-- `fcdf0f8` Autoconf: check for htonll as declaration in a header file
-- `5790ec7` SSL: correctly report hostname verification errors.
-- `d60c28c` Build: disable OpenSSL deprecation warnings on OSX
-- `072191a` Lib: include platform, version and copyright in AMQP handshake
-- `8b448c6` Examples: print message body in amqp[s]_listen[q] examples
-- `7188e5d` Tools: Add flag to set prefetch for amqp-consume tool
-
-## Changes since v0.5.0 (a.k.a., v0.5.1)
-### Enhancements:
-- `a566929` SSL: Add support for wildcards in hostname verification (Mike
-  Steinert)
-- `a78aa8a` Lib: Use poll(2) instead of select(2) for timeouts on sockets.
-- `357bdb3` Lib: support for specifying frame and decoding pool sizes. (Mike
-  Stitt)
-- `8956003` Lib: improve invalid frame detection code.
-
-### Bug fixes:
-- `b852f84` Lib: Add missing amqp_get_server_properties() function.
-- `7001e82` Lib: Add missing ssize_t on Win32 (emazv72)
-- `c2ce2cb` Lib: Correctly specify WINVER on Win32 when unspecified.
-- `fe844e4` CMake: specify -DHAVE_CONFIG_H in examples.
-- `932de5f` Lib: correct time computation on Win32 (jestor)
-- `3e83192` HPUX: use gethrtime on HP-UX for timers.
-- `cb1b44e` HPUX: correct include location of sys/uio.h
-- `8ce585d` Lib: incorrect OOM condition when 0-lenth exchange name is received.
-- `c7716b8` CMake: correct htonll detection code on platforms defined with a
-  macro.
-- `4dc4eda` Lib: remove unused assignment.
-- `45302cf` Lib: remove range-check of channel-ids.
-
-
-## Changes since v0.4.1 (a.k.a., v0.5.0):
-### Major changes:
-- Add amqp_get_broker_properties() function 5c7c40adc1
-- Remove distro-specific packaging a5749657ee
-- Add -x flag to amqp-consume utilty 1d9c5291ff
-- Add amqp_basic_nack() public API 9b168776fb
-- Add delivery mode constants to amqp.h 5f291ea772
-- Add support for connection.blocked/connection.unblocked methods ccbc24d270
-
-### Bug fixes:
-- `f8c6cee749` Examples: Destroy amqp_envelope_t in consumer example
-- `ac88db56d3` CMake: fix generation of librabbitmq.pc
-- `d5b35afa40` CMake: fix missing POPT_INCLUDE_DIRS variable in tools/
-- `5ea6a0945a` build: provide independent locations for x64 libs
-- `fac34656c0` Doc: documentation fixes
-- `715901d675` Lib: Correct OpenSSL initialization under threaded conditions
-- `ce64e57df8` Examples: Handle unexpected frames in amqp_consumer.c
-- `bcda3e933d` CMake: Use GnuInstallDirs to generate install dirs
-- `27245a4e15` Lib: correctly handle amqp_get_monotonic_timestamp on win32
-- `693662ef5b` Tools: honor --persistent flag in publish utility
-- `01d9c3ca60` Doc: improve documentation in amqp_ssl_socket functions
-- `02d5c58ae4` autoconf: correct librabbitmq.pc generation
-- `1f4e0cc48b` Doc: improve documentation in amqp_tcp_socket functions
-
-## Changes since v0.4.0:
-### Major changes:
-- Removed distro-specific packaging d285d01
-
-### Bug fixes:
-- `a642602` FIX: destroy amqp_envelop_t object in consumer example
-- `860dd71` FIX: correct generation of librabbitmq.pc under CMake
-- `bdda7ab` FIX: amqp_socket_close() should not be exported from shlib
-- `24f4131` FIX: Use correct buf/len vars when re-starting send()
-
-## Changes since v0.3.0:
-### New Features/Enhancements:
-- `amqp_login_with_properties()` function to connect to a broker sending a
-   properties table to the broker 21b124e #101
-- SSL support (Mike Steinert) 473c865 #17
-- `amqp_simple_wait_frame_noblock()` function variant to wait for a frame
-   with a timeout f8cfc72 #119
-- Allow memory to be released on a per-channel basis with
-   `amqp_maybe_release_buffers_on_channel()` 4a2d899 #5
-- Support for AMQP heartbeats while blocking in `amqp_simple_wait_frame*()`
-   and `amqp_basic_publish()` daa0e66 aca5dc1
-- `amqp_socket_open_noblock()` for a non-blocking socket connection
-   (Bogdan Padalko) 6ad770d
-- `amqp_table_clone()` to do a deep-copy of an amqp_table_t 08af83a
-- Add option to listen to multiple keys in `amqp_consume` tool (Brian Hammond) e6c256d
-- Add contributed OpenVMS build system 448ab68
-- Higher level APIs for consuming messages 33ebeed #8
-- Doxygen-based API documentation.
-- Many improvements to error-handling and reporting
-
-### Bug Fixes:
-- `24ffaf8` FIX: autotools was broken when dependency-tracking was disabled
-- `38e741b` FIX: CMake XmlTo not found warning
-- `906f04f` FIX: htonll redeclared on Win32 v8
-- `8e41603` FIX: SIGPIPE not disabled on OS X/BSD #102
-- `872ea49` FIX: Header issues with amqp.h on Mingw on Win32 (yoniyoni)
-- `0f1f75b` FIX: potential memory leak in amqp_new_connection
-- `c9f6312` FIX: missing va_end in `amqp_login()`/`amqp_login_with_properties()`
-- `7bb64e4` FIX: include amqp_tcp_socket.h in dpkg (Tim Stewart)
-- `ba9d1f5` FIX: Report out of buffer space in `amqp_table_encode()`
-- `9496e10` FIX: Remove `abort()` on invalid parameter in `amqp_send_frame()`
-- `f209420` FIX: Remote `abort()` in `amqp_simple_wait_method()`
-- `f027518` FIX: Return error on socket lib init error
-- `0ae534a` FIX: Correctly handle 0 return val from `SSL_read()`/`SSL_write()`
-- `22e41b8` FIX: Improve error handling in socket functions
-- `33c2353` FIX: Set state->socket to NULL after `amqp_socket_close()`
-- `c83e728` FIX: Incorrect error code returned
-- `1a19879` FIX: redecl of int i in `amqp_tcp_socket_writev()`
-- `7477449` FIX: incorrect bit-shift in `amqp_error_string2()`
-- `2e37bb3` FIX: correctly handle `amqp_get_sockfd()` in `amqp_simple_wait_frame()`
-- `52a459b` FIX: Don't delete state in `amqp_tune_connection()` on error
-- `01e38dd` FIX: Correctly handle `mach_timebase_info()` failure
-- `34bffb7` FIX: Correctly disable `SIGPIPE` on platforms with `SO_NOSIGPIPE`
-- `3866433` FIX: Use correct number of bits in timer precision on MacOSX
-- `b6a1dfe` FIX: Squash OpenSSL deprecated warnings on MacOSX (Bogdan Padalko)
-- `7a217d5` FIX: Incorrect `assert()` in `wait_frame_inner()`
-- `7942af3` FIX: Correctly handle 0-length table in `amqp_table_clone()`
-- `157788e` FIX: Correctly handle 0-length strings in `amqp_basic_properties_clone()`
-- `4eaf771` FIX: Correctly handle 0-length message body in `amqp_read_message()`
-- `59f943b` FIX: Double-free SSL on connection failure
-- `7a451a4` FIX: `amqp_open_socket()` not defined

ext/librabbitmq/LICENSE-MIT

@@ -1,28 +0,0 @@
-Portions created by Alan Antonuk are Copyright (c) 2012-2013
-Alan Antonuk. All Rights Reserved.
-
-Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
-All Rights Reserved.
-
-Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
-VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
-
-Permission is hereby granted, free of charge, to any person
-obtaining a copy of this software and associated documentation
-files (the "Software"), to deal in the Software without
-restriction, including without limitation the rights to use, copy,
-modify, merge, publish, distribute, sublicense, and/or sell copies
-of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
-BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
-ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
-CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.

ext/librabbitmq/README.md

@@ -1,128 +0,0 @@
-# RabbitMQ C AMQP client library
-
-[![Build Status](https://secure.travis-ci.org/alanxz/rabbitmq-c.png?branch=master)](http://travis-ci.org/alanxz/rabbitmq-c)
-
-[![Coverage Status](https://coveralls.io/repos/github/alanxz/rabbitmq-c/badge.svg?branch=master)](https://coveralls.io/github/alanxz/rabbitmq-c?branch=master)
-
-## Introduction
-
-This is a C-language AMQP client library for use with v2.0+ of the
-[RabbitMQ](http://www.rabbitmq.com/) broker.
-
- - <http://github.com/alanxz/rabbitmq-c>
-
-Announcements regarding the library are periodically made on the
-rabbitmq-c-users and cross-posted to rabbitmq-users.
-
- - <https://groups.google.com/forum/#!forum/rabbitmq-c-users>
- - <https://groups.google.com/forum/#!forum/rabbitmq-users>
-
-## Latest Stable Version
-
-The latest stable release of rabbitmq-c can be found at:
-
- - <https://github.com/alanxz/rabbitmq-c/releases/latest>
-
-## Documentation
-
-API documentation for v0.8.0+ can viewed from:
-
-<http://alanxz.github.io/rabbitmq-c/docs/0.8.0/>
-
-## Getting started
-
-### Building and installing
-
-#### Prereqs:
-- [CMake v2.6 or better](http://www.cmake.org/)
-- A C compiler (GCC 4.4+, clang, and MSVC are test. Other compilers may also
-  work)
-- *Optionally* [OpenSSL](http://www.openssl.org/) v0.9.8+ to enable support for
-  connecting to RabbitMQ over SSL/TLS
-- *Optionally* [POpt](http://freecode.com/projects/popt) to build some handy
-  command-line tools.
-- *Optionally* [XmlTo](https://fedorahosted.org/xmlto/) to build man pages for
-  the handy command-line tools
-- *Optionally* [Doxygen](http://www.stack.nl/~dimitri/doxygen/) to build
-  developer API documentation.
-
-After downloading and extracting the source from a tarball to a directory
-([see above](#latest-stable-version)), the commands to build rabbitmq-c on most
-systems are:
-
-    mkdir build && cd build
-    cmake ..
-    cmake --build [--config Release] .
-
-The --config Release flag should be used in multi-configuration generators e.g.,
-Visual Studio or XCode.
-
-It is also possible to point the CMake GUI tool at the CMakeLists.txt in the root of
-the source tree and generate build projects or IDE workspace
-
-Installing the library and optionally specifying a prefix can be done with:
-
-    cmake -DCMAKE_INSTALL_PREFIX=/usr/local ..
-    cmake --build . [--config Release] --target install
-
-More information on CMake can be found on its FAQ (http://www.cmake.org/Wiki/CMake_FAQ)
-
-Other interesting flags that can be passed to CMake:
-
-* `BUILD_EXAMPLES=ON/OFF` toggles building the examples. ON by default.
-* `BUILD_SHARED_LIBS=ON/OFF` toggles building rabbitmq-c as a shared library.
-   ON by default.
-* `BUILD_STATIC_LIBS=ON/OFF` toggles building rabbitmq-c as a static library.
-   OFF by default.
-* `BUILD_TESTS=ON/OFF` toggles building test code. ON by default.
-* `BUILD_TOOLS=ON/OFF` toggles building the command line tools. By default
-   this is ON if the build system can find the POpt header and library.
-* `BUILD_TOOLS_DOCS=ON/OFF` toggles building the man pages for the command line
-   tools. By default this is ON if BUILD_TOOLS is ON and the build system can
-   find the XmlTo utility.
-* `ENABLE_SSL_SUPPORT=ON/OFF` toggles building rabbitmq-c with SSL support. By
-   default this is ON if the OpenSSL headers and library can be found.
-* `BUILD_API_DOCS=ON/OFF` - toggles building the Doxygen API documentation, by
-   default this is OFF
-
-## Running the examples
-
-Arrange for a RabbitMQ or other AMQP server to be running on
-`localhost` at TCP port number 5672.
-
-In one terminal, run
-
-    ./examples/amqp_listen localhost 5672 amq.direct test
-
-In another terminal,
-
-    ./examples/amqp_sendstring localhost 5672 amq.direct test "hello world"
-
-You should see output similar to the following in the listener's
-terminal window:
-
-    Delivery 1, exchange amq.direct routingkey test
-    Content-type: text/plain
-    ----
-    00000000: 68 65 6C 6C 6F 20 77 6F : 72 6C 64                 hello world
-    0000000B:
-
-## Writing applications using `librabbitmq`
-
-Please see the `examples` directory for short examples of the use of
-the `librabbitmq` library.
-
-### Threading
-
-You cannot share a socket, an `amqp_connection_state_t`, or a channel
-between threads using `librabbitmq`. The `librabbitmq` library is
-built with event-driven, single-threaded applications in mind, and
-does not yet cater to any of the requirements of `pthread`ed
-applications.
-
-Your applications instead should open an AMQP connection (and an
-associated socket, of course) per thread. If your program needs to
-access an AMQP connection or any of its channels from more than one
-thread, it is entirely responsible for designing and implementing an
-appropriate locking scheme. It will generally be much simpler to have
-a connection exclusive to each thread that needs AMQP service.

ext/librabbitmq/THANKS

@@ -1,8 +0,0 @@
-Thank-you to the following people for their contributions to the
-codebase:
-
- - Scott Brooks / Epic Advertising <[email protected]>
-
- - Frank Gönninger <[email protected]>
-
- - Daniel Schauenberg <[email protected]>

ext/librabbitmq/TODO

@@ -1,9 +0,0 @@
-Deal with version-mismatch-header received from the server
-
-Cope with unknown frame types better. Currently it gets horribly
-confused about frame lengths.
-
-Make client brutal by default, killing the program on any amqp
-error. Only if the user disables this behaviour will the user get to
-deal with error conditions themselves. Make use of amqp_rpc_reply
-consistent (i.e. universal), and rename it something like amqp_errno.

ext/librabbitmq/appveyor.yml

@@ -1,34 +0,0 @@
-# appveyor configuration
-version: '{build}'
-
-# Limit history cloned. This matches what travis-CI currently does.
-clone_depth: 50
-
-environment:
-  matrix:
-    - GENERATOR: Visual Studio 12 Win64
-      BITS: 64
-    - GENERATOR: Visual Studio 12
-      BITS: 32
-
-cache:
-  - c:\deps -> appveyor.yml
-  
-# borrowed from https://github.com/FreeTDS/freetds
-install:
-  # xidel (xpath command line tool)
-  - appveyor DownloadFile "https://downloads.sourceforge.net/project/videlibri/Xidel/Xidel 0.9.6/xidel-0.9.6.win32.zip"
-  - 7z x xidel-0.9.6.win32.zip xidel.exe
-  # detect version of Windows OpenSSL binaries published by the Shining Light Productions crew
-  - xidel https://slproweb.com/products/Win32OpenSSL.html --extract "(//td/a[starts-with(@href, '/download') and starts-with(text(), 'Win32 OpenSSL') and ends-with(text(), 'Light')])[1]/translate(substring-before(substring-after(text(), 'Win32 OpenSSL v'), ' Light'), '.', '_')" > openssl_ver.txt
-  - set /P OPENSSL_VER=< openssl_ver.txt
-  # OpenSSL
-  - appveyor DownloadFile https://slproweb.com/download/Win%BITS%OpenSSL-%OPENSSL_VER%.exe	
-  - "Win%BITS%OpenSSL-%OPENSSL_VER%.exe /SP- /SILENT /SUPPRESSMSGBOXES /NORESTART"
-
-before_build:
-  - cmake -DBUILD_SHARED_LIBS=ON -DBUILD_STATIC_LIBS=ON -DBUILD_TESTS=ON -DENABLE_SSL_SUPPORT=True -G"%GENERATOR%" .
-
-build:
-  project: ALL_BUILD.vcxproj
-  verbosity: normal

ext/librabbitmq/cmake/CMakePushCheckState.cmake

@@ -1,103 +0,0 @@
-# This module defines two macros:
-# CMAKE_PUSH_CHECK_STATE()
-# and
-# CMAKE_POP_CHECK_STATE()
-# These two macros can be used to save and restore the state of the variables
-# CMAKE_REQUIRED_FLAGS, CMAKE_REQUIRED_DEFINITIONS, CMAKE_REQUIRED_LIBRARIES
-# and CMAKE_REQUIRED_INCLUDES used by the various Check-files coming with CMake,
-# like e.g. check_function_exists() etc.
-# The variable contents are pushed on a stack, pushing multiple times is supported.
-# This is useful e.g. when executing such tests in a Find-module, where they have to be set,
-# but after the Find-module has been executed they should have the same value
-# as they had before.
-#
-# Usage:
-#   cmake_push_check_state()
-#   set(CMAKE_REQUIRED_DEFINITIONS ${CMAKE_REQUIRED_DEFINITIONS} -DSOME_MORE_DEF)
-#   check_function_exists(...)
-#   cmake_pop_check_state()
-
-#=============================================================================
-# Copyright 2006-2011 Alexander Neundorf, <[email protected]>
-#
-# Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions
-# are met:
-# 
-# * Redistributions of source code must retain the above copyright
-#   notice, this list of conditions and the following disclaimer.
-# 
-# * Redistributions in binary form must reproduce the above copyright
-#   notice, this list of conditions and the following disclaimer in the
-#   documentation and/or other materials provided with the distribution.
-# 
-# * Neither the names of Kitware, Inc., the Insight Software Consortium,
-#   nor the names of their contributors may be used to endorse or promote
-#   products derived from this software without specific prior written
-#   permission.
-# 
-# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-# HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-# 
-# ------------------------------------------------------------------------------
-# 
-# The above copyright and license notice applies to distributions of
-# CMake in source and binary form.  Some source files contain additional
-# notices of original copyright by their contributors; see each source
-# for details.  Third-party software packages supplied with CMake under
-# compatible licenses provide their own copyright notices documented in
-# corresponding subdirectories.
-# 
-# ------------------------------------------------------------------------------
-# 
-# CMake was initially developed by Kitware with the following sponsorship:
-# 
-#  * National Library of Medicine at the National Institutes of Health
-#    as part of the Insight Segmentation and Registration Toolkit (ITK).
-# 
-#  * US National Labs (Los Alamos, Livermore, Sandia) ASC Parallel
-#    Visualization Initiative.
-# 
-#  * National Alliance for Medical Image Computing (NAMIC) is funded by the
-#    National Institutes of Health through the NIH Roadmap for Medical Research,
-#    Grant U54 EB005149.
-# 
-#  * Kitware, Inc.
-
-macro(CMAKE_PUSH_CHECK_STATE)
-
-   if(NOT DEFINED _CMAKE_PUSH_CHECK_STATE_COUNTER)
-      set(_CMAKE_PUSH_CHECK_STATE_COUNTER 0)
-   endif()
-
-   math(EXPR _CMAKE_PUSH_CHECK_STATE_COUNTER "${_CMAKE_PUSH_CHECK_STATE_COUNTER}+1")
-
-   set(_CMAKE_REQUIRED_INCLUDES_SAVE_${_CMAKE_PUSH_CHECK_STATE_COUNTER}    ${CMAKE_REQUIRED_INCLUDES})
-   set(_CMAKE_REQUIRED_DEFINITIONS_SAVE_${_CMAKE_PUSH_CHECK_STATE_COUNTER} ${CMAKE_REQUIRED_DEFINITIONS})
-   set(_CMAKE_REQUIRED_LIBRARIES_SAVE_${_CMAKE_PUSH_CHECK_STATE_COUNTER}   ${CMAKE_REQUIRED_LIBRARIES})
-   set(_CMAKE_REQUIRED_FLAGS_SAVE_${_CMAKE_PUSH_CHECK_STATE_COUNTER}       ${CMAKE_REQUIRED_FLAGS})
-endmacro()
-
-macro(CMAKE_POP_CHECK_STATE)
-
-# don't pop more than we pushed
-   if("${_CMAKE_PUSH_CHECK_STATE_COUNTER}" GREATER "0")
-
-      set(CMAKE_REQUIRED_INCLUDES    ${_CMAKE_REQUIRED_INCLUDES_SAVE_${_CMAKE_PUSH_CHECK_STATE_COUNTER}})
-      set(CMAKE_REQUIRED_DEFINITIONS ${_CMAKE_REQUIRED_DEFINITIONS_SAVE_${_CMAKE_PUSH_CHECK_STATE_COUNTER}})
-      set(CMAKE_REQUIRED_LIBRARIES   ${_CMAKE_REQUIRED_LIBRARIES_SAVE_${_CMAKE_PUSH_CHECK_STATE_COUNTER}})
-      set(CMAKE_REQUIRED_FLAGS       ${_CMAKE_REQUIRED_FLAGS_SAVE_${_CMAKE_PUSH_CHECK_STATE_COUNTER}})
-
-      math(EXPR _CMAKE_PUSH_CHECK_STATE_COUNTER "${_CMAKE_PUSH_CHECK_STATE_COUNTER}-1")
-   endif()
-
-endmacro()

ext/librabbitmq/cmake/COPYING-CMAKE-SCRIPTS

@@ -1,22 +0,0 @@
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
-
-1. Redistributions of source code must retain the copyright
-   notice, this list of conditions and the following disclaimer.
-2. Redistributions in binary form must reproduce the copyright
-   notice, this list of conditions and the following disclaimer in the
-   documentation and/or other materials provided with the distribution.
-3. The name of the author may not be used to endorse or promote products
-   derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
-IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
-OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
-IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
-INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
-NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

ext/librabbitmq/cmake/FindPOPT.cmake

@@ -1,39 +0,0 @@
-# - Try to find the popt options processing library
-# The module will set the following variables
-#
-#  POPT_FOUND - System has popt
-#  POPT_INCLUDE_DIR - The popt include directory
-#  POPT_LIBRARY - The libraries needed to use popt
-
-# use pkg-config to get the directories and then use these values
-# in the FIND_PATH() and FIND_LIBRARY() calls
-
-find_package(PkgConfig QUIET)
-if (PKG_CONFIG_FOUND)
-  pkg_search_module(PC_POPT QUIET popt)
-endif ()
-
-# Find the include directories
-FIND_PATH(POPT_INCLUDE_DIR
-    NAMES popt.h
-    HINTS
-          ${PC_POPT_INCLUDEDIR}
-          ${PC_POPT_INCLUDE_DIRS}
-    DOC "Path containing the popt.h include file"
-    )
-
-FIND_LIBRARY(POPT_LIBRARY
-    NAMES popt
-    HINTS
-          ${PC_POPT_LIBRARYDIR}
-          ${PC_POPT_LIBRARY_DIRS}
-    DOC "popt library path"
-    )
-
-include(FindPackageHandleStandardArgs)
-
-FIND_PACKAGE_HANDLE_STANDARD_ARGS(POPT
-  REQUIRED_VARS POPT_INCLUDE_DIR POPT_LIBRARY
-  VERSION_VAR PC_POPT_VERSION)
-
-MARK_AS_ADVANCED(POPT_INCLUDE_DIR POPT_LIBRARY)

ext/librabbitmq/cmake/FindXmlTo.cmake

@@ -1,98 +0,0 @@
-# - Convert XML docBook files to various formats
-# This will convert XML docBook files to various formats like:
-# man html txt dvi ps pdf
-#  macro XMLTO(outfiles infiles... MODES modes...)
-
-find_program ( XMLTO_EXECUTABLE
-  NAMES xmlto
-  DOC   "path to the xmlto docbook xslt frontend"  
-)
-
-
-include(FindPackageHandleStandardArgs)
-FIND_PACKAGE_HANDLE_STANDARD_ARGS(XMLTO
-  REQUIRED_VARS XMLTO_EXECUTABLE)
-
-mark_as_advanced( XMLTO_EXECUTABLE )
-
-macro ( _XMLTO_FILE outfiles mode)
-  #special settings
-  set ( XMLTO_FILEEXT_man 1 )
-  set ( XMLTO_MODE_html xhtml-nochunks )
-
-  if ( NOT XMLTO_MODE_${mode})
-    set ( XMLTO_MODE_${mode} ${mode} )
-  endif ( NOT XMLTO_MODE_${mode} )
-  if ( NOT XMLTO_FILEEXT_${mode} )
-    set ( XMLTO_FILEEXT_${mode} ${mode} )
-  endif ( NOT XMLTO_FILEEXT_${mode} )
-
-  foreach ( dbFile ${ARGN} )
-    #TODO: set XMLTO_FILEEXT_man to value from <manvolnum>
-    if ( "${mode}" STREQUAL "man" )
-      file ( READ "${dbFile}" _DB_FILE_CONTENTS )
-      string ( REGEX MATCH "<manvolnum>[^<]*" XMLTO_FILEEXT_${mode} "${_DB_FILE_CONTENTS}" )
-      string ( REGEX REPLACE "^<manvolnum>" "" XMLTO_FILEEXT_${mode} "${XMLTO_FILEEXT_${mode}}" )
-      string ( REGEX REPLACE "[[:space:]]" "" XMLTO_FILEEXT_${mode} "${XMLTO_FILEEXT_${mode}}" )
-    endif ( "${mode}" STREQUAL "man" )
-
-    get_filename_component ( dbFilePath ${CMAKE_CURRENT_BINARY_DIR}/${dbFile} PATH )
-    get_filename_component ( dbFileWE ${dbFile} NAME_WE )
-    get_filename_component ( dbFileAbsWE ${dbFilePath}/${dbFileWE} ABSOLUTE )
-
-    add_custom_command (
-      OUTPUT            ${dbFileAbsWE}.${XMLTO_FILEEXT_${mode}}
-      COMMAND           ${XMLTO_EXECUTABLE} ${XMLTO_COMMAND_ARGS} -o ${dbFilePath}
-                        ${XMLTO_MODE_${mode}} "${CMAKE_CURRENT_SOURCE_DIR}/${dbFile}"
-      MAIN_DEPENDENCY   ${CMAKE_CURRENT_SOURCE_DIR}/${dbFile}
-      DEPENDS           ${XMLTO_DEPENDS}
-      VERBATIM
-    )
-
-    set ( ${outfiles}
-      ${${outfiles}}
-      ${dbFileAbsWE}.${XMLTO_FILEEXT_${mode}}
-    )
-  endforeach ( dbFile )
-endmacro ( _XMLTO_FILE outfiles )
-
-macro ( XMLTO )
-  set ( XMLTO_MODES )
-  set ( XMLTO_FILES )
-  set ( XMLTO_HAS_MODES false )
-  set ( XMLTO_ADD_DEFAULT false )
-  foreach ( arg ${ARGN} )
-    if ( ${arg} STREQUAL "MODES" )
-      set ( XMLTO_HAS_MODES true )
-    elseif ( ${arg} STREQUAL "ALL" )
-      set ( XMLTO_ADD_DEFAULT true )
-    else ( ${arg} STREQUAL "MODES" )
-      if ( XMLTO_HAS_MODES )
-  set ( XMLTO_MODES ${XMLTO_MODES} ${arg} )
-      else ( XMLTO_HAS_MODES )    
-  set ( XMLTO_FILES ${XMLTO_FILES} ${arg} )
-      endif ( XMLTO_HAS_MODES )
-    endif ( ${arg} STREQUAL "MODES" )
-  endforeach ( arg ${ARGN} )
-  if ( NOT XMLTO_MODES )
-    set ( XMLTO_MODES html )
-  endif ( NOT XMLTO_MODES )
-
-  foreach ( mode ${XMLTO_MODES} )
-    _xmlto_file ( XMLTO_FILES_${mode} ${mode} ${XMLTO_FILES} )
-    if ( XMLTO_ADD_DEFAULT )
-      add_custom_target ( ${mode} ALL
-  DEPENDS ${XMLTO_FILES_${mode}}
-  VERBATIM
-      )
-    else ( XMLTO_ADD_DEFAULT )
-      add_custom_target ( ${mode}
-  DEPENDS ${XMLTO_FILES_${mode}}
-  VERBATIM
-      )
-    endif ( XMLTO_ADD_DEFAULT )
-  endforeach ( mode )
-
-  set ( XMLTO_MODES )
-  set ( XMLTO_FILES )
-endmacro ( XMLTO )

ext/librabbitmq/cmake/GNUInstallDirs.cmake

@@ -1,205 +0,0 @@
-#.rst:
-# GNUInstallDirs
-# --------------
-#
-# Define GNU standard installation directories
-#
-# Provides install directory variables as defined for GNU software:
-#
-# ::
-#
-#   http://www.gnu.org/prep/standards/html_node/Directory-Variables.html
-#
-# Inclusion of this module defines the following variables:
-#
-# ::
-#
-#   CMAKE_INSTALL_<dir>      - destination for files of a given type
-#   CMAKE_INSTALL_FULL_<dir> - corresponding absolute path
-#
-# where <dir> is one of:
-#
-# ::
-#
-#   BINDIR           - user executables (bin)
-#   SBINDIR          - system admin executables (sbin)
-#   LIBEXECDIR       - program executables (libexec)
-#   SYSCONFDIR       - read-only single-machine data (etc)
-#   SHAREDSTATEDIR   - modifiable architecture-independent data (com)
-#   LOCALSTATEDIR    - modifiable single-machine data (var)
-#   LIBDIR           - object code libraries (lib or lib64 or lib/<multiarch-tuple> on Debian)
-#   INCLUDEDIR       - C header files (include)
-#   OLDINCLUDEDIR    - C header files for non-gcc (/usr/include)
-#   DATAROOTDIR      - read-only architecture-independent data root (share)
-#   DATADIR          - read-only architecture-independent data (DATAROOTDIR)
-#   INFODIR          - info documentation (DATAROOTDIR/info)
-#   LOCALEDIR        - locale-dependent data (DATAROOTDIR/locale)
-#   MANDIR           - man documentation (DATAROOTDIR/man)
-#   DOCDIR           - documentation root (DATAROOTDIR/doc/PROJECT_NAME)
-#
-# Each CMAKE_INSTALL_<dir> value may be passed to the DESTINATION
-# options of install() commands for the corresponding file type.  If the
-# includer does not define a value the above-shown default will be used
-# and the value will appear in the cache for editing by the user.  Each
-# CMAKE_INSTALL_FULL_<dir> value contains an absolute path constructed
-# from the corresponding destination by prepending (if necessary) the
-# value of CMAKE_INSTALL_PREFIX.
-
-#=============================================================================
-# Copyright 2011 Nikita Krupen'ko <[email protected]>
-# Copyright 2011 Kitware, Inc.
-#
-# Distributed under the OSI-approved BSD License (the "License");
-# see accompanying file Copyright.txt for details.
-#
-# This software is distributed WITHOUT ANY WARRANTY; without even the
-# implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-# See the License for more information.
-#=============================================================================
-# (To distribute this file outside of CMake, substitute the full
-#  License text for the above reference.)
-
-# Installation directories
-#
-if(NOT DEFINED CMAKE_INSTALL_BINDIR)
-  set(CMAKE_INSTALL_BINDIR "bin" CACHE PATH "user executables (bin)")
-endif()
-
-if(NOT DEFINED CMAKE_INSTALL_SBINDIR)
-  set(CMAKE_INSTALL_SBINDIR "sbin" CACHE PATH "system admin executables (sbin)")
-endif()
-
-if(NOT DEFINED CMAKE_INSTALL_LIBEXECDIR)
-  set(CMAKE_INSTALL_LIBEXECDIR "libexec" CACHE PATH "program executables (libexec)")
-endif()
-
-if(NOT DEFINED CMAKE_INSTALL_SYSCONFDIR)
-  set(CMAKE_INSTALL_SYSCONFDIR "etc" CACHE PATH "read-only single-machine data (etc)")
-endif()
-
-if(NOT DEFINED CMAKE_INSTALL_SHAREDSTATEDIR)
-  set(CMAKE_INSTALL_SHAREDSTATEDIR "com" CACHE PATH "modifiable architecture-independent data (com)")
-endif()
-
-if(NOT DEFINED CMAKE_INSTALL_LOCALSTATEDIR)
-  set(CMAKE_INSTALL_LOCALSTATEDIR "var" CACHE PATH "modifiable single-machine data (var)")
-endif()
-
-if(NOT DEFINED CMAKE_INSTALL_LIBDIR)
-  set(_LIBDIR_DEFAULT "lib")
-  # Override this default 'lib' with 'lib64' iff:
-  #  - we are on Linux system but NOT cross-compiling
-  #  - we are NOT on debian
-  #  - we are on a 64 bits system
-  # reason is: amd64 ABI: http://www.x86-64.org/documentation/abi.pdf
-  # For Debian with multiarch, use 'lib/${CMAKE_LIBRARY_ARCHITECTURE}' if
-  # CMAKE_LIBRARY_ARCHITECTURE is set (which contains e.g. "i386-linux-gnu"
-  # See http://wiki.debian.org/Multiarch
-  if(CMAKE_SYSTEM_NAME MATCHES "Linux"
-      AND NOT CMAKE_CROSSCOMPILING)
-    if (EXISTS "/etc/debian_version") # is this a debian system ?
-       if(CMAKE_LIBRARY_ARCHITECTURE)
-         set(_LIBDIR_DEFAULT "lib/${CMAKE_LIBRARY_ARCHITECTURE}")
-       endif()
-    else() # not debian, rely on CMAKE_SIZEOF_VOID_P:
-      if(NOT DEFINED CMAKE_SIZEOF_VOID_P)
-        message(AUTHOR_WARNING
-          "Unable to determine default CMAKE_INSTALL_LIBDIR directory because no target architecture is known. "
-          "Please enable at least one language before including GNUInstallDirs.")
-      else()
-        if("${CMAKE_SIZEOF_VOID_P}" EQUAL "8")
-          set(_LIBDIR_DEFAULT "lib64")
-        endif()
-      endif()
-    endif()
-  endif()
-  set(CMAKE_INSTALL_LIBDIR "${_LIBDIR_DEFAULT}" CACHE PATH "object code libraries (${_LIBDIR_DEFAULT})")
-endif()
-
-if(NOT DEFINED CMAKE_INSTALL_INCLUDEDIR)
-  set(CMAKE_INSTALL_INCLUDEDIR "include" CACHE PATH "C header files (include)")
-endif()
-
-if(NOT DEFINED CMAKE_INSTALL_OLDINCLUDEDIR)
-  set(CMAKE_INSTALL_OLDINCLUDEDIR "/usr/include" CACHE PATH "C header files for non-gcc (/usr/include)")
-endif()
-
-if(NOT DEFINED CMAKE_INSTALL_DATAROOTDIR)
-  set(CMAKE_INSTALL_DATAROOTDIR "share" CACHE PATH "read-only architecture-independent data root (share)")
-endif()
-
-#-----------------------------------------------------------------------------
-# Values whose defaults are relative to DATAROOTDIR.  Store empty values in
-# the cache and store the defaults in local variables if the cache values are
-# not set explicitly.  This auto-updates the defaults as DATAROOTDIR changes.
-
-if(NOT CMAKE_INSTALL_DATADIR)
-  set(CMAKE_INSTALL_DATADIR "" CACHE PATH "read-only architecture-independent data (DATAROOTDIR)")
-  set(CMAKE_INSTALL_DATADIR "${CMAKE_INSTALL_DATAROOTDIR}")
-endif()
-
-if(NOT CMAKE_INSTALL_INFODIR)
-  set(CMAKE_INSTALL_INFODIR "" CACHE PATH "info documentation (DATAROOTDIR/info)")
-  set(CMAKE_INSTALL_INFODIR "${CMAKE_INSTALL_DATAROOTDIR}/info")
-endif()
-
-if(NOT CMAKE_INSTALL_LOCALEDIR)
-  set(CMAKE_INSTALL_LOCALEDIR "" CACHE PATH "locale-dependent data (DATAROOTDIR/locale)")
-  set(CMAKE_INSTALL_LOCALEDIR "${CMAKE_INSTALL_DATAROOTDIR}/locale")
-endif()
-
-if(NOT CMAKE_INSTALL_MANDIR)
-  set(CMAKE_INSTALL_MANDIR "" CACHE PATH "man documentation (DATAROOTDIR/man)")
-  set(CMAKE_INSTALL_MANDIR "${CMAKE_INSTALL_DATAROOTDIR}/man")
-endif()
-
-if(NOT CMAKE_INSTALL_DOCDIR)
-  set(CMAKE_INSTALL_DOCDIR "" CACHE PATH "documentation root (DATAROOTDIR/doc/PROJECT_NAME)")
-  set(CMAKE_INSTALL_DOCDIR "${CMAKE_INSTALL_DATAROOTDIR}/doc/${PROJECT_NAME}")
-endif()
-
-#-----------------------------------------------------------------------------
-
-mark_as_advanced(
-  CMAKE_INSTALL_BINDIR
-  CMAKE_INSTALL_SBINDIR
-  CMAKE_INSTALL_LIBEXECDIR
-  CMAKE_INSTALL_SYSCONFDIR
-  CMAKE_INSTALL_SHAREDSTATEDIR
-  CMAKE_INSTALL_LOCALSTATEDIR
-  CMAKE_INSTALL_LIBDIR
-  CMAKE_INSTALL_INCLUDEDIR
-  CMAKE_INSTALL_OLDINCLUDEDIR
-  CMAKE_INSTALL_DATAROOTDIR
-  CMAKE_INSTALL_DATADIR
-  CMAKE_INSTALL_INFODIR
-  CMAKE_INSTALL_LOCALEDIR
-  CMAKE_INSTALL_MANDIR
-  CMAKE_INSTALL_DOCDIR
-  )
-
-# Result directories
-#
-foreach(dir
-    BINDIR
-    SBINDIR
-    LIBEXECDIR
-    SYSCONFDIR
-    SHAREDSTATEDIR
-    LOCALSTATEDIR
-    LIBDIR
-    INCLUDEDIR
-    OLDINCLUDEDIR
-    DATAROOTDIR
-    DATADIR
-    INFODIR
-    LOCALEDIR
-    MANDIR
-    DOCDIR
-    )
-  if(NOT IS_ABSOLUTE ${CMAKE_INSTALL_${dir}})
-    set(CMAKE_INSTALL_FULL_${dir} "${CMAKE_INSTALL_PREFIX}/${CMAKE_INSTALL_${dir}}")
-  else()
-    set(CMAKE_INSTALL_FULL_${dir} "${CMAKE_INSTALL_${dir}}")
-  endif()
-endforeach()

ext/librabbitmq/cmake/TestCInline.cmake

@@ -1,28 +0,0 @@
-#Inspired from http://www.cmake.org/Wiki/CMakeTestInline
-
-IF(NOT DEFINED C_INLINE_KEYWORD)
-
-  SET(INLINE_TEST_SRC "/* Inspired by autoconf's c.m4 */
-static inline int static_foo() {return 0\;}
-int main(int argc, char *argv[]){return 0\;}
-")
-
-  FILE(WRITE ${CMAKE_CURRENT_BINARY_DIR}/CMakeTestCInline.c ${INLINE_TEST_SRC})
-
-  FOREACH(KEYWORD "inline" "__inline__" "__inline")
-    IF(NOT DEFINED C_INLINE)
-      TRY_COMPILE(C_HAS_${KEYWORD}
-        ${CMAKE_CURRENT_BINARY_DIR}
-        ${CMAKE_CURRENT_BINARY_DIR}/CMakeTestCInline.c
-        COMPILE_DEFINITIONS "-Dinline=${KEYWORD}"
-        )
-      IF(C_HAS_${KEYWORD})
-        SET(C_INLINE ${KEYWORD})
-      ENDIF(C_HAS_${KEYWORD})
-    ENDIF(NOT DEFINED C_INLINE)
-  ENDFOREACH(KEYWORD)
-
-  SET(C_INLINE_KEYWORD ${C_INLINE} CACHE INTERNAL "The keyword needed by the C compiler to inline a function" FORCE)
-  message(STATUS "Found C inline keyword: ${C_INLINE_KEYWORD}")
-
-ENDIF(NOT DEFINED C_INLINE_KEYWORD)

ext/librabbitmq/cmake/config.h.in

@@ -1,14 +0,0 @@
-#ifndef CONFIG_H
-#define CONFIG_H
-
-#ifndef __cplusplus
-# define inline ${C_INLINE_KEYWORD}
-#endif
-
-#cmakedefine HAVE_SELECT
-
-#cmakedefine HAVE_POLL
-
-#define AMQ_PLATFORM "@CMAKE_SYSTEM@"
-
-#endif /* CONFIG_H */

ext/librabbitmq/coverity/model.c

@@ -1,17 +0,0 @@
-/* Functions to help coverity do static analysis on rabbitmq-c */
-
-typedef struct {
-} amqp_rpc_reply_t;
-
-/* librabbitmq/amqp_private.h */
-void amqp_abort(const char* fmt, ...) { __coverity_panic__(); }
-
-/* tools/common.h */
-void die(const char* fmt, ...) { __coverity_panic__(); }
-void die_errno(int err, const char* fmt, ...) { __coverity_panic__(); }
-void die_amqp_error(int err, const char* fmt, ...) { __coverity_panic__(); }
-void die_rpc(amqp_rpc_reply_t r, const char* fmt, ...) { __coverity_panic__(); }
-
-/* examples/utils.h */
-void die_on_amqp_error(amqp_rpc_reply_t* r) { __coverity_panic__(); }
-void die_on_error(int r) { __coverity_panic__(); }

ext/librabbitmq/docs/Doxyfile.in

@@ -1,317 +0,0 @@
-# Doxyfile 1.8.4
-
-#---------------------------------------------------------------------------
-# Project related configuration options
-#---------------------------------------------------------------------------
-DOXYFILE_ENCODING      = UTF-8
-PROJECT_NAME           = rabbitmq-c
-PROJECT_NUMBER         = @VERSION@
-PROJECT_BRIEF          = "C AMQP Client library for RabbitMQ"
-PROJECT_LOGO           =
-OUTPUT_DIRECTORY       = .
-CREATE_SUBDIRS         = NO
-OUTPUT_LANGUAGE        = English
-BRIEF_MEMBER_DESC      = YES
-REPEAT_BRIEF           = YES
-ABBREVIATE_BRIEF       =
-ALWAYS_DETAILED_SEC    = NO
-INLINE_INHERITED_MEMB  = NO
-FULL_PATH_NAMES        = NO
-STRIP_FROM_PATH        =
-STRIP_FROM_INC_PATH    =
-SHORT_NAMES            = NO
-JAVADOC_AUTOBRIEF      = YES
-QT_AUTOBRIEF           = NO
-MULTILINE_CPP_IS_BRIEF = NO
-INHERIT_DOCS           = YES
-SEPARATE_MEMBER_PAGES  = NO
-TAB_SIZE               = 2
-ALIASES                =
-TCL_SUBST              =
-OPTIMIZE_OUTPUT_FOR_C  = YES
-OPTIMIZE_OUTPUT_JAVA   = NO
-OPTIMIZE_FOR_FORTRAN   = NO
-OPTIMIZE_OUTPUT_VHDL   = NO
-EXTENSION_MAPPING      =
-MARKDOWN_SUPPORT       = YES
-AUTOLINK_SUPPORT       = YES
-BUILTIN_STL_SUPPORT    = NO
-CPP_CLI_SUPPORT        = NO
-SIP_SUPPORT            = NO
-IDL_PROPERTY_SUPPORT   = YES
-DISTRIBUTE_GROUP_DOC   = NO
-SUBGROUPING            = YES
-INLINE_GROUPED_CLASSES = NO
-INLINE_SIMPLE_STRUCTS  = NO
-TYPEDEF_HIDES_STRUCT   = YES
-LOOKUP_CACHE_SIZE      = 0
-#---------------------------------------------------------------------------
-# Build related configuration options
-#---------------------------------------------------------------------------
-EXTRACT_ALL            = NO
-EXTRACT_PRIVATE        = NO
-EXTRACT_PACKAGE        = NO
-EXTRACT_STATIC         = NO
-EXTRACT_LOCAL_CLASSES  = YES
-EXTRACT_LOCAL_METHODS  = NO
-EXTRACT_ANON_NSPACES   = NO
-HIDE_UNDOC_MEMBERS     = NO
-HIDE_UNDOC_CLASSES     = NO
-HIDE_FRIEND_COMPOUNDS  = NO
-HIDE_IN_BODY_DOCS      = NO
-INTERNAL_DOCS          = NO
-CASE_SENSE_NAMES       = NO
-HIDE_SCOPE_NAMES       = NO
-SHOW_INCLUDE_FILES     = NO
-FORCE_LOCAL_INCLUDES   = NO
-INLINE_INFO            = YES
-SORT_MEMBER_DOCS       = YES
-SORT_BRIEF_DOCS        = NO
-SORT_MEMBERS_CTORS_1ST = NO
-SORT_GROUP_NAMES       = NO
-SORT_BY_SCOPE_NAME     = NO
-STRICT_PROTO_MATCHING  = NO
-GENERATE_TODOLIST      = YES
-GENERATE_TESTLIST      = YES
-GENERATE_BUGLIST       = YES
-GENERATE_DEPRECATEDLIST= YES
-ENABLED_SECTIONS       =
-MAX_INITIALIZER_LINES  = 30
-SHOW_USED_FILES        = YES
-SHOW_FILES             = YES
-SHOW_NAMESPACES        = YES
-FILE_VERSION_FILTER    =
-LAYOUT_FILE            =
-CITE_BIB_FILES         =
-#---------------------------------------------------------------------------
-# configuration options related to warning and progress messages
-#---------------------------------------------------------------------------
-QUIET                  = NO
-WARNINGS               = YES
-WARN_IF_UNDOCUMENTED   = YES
-WARN_IF_DOC_ERROR      = YES
-WARN_NO_PARAMDOC       = NO
-WARN_FORMAT            = "$file:$line: $text"
-WARN_LOGFILE           =
-#---------------------------------------------------------------------------
-# configuration options related to the input files
-#---------------------------------------------------------------------------
-INPUT                  = @CMAKE_CURRENT_SOURCE_DIR@/README.md \
-                         @CMAKE_CURRENT_SOURCE_DIR@/ChangeLog.md \
-                         @CMAKE_CURRENT_SOURCE_DIR@/librabbitmq \
-                         @CMAKE_CURRENT_SOURCE_DIR@/docs
-INPUT_ENCODING         = UTF-8
-FILE_PATTERNS          = *.h \
-                         *.md
-RECURSIVE              = NO
-EXCLUDE                =
-EXCLUDE_SYMLINKS       = NO
-EXCLUDE_PATTERNS       = amqp_private.h \
-                         config.h
-EXCLUDE_SYMBOLS        =
-EXAMPLE_PATH           = @CMAKE_CURRENT_SOURCE_DIR@ \
-                         @CMAKE_CURRENT_SOURCE_DIR@/examples
-EXAMPLE_PATTERNS       = *.c \
-                         *.md
-EXAMPLE_RECURSIVE      = NO
-IMAGE_PATH             =
-INPUT_FILTER           =
-FILTER_PATTERNS        =
-FILTER_SOURCE_FILES    = NO
-FILTER_SOURCE_PATTERNS =
-USE_MDFILE_AS_MAINPAGE = README.md
-#---------------------------------------------------------------------------
-# configuration options related to source browsing
-#---------------------------------------------------------------------------
-SOURCE_BROWSER         = NO
-INLINE_SOURCES         = NO
-STRIP_CODE_COMMENTS    = YES
-REFERENCED_BY_RELATION = NO
-REFERENCES_RELATION    = NO
-REFERENCES_LINK_SOURCE = YES
-USE_HTAGS              = NO
-VERBATIM_HEADERS       = YES
-#---------------------------------------------------------------------------
-# configuration options related to the alphabetical class index
-#---------------------------------------------------------------------------
-ALPHABETICAL_INDEX     = YES
-COLS_IN_ALPHA_INDEX    = 5
-IGNORE_PREFIX          = amqp_
-#---------------------------------------------------------------------------
-# configuration options related to the HTML output
-#---------------------------------------------------------------------------
-GENERATE_HTML          = YES
-HTML_OUTPUT            = html
-HTML_FILE_EXTENSION    = .html
-HTML_HEADER            =
-HTML_FOOTER            =
-HTML_STYLESHEET        =
-HTML_EXTRA_STYLESHEET  =
-HTML_EXTRA_FILES       =
-HTML_COLORSTYLE_HUE    = 220
-HTML_COLORSTYLE_SAT    = 100
-HTML_COLORSTYLE_GAMMA  = 80
-HTML_TIMESTAMP         = YES
-HTML_DYNAMIC_SECTIONS  = NO
-HTML_INDEX_NUM_ENTRIES = 100
-GENERATE_DOCSET        = NO
-DOCSET_FEEDNAME        = "Doxygen generated docs"
-DOCSET_BUNDLE_ID       = org.doxygen.Project
-DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
-DOCSET_PUBLISHER_NAME  = Publisher
-GENERATE_HTMLHELP      = NO
-CHM_FILE               =
-HHC_LOCATION           =
-GENERATE_CHI           = NO
-CHM_INDEX_ENCODING     =
-BINARY_TOC             = NO
-TOC_EXPAND             = NO
-GENERATE_QHP           = NO
-QCH_FILE               =
-QHP_NAMESPACE          = org.doxygen.Project
-QHP_VIRTUAL_FOLDER     = doc
-QHP_CUST_FILTER_NAME   =
-QHP_CUST_FILTER_ATTRS  =
-QHP_SECT_FILTER_ATTRS  =
-QHG_LOCATION           =
-GENERATE_ECLIPSEHELP   = NO
-ECLIPSE_DOC_ID         = org.doxygen.Project
-DISABLE_INDEX          = NO
-GENERATE_TREEVIEW      = NO
-ENUM_VALUES_PER_LINE   = 4
-TREEVIEW_WIDTH         = 250
-EXT_LINKS_IN_WINDOW    = NO
-FORMULA_FONTSIZE       = 10
-FORMULA_TRANSPARENT    = YES
-USE_MATHJAX            = NO
-MATHJAX_FORMAT         = HTML-CSS
-MATHJAX_RELPATH        = http://www.mathjax.org/mathjax
-MATHJAX_EXTENSIONS     =
-MATHJAX_CODEFILE       =
-SEARCHENGINE           = YES
-SERVER_BASED_SEARCH    = NO
-EXTERNAL_SEARCH        = NO
-SEARCHENGINE_URL       =
-SEARCHDATA_FILE        = searchdata.xml
-EXTERNAL_SEARCH_ID     =
-EXTRA_SEARCH_MAPPINGS  =
-#---------------------------------------------------------------------------
-# configuration options related to the LaTeX output
-#---------------------------------------------------------------------------
-GENERATE_LATEX         = NO
-LATEX_OUTPUT           = latex
-LATEX_CMD_NAME         = latex
-MAKEINDEX_CMD_NAME     = makeindex
-COMPACT_LATEX          = NO
-PAPER_TYPE             = a4
-EXTRA_PACKAGES         =
-LATEX_HEADER           =
-LATEX_FOOTER           =
-LATEX_EXTRA_FILES      =
-PDF_HYPERLINKS         = YES
-USE_PDFLATEX           = YES
-LATEX_BATCHMODE        = NO
-LATEX_HIDE_INDICES     = NO
-LATEX_SOURCE_CODE      = NO
-LATEX_BIB_STYLE        = plain
-#---------------------------------------------------------------------------
-# configuration options related to the RTF output
-#---------------------------------------------------------------------------
-GENERATE_RTF           = NO
-RTF_OUTPUT             = rtf
-COMPACT_RTF            = NO
-RTF_HYPERLINKS         = NO
-RTF_STYLESHEET_FILE    =
-RTF_EXTENSIONS_FILE    =
-#---------------------------------------------------------------------------
-# configuration options related to the man page output
-#---------------------------------------------------------------------------
-GENERATE_MAN           = NO
-MAN_OUTPUT             = man
-MAN_EXTENSION          = .3
-MAN_LINKS              = NO
-#---------------------------------------------------------------------------
-# configuration options related to the XML output
-#---------------------------------------------------------------------------
-GENERATE_XML           = NO
-XML_OUTPUT             = xml
-XML_SCHEMA             =
-XML_DTD                =
-XML_PROGRAMLISTING     = YES
-#---------------------------------------------------------------------------
-# configuration options related to the DOCBOOK output
-#---------------------------------------------------------------------------
-GENERATE_DOCBOOK       = NO
-DOCBOOK_OUTPUT         = docbook
-#---------------------------------------------------------------------------
-# configuration options for the AutoGen Definitions output
-#---------------------------------------------------------------------------
-GENERATE_AUTOGEN_DEF   = NO
-#---------------------------------------------------------------------------
-# configuration options related to the Perl module output
-#---------------------------------------------------------------------------
-GENERATE_PERLMOD       = NO
-PERLMOD_LATEX          = NO
-PERLMOD_PRETTY         = YES
-PERLMOD_MAKEVAR_PREFIX =
-#---------------------------------------------------------------------------
-# Configuration options related to the preprocessor
-#---------------------------------------------------------------------------
-ENABLE_PREPROCESSING   = YES
-MACRO_EXPANSION        = YES
-EXPAND_ONLY_PREDEF     = NO
-SEARCH_INCLUDES        = YES
-INCLUDE_PATH           = @CMAKE_CURRENT_SOURCE_DIR@/librabbitmq \
-                         @CMAKE_CURRENT_BINARY_DIR@/librabbitmq
-INCLUDE_FILE_PATTERNS  =
-PREDEFINED             = AMQP_BEGIN_DECLS= \
-                         AMQP_END_DECLS= \
-                         AMQP_PUBLIC_FUNCTION= \
-                         AMQP_PUBLIC_VARIABLE= \
-                         AMQP_CALL= \
-                         AMQP_DEPRECATED(x)=x
-EXPAND_AS_DEFINED      =
-SKIP_FUNCTION_MACROS   = YES
-#---------------------------------------------------------------------------
-# Configuration::additions related to external references
-#---------------------------------------------------------------------------
-TAGFILES               =
-GENERATE_TAGFILE       =
-ALLEXTERNALS           = NO
-EXTERNAL_GROUPS        = YES
-EXTERNAL_PAGES         = YES
-PERL_PATH              = /usr/bin/perl
-#---------------------------------------------------------------------------
-# Configuration options related to the dot tool
-#---------------------------------------------------------------------------
-CLASS_DIAGRAMS         = YES
-MSCGEN_PATH            =
-HIDE_UNDOC_RELATIONS   = YES
-HAVE_DOT               = NO
-DOT_NUM_THREADS        = 0
-DOT_FONTNAME           = Helvetica
-DOT_FONTSIZE           = 10
-DOT_FONTPATH           =
-CLASS_GRAPH            = YES
-COLLABORATION_GRAPH    = YES
-GROUP_GRAPHS           = YES
-UML_LOOK               = NO
-UML_LIMIT_NUM_FIELDS   = 10
-TEMPLATE_RELATIONS     = NO
-INCLUDE_GRAPH          = YES
-INCLUDED_BY_GRAPH      = YES
-CALL_GRAPH             = NO
-CALLER_GRAPH           = NO
-GRAPHICAL_HIERARCHY    = YES
-DIRECTORY_GRAPH        = YES
-DOT_IMAGE_FORMAT       = png
-INTERACTIVE_SVG        = NO
-DOT_PATH               =
-DOTFILE_DIRS           =
-MSCFILE_DIRS           =
-DOT_GRAPH_MAX_NODES    = 50
-MAX_DOT_GRAPH_DEPTH    = 0
-DOT_TRANSPARENT        = NO
-DOT_MULTI_TARGETS      = NO
-GENERATE_LEGEND        = YES
-DOT_CLEANUP            = YES

ext/librabbitmq/examples/CMakeLists.txt

@@ -1,52 +0,0 @@
-if (NOT BUILD_SHARED_LIBS)
-  add_definitions(-DAMQP_STATIC)
-endif()
-
-include_directories(${LIBRABBITMQ_INCLUDE_DIRS})
-
-if (WIN32)
-    set(PLATFORM_DIR win32)
-else (WIN32)
-    set(PLATFORM_DIR unix)
-endif (WIN32)
-
-set(COMMON_SRCS
-    utils.h
-    utils.c
-    ${PLATFORM_DIR}/platform_utils.c
-    )
-
-add_executable(amqp_sendstring amqp_sendstring.c ${COMMON_SRCS})
-target_link_libraries(amqp_sendstring ${RMQ_LIBRARY_TARGET})
-
-add_executable(amqp_rpc_sendstring_client amqp_rpc_sendstring_client.c ${COMMON_SRCS})
-target_link_libraries(amqp_rpc_sendstring_client ${RMQ_LIBRARY_TARGET})
-
-add_executable(amqp_exchange_declare amqp_exchange_declare.c ${COMMON_SRCS})
-target_link_libraries(amqp_exchange_declare ${RMQ_LIBRARY_TARGET})
-
-add_executable(amqp_listen amqp_listen.c ${COMMON_SRCS})
-target_link_libraries(amqp_listen ${RMQ_LIBRARY_TARGET})
-
-add_executable(amqp_producer amqp_producer.c ${COMMON_SRCS})
-target_link_libraries(amqp_producer ${RMQ_LIBRARY_TARGET})
-
-add_executable(amqp_connect_timeout amqp_connect_timeout.c ${COMMON_SRCS})
-target_link_libraries(amqp_connect_timeout ${RMQ_LIBRARY_TARGET})
-
-add_executable(amqp_consumer amqp_consumer.c ${COMMON_SRCS})
-target_link_libraries(amqp_consumer ${RMQ_LIBRARY_TARGET})
-
-add_executable(amqp_unbind amqp_unbind.c ${COMMON_SRCS})
-target_link_libraries(amqp_unbind ${RMQ_LIBRARY_TARGET})
-
-add_executable(amqp_bind amqp_bind.c ${COMMON_SRCS})
-target_link_libraries(amqp_bind ${RMQ_LIBRARY_TARGET})
-
-add_executable(amqp_listenq amqp_listenq.c ${COMMON_SRCS})
-target_link_libraries(amqp_listenq ${RMQ_LIBRARY_TARGET})
-
-if (ENABLE_SSL_SUPPORT)
-add_executable(amqp_ssl_connect amqp_ssl_connect.c ${COMMON_SRCS})
-target_link_libraries(amqp_ssl_connect ${RMQ_LIBRARY_TARGET})
-endif (ENABLE_SSL_SUPPORT)

ext/librabbitmq/examples/amqp_bind.c

@@ -1,95 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include "utils.h"
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port, status;
-  char const *exchange;
-  char const *bindingkey;
-  char const *queue;
-  amqp_socket_t *socket = NULL;
-  amqp_connection_state_t conn;
-
-  if (argc < 6) {
-    fprintf(stderr, "Usage: amqp_bind host port exchange bindingkey queue\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-  exchange = argv[3];
-  bindingkey = argv[4];
-  queue = argv[5];
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  status = amqp_socket_open(socket, hostname, port);
-  if (status) {
-    die("opening TCP socket");
-  }
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-  amqp_channel_open(conn, 1);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Opening channel");
-
-  amqp_queue_bind(conn, 1, amqp_cstring_bytes(queue),
-                  amqp_cstring_bytes(exchange), amqp_cstring_bytes(bindingkey),
-                  amqp_empty_table);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Unbinding");
-
-  die_on_amqp_error(amqp_channel_close(conn, 1, AMQP_REPLY_SUCCESS),
-                    "Closing channel");
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-  return 0;
-}

ext/librabbitmq/examples/amqp_connect_timeout.c

@@ -1,114 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by Bogdan Padalko are Copyright (c) 2013.
- * Bogdan Padalko. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include <assert.h>
-
-#ifdef _WIN32
-#ifndef WIN32_LEAN_AND_MEAN
-#define WIN32_LEAN_AND_MEAN
-#endif
-#include <Winsock2.h>
-#else
-#include <sys/time.h>
-#endif
-
-#include "utils.h"
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port;
-  amqp_socket_t *socket;
-  amqp_connection_state_t conn;
-  struct timeval tval;
-  struct timeval *tv;
-
-  if (argc < 3) {
-    fprintf(stderr,
-            "Usage: amqp_connect_timeout host port [timeout_sec "
-            "[timeout_usec=0]]\n");
-    return 1;
-  }
-
-  if (argc > 3) {
-    tv = &tval;
-
-    tv->tv_sec = atoi(argv[3]);
-
-    if (argc > 4) {
-      tv->tv_usec = atoi(argv[4]);
-    } else {
-      tv->tv_usec = 0;
-    }
-
-  } else {
-    tv = NULL;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  die_on_error(amqp_socket_open_noblock(socket, hostname, port, tv),
-               "opening TCP socket");
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-
-  printf("Done\n");
-  return 0;
-}

ext/librabbitmq/examples/amqp_consumer.c

@@ -1,215 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include <assert.h>
-
-#include "utils.h"
-
-#define SUMMARY_EVERY_US 1000000
-
-static void run(amqp_connection_state_t conn) {
-  uint64_t start_time = now_microseconds();
-  int received = 0;
-  int previous_received = 0;
-  uint64_t previous_report_time = start_time;
-  uint64_t next_summary_time = start_time + SUMMARY_EVERY_US;
-
-  amqp_frame_t frame;
-
-  uint64_t now;
-
-  for (;;) {
-    amqp_rpc_reply_t ret;
-    amqp_envelope_t envelope;
-
-    now = now_microseconds();
-    if (now > next_summary_time) {
-      int countOverInterval = received - previous_received;
-      double intervalRate =
-          countOverInterval / ((now - previous_report_time) / 1000000.0);
-      printf("%d ms: Received %d - %d since last report (%d Hz)\n",
-             (int)(now - start_time) / 1000, received, countOverInterval,
-             (int)intervalRate);
-
-      previous_received = received;
-      previous_report_time = now;
-      next_summary_time += SUMMARY_EVERY_US;
-    }
-
-    amqp_maybe_release_buffers(conn);
-    ret = amqp_consume_message(conn, &envelope, NULL, 0);
-
-    if (AMQP_RESPONSE_NORMAL != ret.reply_type) {
-      if (AMQP_RESPONSE_LIBRARY_EXCEPTION == ret.reply_type &&
-          AMQP_STATUS_UNEXPECTED_STATE == ret.library_error) {
-        if (AMQP_STATUS_OK != amqp_simple_wait_frame(conn, &frame)) {
-          return;
-        }
-
-        if (AMQP_FRAME_METHOD == frame.frame_type) {
-          switch (frame.payload.method.id) {
-            case AMQP_BASIC_ACK_METHOD:
-              /* if we've turned publisher confirms on, and we've published a
-               * message here is a message being confirmed.
-               */
-              break;
-            case AMQP_BASIC_RETURN_METHOD:
-              /* if a published message couldn't be routed and the mandatory
-               * flag was set this is what would be returned. The message then
-               * needs to be read.
-               */
-              {
-                amqp_message_t message;
-                ret = amqp_read_message(conn, frame.channel, &message, 0);
-                if (AMQP_RESPONSE_NORMAL != ret.reply_type) {
-                  return;
-                }
-
-                amqp_destroy_message(&message);
-              }
-
-              break;
-
-            case AMQP_CHANNEL_CLOSE_METHOD:
-              /* a channel.close method happens when a channel exception occurs,
-               * this can happen by publishing to an exchange that doesn't exist
-               * for example.
-               *
-               * In this case you would need to open another channel redeclare
-               * any queues that were declared auto-delete, and restart any
-               * consumers that were attached to the previous channel.
-               */
-              return;
-
-            case AMQP_CONNECTION_CLOSE_METHOD:
-              /* a connection.close method happens when a connection exception
-               * occurs, this can happen by trying to use a channel that isn't
-               * open for example.
-               *
-               * In this case the whole connection must be restarted.
-               */
-              return;
-
-            default:
-              fprintf(stderr, "An unexpected method was received %u\n",
-                      frame.payload.method.id);
-              return;
-          }
-        }
-      }
-
-    } else {
-      amqp_destroy_envelope(&envelope);
-    }
-
-    received++;
-  }
-}
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port, status;
-  char const *exchange;
-  char const *bindingkey;
-  amqp_socket_t *socket = NULL;
-  amqp_connection_state_t conn;
-
-  amqp_bytes_t queuename;
-
-  if (argc < 3) {
-    fprintf(stderr, "Usage: amqp_consumer host port\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-  exchange = "amq.direct";   /* argv[3]; */
-  bindingkey = "test queue"; /* argv[4]; */
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  status = amqp_socket_open(socket, hostname, port);
-  if (status) {
-    die("opening TCP socket");
-  }
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-  amqp_channel_open(conn, 1);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Opening channel");
-
-  {
-    amqp_queue_declare_ok_t *r = amqp_queue_declare(
-        conn, 1, amqp_empty_bytes, 0, 0, 0, 1, amqp_empty_table);
-    die_on_amqp_error(amqp_get_rpc_reply(conn), "Declaring queue");
-    queuename = amqp_bytes_malloc_dup(r->queue);
-    if (queuename.bytes == NULL) {
-      fprintf(stderr, "Out of memory while copying queue name");
-      return 1;
-    }
-  }
-
-  amqp_queue_bind(conn, 1, queuename, amqp_cstring_bytes(exchange),
-                  amqp_cstring_bytes(bindingkey), amqp_empty_table);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Binding queue");
-
-  amqp_basic_consume(conn, 1, queuename, amqp_empty_bytes, 0, 1, 0,
-                     amqp_empty_table);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Consuming");
-
-  run(conn);
-
-  die_on_amqp_error(amqp_channel_close(conn, 1, AMQP_REPLY_SUCCESS),
-                    "Closing channel");
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-
-  return 0;
-}

ext/librabbitmq/examples/amqp_exchange_declare.c

@@ -1,94 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include "utils.h"
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port, status;
-  char const *exchange;
-  char const *exchangetype;
-  amqp_socket_t *socket = NULL;
-  amqp_connection_state_t conn;
-
-  if (argc < 5) {
-    fprintf(stderr,
-            "Usage: amqp_exchange_declare host port exchange exchangetype\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-  exchange = argv[3];
-  exchangetype = argv[4];
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  status = amqp_socket_open(socket, hostname, port);
-  if (status) {
-    die("opening TCP socket");
-  }
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-  amqp_channel_open(conn, 1);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Opening channel");
-
-  amqp_exchange_declare(conn, 1, amqp_cstring_bytes(exchange),
-                        amqp_cstring_bytes(exchangetype), 0, 0, 0, 0,
-                        amqp_empty_table);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Declaring exchange");
-
-  die_on_amqp_error(amqp_channel_close(conn, 1, AMQP_REPLY_SUCCESS),
-                    "Closing channel");
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-  return 0;
-}

ext/librabbitmq/examples/amqp_listen.c

@@ -1,143 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include <assert.h>
-
-#include "utils.h"
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port, status;
-  char const *exchange;
-  char const *bindingkey;
-  amqp_socket_t *socket = NULL;
-  amqp_connection_state_t conn;
-
-  amqp_bytes_t queuename;
-
-  if (argc < 5) {
-    fprintf(stderr, "Usage: amqp_listen host port exchange bindingkey\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-  exchange = argv[3];
-  bindingkey = argv[4];
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  status = amqp_socket_open(socket, hostname, port);
-  if (status) {
-    die("opening TCP socket");
-  }
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-  amqp_channel_open(conn, 1);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Opening channel");
-
-  {
-    amqp_queue_declare_ok_t *r = amqp_queue_declare(
-        conn, 1, amqp_empty_bytes, 0, 0, 0, 1, amqp_empty_table);
-    die_on_amqp_error(amqp_get_rpc_reply(conn), "Declaring queue");
-    queuename = amqp_bytes_malloc_dup(r->queue);
-    if (queuename.bytes == NULL) {
-      fprintf(stderr, "Out of memory while copying queue name");
-      return 1;
-    }
-  }
-
-  amqp_queue_bind(conn, 1, queuename, amqp_cstring_bytes(exchange),
-                  amqp_cstring_bytes(bindingkey), amqp_empty_table);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Binding queue");
-
-  amqp_basic_consume(conn, 1, queuename, amqp_empty_bytes, 0, 1, 0,
-                     amqp_empty_table);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Consuming");
-
-  {
-    for (;;) {
-      amqp_rpc_reply_t res;
-      amqp_envelope_t envelope;
-
-      amqp_maybe_release_buffers(conn);
-
-      res = amqp_consume_message(conn, &envelope, NULL, 0);
-
-      if (AMQP_RESPONSE_NORMAL != res.reply_type) {
-        break;
-      }
-
-      printf("Delivery %u, exchange %.*s routingkey %.*s\n",
-             (unsigned)envelope.delivery_tag, (int)envelope.exchange.len,
-             (char *)envelope.exchange.bytes, (int)envelope.routing_key.len,
-             (char *)envelope.routing_key.bytes);
-
-      if (envelope.message.properties._flags & AMQP_BASIC_CONTENT_TYPE_FLAG) {
-        printf("Content-type: %.*s\n",
-               (int)envelope.message.properties.content_type.len,
-               (char *)envelope.message.properties.content_type.bytes);
-      }
-      printf("----\n");
-
-      amqp_dump(envelope.message.body.bytes, envelope.message.body.len);
-
-      amqp_destroy_envelope(&envelope);
-    }
-  }
-
-  die_on_amqp_error(amqp_channel_close(conn, 1, AMQP_REPLY_SUCCESS),
-                    "Closing channel");
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-
-  return 0;
-}

ext/librabbitmq/examples/amqp_listenq.c

@@ -1,122 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include <assert.h>
-
-#include "utils.h"
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port, status;
-  char const *queuename;
-  amqp_socket_t *socket = NULL;
-  amqp_connection_state_t conn;
-
-  if (argc < 4) {
-    fprintf(stderr, "Usage: amqp_listenq host port queuename\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-  queuename = argv[3];
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  status = amqp_socket_open(socket, hostname, port);
-  if (status) {
-    die("opening TCP socket");
-  }
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-  amqp_channel_open(conn, 1);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Opening channel");
-
-  amqp_basic_consume(conn, 1, amqp_cstring_bytes(queuename), amqp_empty_bytes,
-                     0, 0, 0, amqp_empty_table);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Consuming");
-
-  for (;;) {
-    amqp_rpc_reply_t res;
-    amqp_envelope_t envelope;
-
-    amqp_maybe_release_buffers(conn);
-
-    res = amqp_consume_message(conn, &envelope, NULL, 0);
-
-    if (AMQP_RESPONSE_NORMAL != res.reply_type) {
-      break;
-    }
-
-    printf("Delivery %u, exchange %.*s routingkey %.*s\n",
-           (unsigned)envelope.delivery_tag, (int)envelope.exchange.len,
-           (char *)envelope.exchange.bytes, (int)envelope.routing_key.len,
-           (char *)envelope.routing_key.bytes);
-
-    if (envelope.message.properties._flags & AMQP_BASIC_CONTENT_TYPE_FLAG) {
-      printf("Content-type: %.*s\n",
-             (int)envelope.message.properties.content_type.len,
-             (char *)envelope.message.properties.content_type.bytes);
-    }
-    printf("----\n");
-
-    amqp_dump(envelope.message.body.bytes, envelope.message.body.len);
-
-    amqp_destroy_envelope(&envelope);
-  }
-
-  die_on_amqp_error(amqp_channel_close(conn, 1, AMQP_REPLY_SUCCESS),
-                    "Closing channel");
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-
-  return 0;
-}

ext/librabbitmq/examples/amqp_producer.c

@@ -1,150 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include "utils.h"
-
-#define SUMMARY_EVERY_US 1000000
-
-static void send_batch(amqp_connection_state_t conn, char const *queue_name,
-                       int rate_limit, int message_count) {
-  uint64_t start_time = now_microseconds();
-  int i;
-  int sent = 0;
-  int previous_sent = 0;
-  uint64_t previous_report_time = start_time;
-  uint64_t next_summary_time = start_time + SUMMARY_EVERY_US;
-
-  char message[256];
-  amqp_bytes_t message_bytes;
-
-  for (i = 0; i < (int)sizeof(message); i++) {
-    message[i] = i & 0xff;
-  }
-
-  message_bytes.len = sizeof(message);
-  message_bytes.bytes = message;
-
-  for (i = 0; i < message_count; i++) {
-    uint64_t now = now_microseconds();
-
-    die_on_error(amqp_basic_publish(conn, 1, amqp_cstring_bytes("amq.direct"),
-                                    amqp_cstring_bytes(queue_name), 0, 0, NULL,
-                                    message_bytes),
-                 "Publishing");
-    sent++;
-    if (now > next_summary_time) {
-      int countOverInterval = sent - previous_sent;
-      double intervalRate =
-          countOverInterval / ((now - previous_report_time) / 1000000.0);
-      printf("%d ms: Sent %d - %d since last report (%d Hz)\n",
-             (int)(now - start_time) / 1000, sent, countOverInterval,
-             (int)intervalRate);
-
-      previous_sent = sent;
-      previous_report_time = now;
-      next_summary_time += SUMMARY_EVERY_US;
-    }
-
-    while (((i * 1000000.0) / (now - start_time)) > rate_limit) {
-      microsleep(2000);
-      now = now_microseconds();
-    }
-  }
-
-  {
-    uint64_t stop_time = now_microseconds();
-    int total_delta = (int)(stop_time - start_time);
-
-    printf("PRODUCER - Message count: %d\n", message_count);
-    printf("Total time, milliseconds: %d\n", total_delta / 1000);
-    printf("Overall messages-per-second: %g\n",
-           (message_count / (total_delta / 1000000.0)));
-  }
-}
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port, status;
-  int rate_limit;
-  int message_count;
-  amqp_socket_t *socket = NULL;
-  amqp_connection_state_t conn;
-
-  if (argc < 5) {
-    fprintf(stderr,
-            "Usage: amqp_producer host port rate_limit message_count\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-  rate_limit = atoi(argv[3]);
-  message_count = atoi(argv[4]);
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  status = amqp_socket_open(socket, hostname, port);
-  if (status) {
-    die("opening TCP socket");
-  }
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-  amqp_channel_open(conn, 1);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Opening channel");
-
-  send_batch(conn, "test queue", rate_limit, message_count);
-
-  die_on_amqp_error(amqp_channel_close(conn, 1, AMQP_REPLY_SUCCESS),
-                    "Closing channel");
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-  return 0;
-}

ext/librabbitmq/examples/amqp_rpc_sendstring_client.c

@@ -1,243 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include <assert.h>
-
-#include "utils.h"
-
-int main(int argc, char *argv[]) {
-  char const *hostname;
-  int port, status;
-  char const *exchange;
-  char const *routingkey;
-  char const *messagebody;
-  amqp_socket_t *socket = NULL;
-  amqp_connection_state_t conn;
-  amqp_bytes_t reply_to_queue;
-
-  if (argc < 6) { /* minimum number of mandatory arguments */
-    fprintf(stderr,
-            "usage:\namqp_rpc_sendstring_client host port exchange routingkey "
-            "messagebody\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-  exchange = argv[3];
-  routingkey = argv[4];
-  messagebody = argv[5];
-
-  /*
-     establish a channel that is used to connect RabbitMQ server
-  */
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  status = amqp_socket_open(socket, hostname, port);
-  if (status) {
-    die("opening TCP socket");
-  }
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-  amqp_channel_open(conn, 1);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Opening channel");
-
-  /*
-     create private reply_to queue
-  */
-
-  {
-    amqp_queue_declare_ok_t *r = amqp_queue_declare(
-        conn, 1, amqp_empty_bytes, 0, 0, 0, 1, amqp_empty_table);
-    die_on_amqp_error(amqp_get_rpc_reply(conn), "Declaring queue");
-    reply_to_queue = amqp_bytes_malloc_dup(r->queue);
-    if (reply_to_queue.bytes == NULL) {
-      fprintf(stderr, "Out of memory while copying queue name");
-      return 1;
-    }
-  }
-
-  /*
-     send the message
-  */
-
-  {
-    /*
-      set properties
-    */
-    amqp_basic_properties_t props;
-    props._flags = AMQP_BASIC_CONTENT_TYPE_FLAG |
-                   AMQP_BASIC_DELIVERY_MODE_FLAG | AMQP_BASIC_REPLY_TO_FLAG |
-                   AMQP_BASIC_CORRELATION_ID_FLAG;
-    props.content_type = amqp_cstring_bytes("text/plain");
-    props.delivery_mode = 2; /* persistent delivery mode */
-    props.reply_to = amqp_bytes_malloc_dup(reply_to_queue);
-    if (props.reply_to.bytes == NULL) {
-      fprintf(stderr, "Out of memory while copying queue name");
-      return 1;
-    }
-    props.correlation_id = amqp_cstring_bytes("1");
-
-    /*
-      publish
-    */
-    die_on_error(amqp_basic_publish(conn, 1, amqp_cstring_bytes(exchange),
-                                    amqp_cstring_bytes(routingkey), 0, 0,
-                                    &props, amqp_cstring_bytes(messagebody)),
-                 "Publishing");
-
-    amqp_bytes_free(props.reply_to);
-  }
-
-  /*
-    wait an answer
-  */
-
-  {
-    amqp_basic_consume(conn, 1, reply_to_queue, amqp_empty_bytes, 0, 1, 0,
-                       amqp_empty_table);
-    die_on_amqp_error(amqp_get_rpc_reply(conn), "Consuming");
-    amqp_bytes_free(reply_to_queue);
-
-    {
-      amqp_frame_t frame;
-      int result;
-
-      amqp_basic_deliver_t *d;
-      amqp_basic_properties_t *p;
-      size_t body_target;
-      size_t body_received;
-
-      for (;;) {
-        amqp_maybe_release_buffers(conn);
-        result = amqp_simple_wait_frame(conn, &frame);
-        printf("Result: %d\n", result);
-        if (result < 0) {
-          break;
-        }
-
-        printf("Frame type: %u channel: %u\n", frame.frame_type, frame.channel);
-        if (frame.frame_type != AMQP_FRAME_METHOD) {
-          continue;
-        }
-
-        printf("Method: %s\n", amqp_method_name(frame.payload.method.id));
-        if (frame.payload.method.id != AMQP_BASIC_DELIVER_METHOD) {
-          continue;
-        }
-
-        d = (amqp_basic_deliver_t *)frame.payload.method.decoded;
-        printf("Delivery: %u exchange: %.*s routingkey: %.*s\n",
-               (unsigned)d->delivery_tag, (int)d->exchange.len,
-               (char *)d->exchange.bytes, (int)d->routing_key.len,
-               (char *)d->routing_key.bytes);
-
-        result = amqp_simple_wait_frame(conn, &frame);
-        if (result < 0) {
-          break;
-        }
-
-        if (frame.frame_type != AMQP_FRAME_HEADER) {
-          fprintf(stderr, "Expected header!");
-          abort();
-        }
-        p = (amqp_basic_properties_t *)frame.payload.properties.decoded;
-        if (p->_flags & AMQP_BASIC_CONTENT_TYPE_FLAG) {
-          printf("Content-type: %.*s\n", (int)p->content_type.len,
-                 (char *)p->content_type.bytes);
-        }
-        printf("----\n");
-
-        body_target = (size_t)frame.payload.properties.body_size;
-        body_received = 0;
-
-        while (body_received < body_target) {
-          result = amqp_simple_wait_frame(conn, &frame);
-          if (result < 0) {
-            break;
-          }
-
-          if (frame.frame_type != AMQP_FRAME_BODY) {
-            fprintf(stderr, "Expected body!");
-            abort();
-          }
-
-          body_received += frame.payload.body_fragment.len;
-          assert(body_received <= body_target);
-
-          amqp_dump(frame.payload.body_fragment.bytes,
-                    frame.payload.body_fragment.len);
-        }
-
-        if (body_received != body_target) {
-          /* Can only happen when amqp_simple_wait_frame returns <= 0 */
-          /* We break here to close the connection */
-          break;
-        }
-
-        /* everything was fine, we can quit now because we received the reply */
-        break;
-      }
-    }
-  }
-
-  /*
-     closing
-  */
-
-  die_on_amqp_error(amqp_channel_close(conn, 1, AMQP_REPLY_SUCCESS),
-                    "Closing channel");
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-
-  return 0;
-}

ext/librabbitmq/examples/amqp_sendstring.c

@@ -1,103 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include "utils.h"
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port, status;
-  char const *exchange;
-  char const *routingkey;
-  char const *messagebody;
-  amqp_socket_t *socket = NULL;
-  amqp_connection_state_t conn;
-
-  if (argc < 6) {
-    fprintf(
-        stderr,
-        "Usage: amqp_sendstring host port exchange routingkey messagebody\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-  exchange = argv[3];
-  routingkey = argv[4];
-  messagebody = argv[5];
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  status = amqp_socket_open(socket, hostname, port);
-  if (status) {
-    die("opening TCP socket");
-  }
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-  amqp_channel_open(conn, 1);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Opening channel");
-
-  {
-    amqp_basic_properties_t props;
-    props._flags = AMQP_BASIC_CONTENT_TYPE_FLAG | AMQP_BASIC_DELIVERY_MODE_FLAG;
-    props.content_type = amqp_cstring_bytes("text/plain");
-    props.delivery_mode = 2; /* persistent delivery mode */
-    die_on_error(amqp_basic_publish(conn, 1, amqp_cstring_bytes(exchange),
-                                    amqp_cstring_bytes(routingkey), 0, 0,
-                                    &props, amqp_cstring_bytes(messagebody)),
-                 "Publishing");
-  }
-
-  die_on_amqp_error(amqp_channel_close(conn, 1, AMQP_REPLY_SUCCESS),
-                    "Closing channel");
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-  return 0;
-}

ext/librabbitmq/examples/amqp_ssl_connect.c

@@ -1,135 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by Mike Steinert are Copyright (c) 2012-2013
- * Mike Steinert. All Rights Reserved.
- *
- * Portions created by Bogdan Padalko are Copyright (c) 2013.
- * Bogdan Padalko. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_ssl_socket.h>
-
-#include <assert.h>
-
-#ifdef _WIN32
-#ifndef WIN32_LEAN_AND_MEAN
-#define WIN32_LEAN_AND_MEAN
-#endif
-#include <Winsock2.h>
-#else
-#include <sys/time.h>
-#endif
-
-#include "utils.h"
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port;
-  int timeout;
-  amqp_socket_t *socket;
-  amqp_connection_state_t conn;
-  struct timeval tval;
-  struct timeval *tv;
-
-  if (argc < 3) {
-    fprintf(stderr,
-            "Usage: amqps_connect_timeout host port timeout_sec "
-            "[cacert.pem [verifypeer] [verifyhostname] [key.pem cert.pem]]\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-
-  timeout = atoi(argv[3]);
-  if (timeout > 0) {
-    tv = &tval;
-
-    tv->tv_sec = timeout;
-    tv->tv_usec = 0;
-  } else {
-    tv = NULL;
-  }
-
-  conn = amqp_new_connection();
-
-  socket = amqp_ssl_socket_new(conn);
-  if (!socket) {
-    die("creating SSL/TLS socket");
-  }
-
-  amqp_ssl_socket_set_verify_peer(socket, 0);
-  amqp_ssl_socket_set_verify_hostname(socket, 0);
-
-  if (argc > 5) {
-    int nextarg = 5;
-    die_on_error(amqp_ssl_socket_set_cacert(socket, argv[4]),
-                 "setting CA certificate");
-    if (argc > nextarg && !strcmp("verifypeer", argv[nextarg])) {
-      amqp_ssl_socket_set_verify_peer(socket, 1);
-      nextarg++;
-    }
-    if (argc > nextarg && !strcmp("verifyhostname", argv[nextarg])) {
-      amqp_ssl_socket_set_verify_hostname(socket, 1);
-      nextarg++;
-    }
-    if (argc > nextarg + 1) {
-      die_on_error(
-          amqp_ssl_socket_set_key(socket, argv[nextarg + 1], argv[nextarg]),
-          "setting client key");
-    }
-  }
-
-  die_on_error(amqp_socket_open_noblock(socket, hostname, port, tv),
-               "opening SSL/TLS connection");
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-  die_on_error(amqp_uninitialize_ssl_library(), "Uninitializing SSL library");
-
-  printf("Done\n");
-  return 0;
-}

ext/librabbitmq/examples/amqp_unbind.c

@@ -1,95 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_tcp_socket.h>
-
-#include "utils.h"
-
-int main(int argc, char const *const *argv) {
-  char const *hostname;
-  int port, status;
-  char const *exchange;
-  char const *bindingkey;
-  char const *queue;
-  amqp_socket_t *socket = NULL;
-  amqp_connection_state_t conn;
-
-  if (argc < 6) {
-    fprintf(stderr, "Usage: amqp_unbind host port exchange bindingkey queue\n");
-    return 1;
-  }
-
-  hostname = argv[1];
-  port = atoi(argv[2]);
-  exchange = argv[3];
-  bindingkey = argv[4];
-  queue = argv[5];
-
-  conn = amqp_new_connection();
-
-  socket = amqp_tcp_socket_new(conn);
-  if (!socket) {
-    die("creating TCP socket");
-  }
-
-  status = amqp_socket_open(socket, hostname, port);
-  if (status) {
-    die("opening TCP socket");
-  }
-
-  die_on_amqp_error(amqp_login(conn, "/", 0, 131072, 0, AMQP_SASL_METHOD_PLAIN,
-                               "guest", "guest"),
-                    "Logging in");
-  amqp_channel_open(conn, 1);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Opening channel");
-
-  amqp_queue_unbind(conn, 1, amqp_cstring_bytes(queue),
-                    amqp_cstring_bytes(exchange),
-                    amqp_cstring_bytes(bindingkey), amqp_empty_table);
-  die_on_amqp_error(amqp_get_rpc_reply(conn), "Unbinding");
-
-  die_on_amqp_error(amqp_channel_close(conn, 1, AMQP_REPLY_SUCCESS),
-                    "Closing channel");
-  die_on_amqp_error(amqp_connection_close(conn, AMQP_REPLY_SUCCESS),
-                    "Closing connection");
-  die_on_error(amqp_destroy_connection(conn), "Ending connection");
-  return 0;
-}

ext/librabbitmq/examples/unix/platform_utils.c

@@ -1,52 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-#include <sys/time.h>
-#include <time.h>
-#include <unistd.h>
-
-uint64_t now_microseconds(void) {
-  struct timeval tv;
-  gettimeofday(&tv, NULL);
-  return (uint64_t)tv.tv_sec * 1000000 + (uint64_t)tv.tv_usec;
-}
-
-void microsleep(int usec) {
-  struct timespec req;
-  req.tv_sec = 0;
-  req.tv_nsec = 1000 * usec;
-  nanosleep(&req, NULL);
-}

ext/librabbitmq/examples/utils.c

@@ -1,188 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <ctype.h>
-#include <stdarg.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <amqp.h>
-#include <amqp_framing.h>
-#include <stdint.h>
-
-#include "utils.h"
-
-void die(const char *fmt, ...) {
-  va_list ap;
-  va_start(ap, fmt);
-  vfprintf(stderr, fmt, ap);
-  va_end(ap);
-  fprintf(stderr, "\n");
-  exit(1);
-}
-
-void die_on_error(int x, char const *context) {
-  if (x < 0) {
-    fprintf(stderr, "%s: %s\n", context, amqp_error_string2(x));
-    exit(1);
-  }
-}
-
-void die_on_amqp_error(amqp_rpc_reply_t x, char const *context) {
-  switch (x.reply_type) {
-    case AMQP_RESPONSE_NORMAL:
-      return;
-
-    case AMQP_RESPONSE_NONE:
-      fprintf(stderr, "%s: missing RPC reply type!\n", context);
-      break;
-
-    case AMQP_RESPONSE_LIBRARY_EXCEPTION:
-      fprintf(stderr, "%s: %s\n", context, amqp_error_string2(x.library_error));
-      break;
-
-    case AMQP_RESPONSE_SERVER_EXCEPTION:
-      switch (x.reply.id) {
-        case AMQP_CONNECTION_CLOSE_METHOD: {
-          amqp_connection_close_t *m =
-              (amqp_connection_close_t *)x.reply.decoded;
-          fprintf(stderr, "%s: server connection error %uh, message: %.*s\n",
-                  context, m->reply_code, (int)m->reply_text.len,
-                  (char *)m->reply_text.bytes);
-          break;
-        }
-        case AMQP_CHANNEL_CLOSE_METHOD: {
-          amqp_channel_close_t *m = (amqp_channel_close_t *)x.reply.decoded;
-          fprintf(stderr, "%s: server channel error %uh, message: %.*s\n",
-                  context, m->reply_code, (int)m->reply_text.len,
-                  (char *)m->reply_text.bytes);
-          break;
-        }
-        default:
-          fprintf(stderr, "%s: unknown server error, method id 0x%08X\n",
-                  context, x.reply.id);
-          break;
-      }
-      break;
-  }
-
-  exit(1);
-}
-
-static void dump_row(long count, int numinrow, int *chs) {
-  int i;
-
-  printf("%08lX:", count - numinrow);
-
-  if (numinrow > 0) {
-    for (i = 0; i < numinrow; i++) {
-      if (i == 8) {
-        printf(" :");
-      }
-      printf(" %02X", chs[i]);
-    }
-    for (i = numinrow; i < 16; i++) {
-      if (i == 8) {
-        printf(" :");
-      }
-      printf("   ");
-    }
-    printf("  ");
-    for (i = 0; i < numinrow; i++) {
-      if (isprint(chs[i])) {
-        printf("%c", chs[i]);
-      } else {
-        printf(".");
-      }
-    }
-  }
-  printf("\n");
-}
-
-static int rows_eq(int *a, int *b) {
-  int i;
-
-  for (i = 0; i < 16; i++)
-    if (a[i] != b[i]) {
-      return 0;
-    }
-
-  return 1;
-}
-
-void amqp_dump(void const *buffer, size_t len) {
-  unsigned char *buf = (unsigned char *)buffer;
-  long count = 0;
-  int numinrow = 0;
-  int chs[16];
-  int oldchs[16] = {0};
-  int showed_dots = 0;
-  size_t i;
-
-  for (i = 0; i < len; i++) {
-    int ch = buf[i];
-
-    if (numinrow == 16) {
-      int j;
-
-      if (rows_eq(oldchs, chs)) {
-        if (!showed_dots) {
-          showed_dots = 1;
-          printf(
-              "          .. .. .. .. .. .. .. .. : .. .. .. .. .. .. .. ..\n");
-        }
-      } else {
-        showed_dots = 0;
-        dump_row(count, numinrow, chs);
-      }
-
-      for (j = 0; j < 16; j++) {
-        oldchs[j] = chs[j];
-      }
-
-      numinrow = 0;
-    }
-
-    count++;
-    chs[numinrow++] = ch;
-  }
-
-  dump_row(count, numinrow, chs);
-
-  if (numinrow != 0) {
-    printf("%08lX:\n", count);
-  }
-}

ext/librabbitmq/examples/utils.h

@@ -1,48 +0,0 @@
-#ifndef librabbitmq_examples_utils_h
-#define librabbitmq_examples_utils_h
-
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-void die(const char *fmt, ...);
-extern void die_on_error(int x, char const *context);
-extern void die_on_amqp_error(amqp_rpc_reply_t x, char const *context);
-
-extern void amqp_dump(void const *buffer, size_t len);
-
-extern uint64_t now_microseconds(void);
-extern void microsleep(int usec);
-
-#endif

ext/librabbitmq/examples/win32/platform_utils.c

@@ -1,47 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#include <stdint.h>
-
-#include <windows.h>
-
-uint64_t now_microseconds(void) {
-  FILETIME ft;
-  GetSystemTimeAsFileTime(&ft);
-  return (((uint64_t)ft.dwHighDateTime << 32) | (uint64_t)ft.dwLowDateTime) /
-         10;
-}
-
-void microsleep(int usec) { Sleep(usec / 1000); }

ext/librabbitmq/librabbitmq.pc.in

@@ -1,13 +0,0 @@
-prefix=@prefix@
-exec_prefix=@exec_prefix@
-libdir=@libdir@
-includedir=@includedir@
-
-Name: rabbitmq-c
-Description: An AMQP 0-9-1 client library
-Version: @VERSION@
-URL: https://github.com/alanxz/rabbitmq-c
-Requires.private: @requires_private@
-Libs: -L${libdir} -lrabbitmq
-Libs.private: @libs_private@
-CFlags: -I${includedir}

ext/librabbitmq/librabbitmq/CMakeLists.txt

@@ -1,186 +0,0 @@
-project(librabbitmq "C")
-
-if (REGENERATE_AMQP_FRAMING)
-  set(AMQP_CODEGEN_PY "${CMAKE_CURRENT_BINARY_DIR}/amqp_codegen.py")
-  set(CODEGEN_PY "${CMAKE_CURRENT_BINARY_DIR}/codegen.py")
-  set(AMQP_SPEC_JSON_PATH "${AMQP_CODEGEN_DIR}/amqp-rabbitmq-0.9.1.json")
-  set(AMQP_FRAMING_H_PATH ${CMAKE_CURRENT_BINARY_DIR}/amqp_framing.h)
-  set(AMQP_FRAMING_C_PATH ${CMAKE_CURRENT_BINARY_DIR}/amqp_framing.c)
-
-  if (PYTHON_VERSION_MAJOR GREATER 2)
-    set(CONVERT_CODEGEN ${PYTHON_2TO3_EXECUTABLE} -w ${CODEGEN_PY} > codegen_2to3.out)
-    set(CONVERT_AMQP_CODEGEN ${PYTHON_2TO3_EXECUTABLE} -w ${AMQP_CODEGEN_PY} > amqp_codegen_2to3.out)
-  else ()
-    set(CONVERT_CODEGEN "")
-    set(CONVERT_AMQP_CODEGEN "")
-  endif ()
-
-  add_custom_command(
-    OUTPUT ${CODEGEN_PY}
-    COMMAND ${CMAKE_COMMAND} ARGS -E copy ${CMAKE_CURRENT_SOURCE_DIR}/codegen.py ${CODEGEN_PY}
-    COMMAND ${CONVERT_CODEGEN}
-    DEPENDS ${CMAKE_CURRENT_SOURCE_DIR}/codegen.py
-    VERBATIM)
-
-  add_custom_command(
-    OUTPUT ${AMQP_CODEGEN_PY}
-    COMMAND ${CMAKE_COMMAND} ARGS -E copy ${AMQP_CODEGEN_DIR}/amqp_codegen.py ${AMQP_CODEGEN_PY}
-    COMMAND ${CONVERT_AMQP_CODEGEN}
-    DEPENDS ${AMQP_CODEGEN_DIR}/amqp_codegen.py ${AMQP_CODEGEN_TARGET}
-    VERBATIM)
-
-  add_custom_command(
-    OUTPUT ${AMQP_FRAMING_H_PATH}
-    COMMAND ${PYTHON_EXECUTABLE} ARGS ${CODEGEN_PY} header ${AMQP_SPEC_JSON_PATH} ${AMQP_FRAMING_H_PATH}
-    DEPENDS ${AMQP_SPEC_JSON_PATH} ${CODEGEN_PY} ${AMQP_CODEGEN_PY}
-    VERBATIM)
-
-  add_custom_command(
-    OUTPUT ${AMQP_FRAMING_C_PATH}
-    COMMAND ${PYTHON_EXECUTABLE} ARGS ${CODEGEN_PY} body ${AMQP_SPEC_JSON_PATH} ${AMQP_FRAMING_C_PATH}
-    DEPENDS ${AMQP_SPEC_JSON_PATH} ${CODEGEN_PY} ${AMQP_CODEGEN_PY}
-    VERBATIM)
-else (REGENERATE_AMQP_FRAMING)
-  set(AMQP_FRAMING_H_PATH ${CMAKE_CURRENT_SOURCE_DIR}/amqp_framing.h)
-  set(AMQP_FRAMING_C_PATH ${CMAKE_CURRENT_SOURCE_DIR}/amqp_framing.c)
-endif (REGENERATE_AMQP_FRAMING)
-
-if(WIN32)
-  set(SOCKET_IMPL "win32")
-else(WIN32)
-  set(SOCKET_IMPL "unix")
-endif(WIN32)
-
-if(MSVC)
-  if(MSVC_VERSION LESS 1600)
-    set(MSINTTYPES_INCLUDE "${CMAKE_CURRENT_SOURCE_DIR}/win32/msinttypes")
-    set(STDINT_H_INSTALL_FILE "${CMAKE_CURRENT_SOURCE_DIR}/win32/msinttypes/stdint.h")
-  endif(MSVC_VERSION LESS 1600)
-endif(MSVC)
-
-# NOTE: order is important here: if we generate amqp_framing.h/.c it'll be in the
-# binary directory, and should shadow whats in the source directory
-set(LIBRABBITMQ_INCLUDE_DIRS
-  ${CMAKE_CURRENT_BINARY_DIR}
-	${CMAKE_CURRENT_SOURCE_DIR}
-	${SOCKET_IMPL}
-	${MSINTTYPES_INCLUDE}
-	)
-
-include_directories(${LIBRABBITMQ_INCLUDE_DIRS})
-
-set(LIBRABBITMQ_INCLUDE_DIRS
-	${LIBRABBITMQ_INCLUDE_DIRS}
-	PARENT_SCOPE)
-
-add_definitions(-DHAVE_CONFIG_H)
-
-if (ENABLE_SSL_SUPPORT)
-  add_definitions(-DWITH_SSL=1)
-  set(AMQP_SSL_SOCKET_H_PATH amqp_ssl_socket.h)
-
-  set(AMQP_SSL_SRCS ${AMQP_SSL_SOCKET_H_PATH}
-      amqp_openssl.c
-      amqp_openssl_hostname_validation.c
-      amqp_openssl_hostname_validation.h
-      amqp_hostcheck.c
-      amqp_hostcheck.h
-      amqp_openssl_bio.c
-      amqp_openssl_bio.h
-  )
-  include_directories(${OPENSSL_INCLUDE_DIR})
-  set(AMQP_SSL_LIBS ${OPENSSL_LIBRARIES})
-  if (APPLE)
-    # Apple has deprecated OpenSSL in 10.7+. This disables that warning.
-    set_source_files_properties(${AMQP_SSL_SRCS}
-      PROPERTIES COMPILE_FLAGS -Wno-deprecated-declarations)
-  endif()
-
-  if (WIN32)
-    set(AMQP_SSL_SRCS ${AMQP_SSL_SRCS} win32/threads.h win32/threads.c)
-  else()
-    set(AMQP_SSL_SRCS ${AMQP_SSL_SRCS} unix/threads.h)
-  endif()
-endif()
-
-set(RABBITMQ_SOURCES
-    ${AMQP_FRAMING_H_PATH}
-    ${AMQP_FRAMING_C_PATH}
-    amqp_api.c amqp.h amqp_connection.c amqp_mem.c amqp_private.h amqp_socket.c
-    amqp_table.c amqp_url.c amqp_socket.h amqp_tcp_socket.c amqp_tcp_socket.h
-    amqp_time.c amqp_time.h
-    amqp_consumer.c
-    ${AMQP_SSL_SRCS}
-)
-
-add_definitions(-DAMQP_BUILD)
-
-set(RMQ_LIBRARIES ${AMQP_SSL_LIBS} ${SOCKET_LIBRARIES} ${LIBRT} ${CMAKE_THREAD_LIBS_INIT})
-
-if (BUILD_SHARED_LIBS)
-    add_library(rabbitmq SHARED ${RABBITMQ_SOURCES})
-    if (THREADS_HAVE_PTHREAD_ARG)
-      target_compile_options(rabbitmq PUBLIC "-pthread")
-    endif()
-
-    target_link_libraries(rabbitmq ${RMQ_LIBRARIES})
-
-    if (WIN32)
-        set_target_properties(rabbitmq PROPERTIES VERSION ${RMQ_VERSION} OUTPUT_NAME rabbitmq.${RMQ_SOVERSION})
-    else (WIN32)
-        set_target_properties(rabbitmq PROPERTIES VERSION ${RMQ_VERSION} SOVERSION ${RMQ_SOVERSION})
-    endif (WIN32)
-
-    install(TARGETS rabbitmq
-        RUNTIME DESTINATION ${CMAKE_INSTALL_BINDIR}
-        LIBRARY DESTINATION ${CMAKE_INSTALL_LIBDIR}
-        ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR}
-        )
-
-    set(RMQ_LIBRARY_TARGET rabbitmq)
-endif (BUILD_SHARED_LIBS)
-
-if (BUILD_STATIC_LIBS)
-    add_library(rabbitmq-static STATIC ${RABBITMQ_SOURCES})
-    if (THREADS_HAVE_PTHREAD_ARG)
-      target_compile_options(rabbitmq-static PUBLIC "-pthread")
-    endif()
-
-    target_link_libraries(rabbitmq-static ${RMQ_LIBRARIES})
-
-    set_target_properties(rabbitmq-static PROPERTIES COMPILE_DEFINITIONS AMQP_STATIC)
-    if (WIN32)
-        set_target_properties(rabbitmq-static PROPERTIES
-          VERSION ${RMQ_VERSION}
-          OUTPUT_NAME librabbitmq.${RMQ_SOVERSION})
-
-        if(MSVC)
-            set_target_properties(rabbitmq-static PROPERTIES
-            # Embed debugging info in the library itself instead of generating
-            # a .pdb file.
-            COMPILE_OPTIONS "/Z7")
-        endif(MSVC)
-
-    else (WIN32)
-        set_target_properties(rabbitmq-static PROPERTIES VERSION ${RMQ_VERSION} SOVERSION ${RMQ_SOVERSION} OUTPUT_NAME rabbitmq)
-    endif (WIN32)
-
-    install(TARGETS rabbitmq-static
-        ARCHIVE DESTINATION ${CMAKE_INSTALL_LIBDIR}
-        )
-
-    if (NOT DEFINED RMQ_LIBRARY_TARGET)
-        set(RMQ_LIBRARY_TARGET rabbitmq-static)
-    endif ()
-endif (BUILD_STATIC_LIBS)
-
-install(FILES
-  amqp.h
-  ${AMQP_FRAMING_H_PATH}
-  amqp_tcp_socket.h
-  ${AMQP_SSL_SOCKET_H_PATH}
-  ${STDINT_H_INSTALL_FILE}
-  DESTINATION ${CMAKE_INSTALL_INCLUDEDIR}
-    )
-
-set(RMQ_LIBRARY_TARGET ${RMQ_LIBRARY_TARGET} PARENT_SCOPE)

ext/librabbitmq/librabbitmq/amqp.h

@@ -1,2535 +0,0 @@
-/** \file */
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2014
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifndef AMQP_H
-#define AMQP_H
-
-/** \cond HIDE_FROM_DOXYGEN */
-
-#ifdef __cplusplus
-#define AMQP_BEGIN_DECLS extern "C" {
-#define AMQP_END_DECLS }
-#else
-#define AMQP_BEGIN_DECLS
-#define AMQP_END_DECLS
-#endif
-
-/*
- * \internal
- * Important API decorators:
- *  AMQP_PUBLIC_FUNCTION - a public API function
- *  AMQP_PUBLIC_VARIABLE - a public API external variable
- *  AMQP_CALL - calling convension (used on Win32)
- */
-
-#if defined(_WIN32) && defined(_MSC_VER)
-#if defined(AMQP_BUILD) && !defined(AMQP_STATIC)
-#define AMQP_PUBLIC_FUNCTION __declspec(dllexport)
-#define AMQP_PUBLIC_VARIABLE __declspec(dllexport) extern
-#else
-#define AMQP_PUBLIC_FUNCTION
-#if !defined(AMQP_STATIC)
-#define AMQP_PUBLIC_VARIABLE __declspec(dllimport) extern
-#else
-#define AMQP_PUBLIC_VARIABLE extern
-#endif
-#endif
-#define AMQP_CALL __cdecl
-
-#elif defined(_WIN32) && defined(__BORLANDC__)
-#if defined(AMQP_BUILD) && !defined(AMQP_STATIC)
-#define AMQP_PUBLIC_FUNCTION __declspec(dllexport)
-#define AMQP_PUBLIC_VARIABLE __declspec(dllexport) extern
-#else
-#define AMQP_PUBLIC_FUNCTION
-#if !defined(AMQP_STATIC)
-#define AMQP_PUBLIC_VARIABLE __declspec(dllimport) extern
-#else
-#define AMQP_PUBLIC_VARIABLE extern
-#endif
-#endif
-#define AMQP_CALL __cdecl
-
-#elif defined(_WIN32) && defined(__MINGW32__)
-#if defined(AMQP_BUILD) && !defined(AMQP_STATIC)
-#define AMQP_PUBLIC_FUNCTION __declspec(dllexport)
-#define AMQP_PUBLIC_VARIABLE __declspec(dllexport) extern
-#else
-#define AMQP_PUBLIC_FUNCTION
-#if !defined(AMQP_STATIC)
-#define AMQP_PUBLIC_VARIABLE __declspec(dllimport) extern
-#else
-#define AMQP_PUBLIC_VARIABLE extern
-#endif
-#endif
-#define AMQP_CALL __cdecl
-
-#elif defined(_WIN32) && defined(__CYGWIN__)
-#if defined(AMQP_BUILD) && !defined(AMQP_STATIC)
-#define AMQP_PUBLIC_FUNCTION __declspec(dllexport)
-#define AMQP_PUBLIC_VARIABLE __declspec(dllexport)
-#else
-#define AMQP_PUBLIC_FUNCTION
-#if !defined(AMQP_STATIC)
-#define AMQP_PUBLIC_VARIABLE __declspec(dllimport) extern
-#else
-#define AMQP_PUBLIC_VARIABLE extern
-#endif
-#endif
-#define AMQP_CALL __cdecl
-
-#elif defined(__GNUC__) && __GNUC__ >= 4
-#define AMQP_PUBLIC_FUNCTION __attribute__((visibility("default")))
-#define AMQP_PUBLIC_VARIABLE __attribute__((visibility("default"))) extern
-#define AMQP_CALL
-#else
-#define AMQP_PUBLIC_FUNCTION
-#define AMQP_PUBLIC_VARIABLE extern
-#define AMQP_CALL
-#endif
-
-#if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1)
-#define AMQP_DEPRECATED(function) function __attribute__((__deprecated__))
-#elif defined(_MSC_VER)
-#define AMQP_DEPRECATED(function) __declspec(deprecated) function
-#else
-#define AMQP_DEPRECATED(function)
-#endif
-
-/* Define ssize_t on Win32/64 platforms
-   See: http://lists.cs.uiuc.edu/pipermail/llvmdev/2010-April/030649.html for
-   details
-   */
-#if !defined(_W64)
-#if !defined(__midl) && (defined(_X86_) || defined(_M_IX86)) && _MSC_VER >= 1300
-#define _W64 __w64
-#else
-#define _W64
-#endif
-#endif
-
-#ifdef _MSC_VER
-#ifdef _WIN64
-typedef __int64 ssize_t;
-#else
-typedef _W64 int ssize_t;
-#endif
-#endif
-
-#if defined(_WIN32) && defined(__MINGW32__)
-#include <sys/types.h>
-#endif
-
-/** \endcond */
-
-#include <stddef.h>
-#include <stdint.h>
-
-struct timeval;
-
-AMQP_BEGIN_DECLS
-
-/**
- * \def AMQP_VERSION_MAJOR
- *
- * Major library version number compile-time constant
- *
- * The major version is incremented when backwards incompatible API changes
- * are made.
- *
- * \sa AMQP_VERSION, AMQP_VERSION_STRING
- *
- * \since v0.4.0
- */
-
-/**
- * \def AMQP_VERSION_MINOR
- *
- * Minor library version number compile-time constant
- *
- * The minor version is incremented when new APIs are added. Existing APIs
- * are left alone.
- *
- * \sa AMQP_VERSION, AMQP_VERSION_STRING
- *
- * \since v0.4.0
- */
-
-/**
- * \def AMQP_VERSION_PATCH
- *
- * Patch library version number compile-time constant
- *
- * The patch version is incremented when library code changes, but the API
- * is not changed.
- *
- * \sa AMQP_VERSION, AMQP_VERSION_STRING
- *
- * \since v0.4.0
- */
-
-/**
- * \def AMQP_VERSION_IS_RELEASE
- *
- * Version constant set to 1 for tagged release, 0 otherwise
- *
- * NOTE: versions that are not tagged releases are not guaranteed to be API/ABI
- * compatible with older releases, and may change commit-to-commit.
- *
- * \sa AMQP_VERSION, AMQP_VERSION_STRING
- *
- * \since v0.4.0
- */
-/*
- * Developer note: when changing these, be sure to update SOVERSION constants
- *  in CMakeLists.txt and configure.ac
- */
-
-#define AMQP_VERSION_MAJOR 0
-#define AMQP_VERSION_MINOR 9
-#define AMQP_VERSION_PATCH 0
-#define AMQP_VERSION_IS_RELEASE 1
-
-/**
- * \def AMQP_VERSION_CODE
- *
- * Helper macro to geneate a packed version code suitable for
- * comparison with AMQP_VERSION.
- *
- * \sa amqp_version_number() AMQP_VERSION_MAJOR, AMQP_VERSION_MINOR,
- *     AMQP_VERSION_PATCH, AMQP_VERSION_IS_RELEASE, AMQP_VERSION
- *
- * \since v0.6.1
- */
-#define AMQP_VERSION_CODE(major, minor, patch, release) \
-  ((major << 24) | (minor << 16) | (patch << 8) | (release))
-
-/**
- * \def AMQP_VERSION
- *
- * Packed version number
- *
- * AMQP_VERSION is a 4-byte unsigned integer with the most significant byte
- * set to AMQP_VERSION_MAJOR, the second most significant byte set to
- * AMQP_VERSION_MINOR, third most significant byte set to AMQP_VERSION_PATCH,
- * and the lowest byte set to AMQP_VERSION_IS_RELEASE.
- *
- * For example version 2.3.4 which is released version would be encoded as
- * 0x02030401
- *
- * \sa amqp_version_number() AMQP_VERSION_MAJOR, AMQP_VERSION_MINOR,
- *     AMQP_VERSION_PATCH, AMQP_VERSION_IS_RELEASE, AMQP_VERSION_CODE
- *
- * \since v0.4.0
- */
-#define AMQP_VERSION                                        \
-  AMQP_VERSION_CODE(AMQP_VERSION_MAJOR, AMQP_VERSION_MINOR, \
-                    AMQP_VERSION_PATCH, AMQP_VERSION_IS_RELEASE)
-
-/** \cond HIDE_FROM_DOXYGEN */
-#define AMQ_STRINGIFY(s) AMQ_STRINGIFY_HELPER(s)
-#define AMQ_STRINGIFY_HELPER(s) #s
-
-#define AMQ_VERSION_STRING          \
-  AMQ_STRINGIFY(AMQP_VERSION_MAJOR) \
-  "." AMQ_STRINGIFY(AMQP_VERSION_MINOR) "." AMQ_STRINGIFY(AMQP_VERSION_PATCH)
-/** \endcond */
-
-/**
- * \def AMQP_VERSION_STRING
- *
- * Version string compile-time constant
- *
- * Non-released versions of the library will have "-pre" appended to the
- * version string
- *
- * \sa amqp_version()
- *
- * \since v0.4.0
- */
-#if AMQP_VERSION_IS_RELEASE
-#define AMQP_VERSION_STRING AMQ_VERSION_STRING
-#else
-#define AMQP_VERSION_STRING AMQ_VERSION_STRING "-pre"
-#endif
-
-/**
- * Returns the rabbitmq-c version as a packed integer.
- *
- * See \ref AMQP_VERSION
- *
- * \return packed 32-bit integer representing version of library at runtime
- *
- * \sa AMQP_VERSION, amqp_version()
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-uint32_t AMQP_CALL amqp_version_number(void);
-
-/**
- * Returns the rabbitmq-c version as a string.
- *
- * See \ref AMQP_VERSION_STRING
- *
- * \return a statically allocated string describing the version of rabbitmq-c.
- *
- * \sa amqp_version_number(), AMQP_VERSION_STRING, AMQP_VERSION
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-char const *AMQP_CALL amqp_version(void);
-
-/**
- * \def AMQP_DEFAULT_FRAME_SIZE
- *
- * Default frame size (128Kb)
- *
- * \sa amqp_login(), amqp_login_with_properties()
- *
- * \since v0.4.0
- */
-#define AMQP_DEFAULT_FRAME_SIZE 131072
-
-/**
- * \def AMQP_DEFAULT_MAX_CHANNELS
- *
- * Default maximum number of channels (0, no limit)
- *
- * \sa amqp_login(), amqp_login_with_properties()
- *
- * \since v0.4.0
- */
-#define AMQP_DEFAULT_MAX_CHANNELS 0
-
-/**
- * \def AMQP_DEFAULT_HEARTBEAT
- *
- * Default heartbeat interval (0, heartbeat disabled)
- *
- * \sa amqp_login(), amqp_login_with_properties()
- *
- * \since v0.4.0
- */
-#define AMQP_DEFAULT_HEARTBEAT 0
-
-/**
- * \def AMQP_DEFAULT_VHOST
- *
- * Default RabbitMQ vhost: "/"
- *
- * \sa amqp_login(), amqp_login_with_properties()
- *
- * \since v0.9.0
- */
-#define AMQP_DEFAULT_VHOST "/"
-
-/**
- * boolean type 0 = false, true otherwise
- *
- * \since v0.1
- */
-typedef int amqp_boolean_t;
-
-/**
- * Method number
- *
- * \since v0.1
- */
-typedef uint32_t amqp_method_number_t;
-
-/**
- * Bitmask for flags
- *
- * \since v0.1
- */
-typedef uint32_t amqp_flags_t;
-
-/**
- * Channel type
- *
- * \since v0.1
- */
-typedef uint16_t amqp_channel_t;
-
-/**
- * Buffer descriptor
- *
- * \since v0.1
- */
-typedef struct amqp_bytes_t_ {
-  size_t len;  /**< length of the buffer in bytes */
-  void *bytes; /**< pointer to the beginning of the buffer */
-} amqp_bytes_t;
-
-/**
- * Decimal data type
- *
- * \since v0.1
- */
-typedef struct amqp_decimal_t_ {
-  uint8_t decimals; /**< the location of the decimal point */
-  uint32_t value;   /**< the value before the decimal point is applied */
-} amqp_decimal_t;
-
-/**
- * AMQP field table
- *
- * An AMQP field table is a set of key-value pairs.
- * A key is a UTF-8 encoded string up to 128 bytes long, and are not null
- * terminated.
- * A value can be one of several different datatypes. \sa
- * amqp_field_value_kind_t
- *
- * \sa amqp_table_entry_t
- *
- * \since v0.1
- */
-typedef struct amqp_table_t_ {
-  int num_entries;                     /**< length of entries array */
-  struct amqp_table_entry_t_ *entries; /**< an array of table entries */
-} amqp_table_t;
-
-/**
- * An AMQP Field Array
- *
- * A repeated set of field values, all must be of the same type
- *
- * \since v0.1
- */
-typedef struct amqp_array_t_ {
-  int num_entries;                     /**< Number of entries in the table */
-  struct amqp_field_value_t_ *entries; /**< linked list of field values */
-} amqp_array_t;
-
-/*
-  0-9   0-9-1   Qpid/Rabbit  Type               Remarks
----------------------------------------------------------------------------
-        t       t            Boolean
-        b       b            Signed 8-bit
-        B                    Unsigned 8-bit
-        U       s            Signed 16-bit      (A1)
-        u                    Unsigned 16-bit
-  I     I       I            Signed 32-bit
-        i                    Unsigned 32-bit
-        L       l            Signed 64-bit      (B)
-        l                    Unsigned 64-bit
-        f       f            32-bit float
-        d       d            64-bit float
-  D     D       D            Decimal
-        s                    Short string       (A2)
-  S     S       S            Long string
-        A                    Nested Array
-  T     T       T            Timestamp (u64)
-  F     F       F            Nested Table
-  V     V       V            Void
-                x            Byte array
-
-Remarks:
-
- A1, A2: Notice how the types **CONFLICT** here. In Qpid and Rabbit,
-         's' means a signed 16-bit integer; in 0-9-1, it means a
-          short string.
-
- B: Notice how the signednesses **CONFLICT** here. In Qpid and Rabbit,
-    'l' means a signed 64-bit integer; in 0-9-1, it means an unsigned
-    64-bit integer.
-
-I'm going with the Qpid/Rabbit types, where there's a conflict, and
-the 0-9-1 types otherwise. 0-8 is a subset of 0-9, which is a subset
-of the other two, so this will work for both 0-8 and 0-9-1 branches of
-the code.
-*/
-
-/**
- * A field table value
- *
- * \since v0.1
- */
-typedef struct amqp_field_value_t_ {
-  uint8_t kind; /**< the type of the entry /sa amqp_field_value_kind_t */
-  union {
-    amqp_boolean_t boolean; /**< boolean type AMQP_FIELD_KIND_BOOLEAN */
-    int8_t i8;              /**< int8_t type AMQP_FIELD_KIND_I8 */
-    uint8_t u8;             /**< uint8_t type AMQP_FIELD_KIND_U8 */
-    int16_t i16;            /**< int16_t type AMQP_FIELD_KIND_I16 */
-    uint16_t u16;           /**< uint16_t type AMQP_FIELD_KIND_U16 */
-    int32_t i32;            /**< int32_t type AMQP_FIELD_KIND_I32 */
-    uint32_t u32;           /**< uint32_t type AMQP_FIELD_KIND_U32 */
-    int64_t i64;            /**< int64_t type AMQP_FIELD_KIND_I64 */
-    uint64_t u64;           /**< uint64_t type AMQP_FIELD_KIND_U64,
-                               AMQP_FIELD_KIND_TIMESTAMP */
-    float f32;              /**< float type AMQP_FIELD_KIND_F32 */
-    double f64;             /**< double type AMQP_FIELD_KIND_F64 */
-    amqp_decimal_t decimal; /**< amqp_decimal_t AMQP_FIELD_KIND_DECIMAL */
-    amqp_bytes_t bytes;     /**< amqp_bytes_t type AMQP_FIELD_KIND_UTF8,
-                               AMQP_FIELD_KIND_BYTES */
-    amqp_table_t table;     /**< amqp_table_t type AMQP_FIELD_KIND_TABLE */
-    amqp_array_t array;     /**< amqp_array_t type AMQP_FIELD_KIND_ARRAY */
-  } value;                  /**< a union of the value */
-} amqp_field_value_t;
-
-/**
- * An entry in a field-table
- *
- * \sa amqp_table_encode(), amqp_table_decode(), amqp_table_clone()
- *
- * \since v0.1
- */
-typedef struct amqp_table_entry_t_ {
-  amqp_bytes_t key; /**< the table entry key. Its a null-terminated UTF-8
-                     * string, with a maximum size of 128 bytes */
-  amqp_field_value_t value; /**< the table entry values */
-} amqp_table_entry_t;
-
-/**
- * Field value types
- *
- * \since v0.1
- */
-typedef enum {
-  AMQP_FIELD_KIND_BOOLEAN =
-      't', /**< boolean type. 0 = false, 1 = true @see amqp_boolean_t */
-  AMQP_FIELD_KIND_I8 = 'b',  /**< 8-bit signed integer, datatype: int8_t */
-  AMQP_FIELD_KIND_U8 = 'B',  /**< 8-bit unsigned integer, datatype: uint8_t */
-  AMQP_FIELD_KIND_I16 = 's', /**< 16-bit signed integer, datatype: int16_t */
-  AMQP_FIELD_KIND_U16 = 'u', /**< 16-bit unsigned integer, datatype: uint16_t */
-  AMQP_FIELD_KIND_I32 = 'I', /**< 32-bit signed integer, datatype: int32_t */
-  AMQP_FIELD_KIND_U32 = 'i', /**< 32-bit unsigned integer, datatype: uint32_t */
-  AMQP_FIELD_KIND_I64 = 'l', /**< 64-bit signed integer, datatype: int64_t */
-  AMQP_FIELD_KIND_U64 = 'L', /**< 64-bit unsigned integer, datatype: uint64_t */
-  AMQP_FIELD_KIND_F32 =
-      'f', /**< single-precision floating point value, datatype: float */
-  AMQP_FIELD_KIND_F64 =
-      'd', /**< double-precision floating point value, datatype: double */
-  AMQP_FIELD_KIND_DECIMAL =
-      'D', /**< amqp-decimal value, datatype: amqp_decimal_t */
-  AMQP_FIELD_KIND_UTF8 = 'S',      /**< UTF-8 null-terminated character string,
-                                      datatype: amqp_bytes_t */
-  AMQP_FIELD_KIND_ARRAY = 'A',     /**< field array (repeated values of another
-                                      datatype. datatype: amqp_array_t */
-  AMQP_FIELD_KIND_TIMESTAMP = 'T', /**< 64-bit timestamp. datatype uint64_t */
-  AMQP_FIELD_KIND_TABLE = 'F', /**< field table. encapsulates a table inside a
-                                  table entry. datatype: amqp_table_t */
-  AMQP_FIELD_KIND_VOID = 'V',  /**< empty entry */
-  AMQP_FIELD_KIND_BYTES =
-      'x' /**< unformatted byte string, datatype: amqp_bytes_t */
-} amqp_field_value_kind_t;
-
-/**
- * A list of allocation blocks
- *
- * \since v0.1
- */
-typedef struct amqp_pool_blocklist_t_ {
-  int num_blocks;   /**< Number of blocks in the block list */
-  void **blocklist; /**< Array of memory blocks */
-} amqp_pool_blocklist_t;
-
-/**
- * A memory pool
- *
- * \since v0.1
- */
-typedef struct amqp_pool_t_ {
-  size_t pagesize; /**< the size of the page in bytes. Allocations less than or
-                    * equal to this size are allocated in the pages block list.
-                    * Allocations greater than this are allocated in their own
-                    * own block in the large_blocks block list */
-
-  amqp_pool_blocklist_t pages; /**< blocks that are the size of pagesize */
-  amqp_pool_blocklist_t
-      large_blocks; /**< allocations larger than the pagesize */
-
-  int next_page;     /**< an index to the next unused page block */
-  char *alloc_block; /**< pointer to the current allocation block */
-  size_t alloc_used; /**< number of bytes in the current allocation block that
-                        has been used */
-} amqp_pool_t;
-
-/**
- * An amqp method
- *
- * \since v0.1
- */
-typedef struct amqp_method_t_ {
-  amqp_method_number_t id; /**< the method id number */
-  void *decoded;           /**< pointer to the decoded method,
-                            *    cast to the appropriate type to use */
-} amqp_method_t;
-
-/**
- * An AMQP frame
- *
- * \since v0.1
- */
-typedef struct amqp_frame_t_ {
-  uint8_t frame_type;     /**< frame type. The types:
-                           * - AMQP_FRAME_METHOD - use the method union member
-                           * - AMQP_FRAME_HEADER - use the properties union member
-                           * - AMQP_FRAME_BODY - use the body_fragment union member
-                           */
-  amqp_channel_t channel; /**< the channel the frame was received on */
-  union {
-    amqp_method_t
-        method; /**< a method, use if frame_type == AMQP_FRAME_METHOD */
-    struct {
-      uint16_t class_id;        /**< the class for the properties */
-      uint64_t body_size;       /**< size of the body in bytes */
-      void *decoded;            /**< the decoded properties */
-      amqp_bytes_t raw;         /**< amqp-encoded properties structure */
-    } properties;               /**< message header, a.k.a., properties,
-                                      use if frame_type == AMQP_FRAME_HEADER */
-    amqp_bytes_t body_fragment; /**< a body fragment, use if frame_type ==
-                                   AMQP_FRAME_BODY */
-    struct {
-      uint8_t transport_high;         /**< @internal first byte of handshake */
-      uint8_t transport_low;          /**< @internal second byte of handshake */
-      uint8_t protocol_version_major; /**< @internal third byte of handshake */
-      uint8_t protocol_version_minor; /**< @internal fourth byte of handshake */
-    } protocol_header; /**< Used only when doing the initial handshake with the
-                          broker, don't use otherwise */
-  } payload;           /**< the payload of the frame */
-} amqp_frame_t;
-
-/**
- * Response type
- *
- * \since v0.1
- */
-typedef enum amqp_response_type_enum_ {
-  AMQP_RESPONSE_NONE = 0, /**< the library got an EOF from the socket */
-  AMQP_RESPONSE_NORMAL, /**< response normal, the RPC completed successfully */
-  AMQP_RESPONSE_LIBRARY_EXCEPTION, /**< library error, an error occurred in the
-                                      library, examine the library_error */
-  AMQP_RESPONSE_SERVER_EXCEPTION   /**< server exception, the broker returned an
-                                      error, check replay */
-} amqp_response_type_enum;
-
-/**
- * Reply from a RPC method on the broker
- *
- * \since v0.1
- */
-typedef struct amqp_rpc_reply_t_ {
-  amqp_response_type_enum reply_type; /**< the reply type:
-                                       * - AMQP_RESPONSE_NORMAL - the RPC
-                                       * completed successfully
-                                       * - AMQP_RESPONSE_SERVER_EXCEPTION - the
-                                       * broker returned
-                                       *     an exception, check the reply field
-                                       * - AMQP_RESPONSE_LIBRARY_EXCEPTION - the
-                                       * library
-                                       *    encountered an error, check the
-                                       * library_error field
-                                       */
-  amqp_method_t reply; /**< in case of AMQP_RESPONSE_SERVER_EXCEPTION this
-                        * field will be set to the method returned from the
-                        * broker */
-  int library_error;   /**< in case of AMQP_RESPONSE_LIBRARY_EXCEPTION this
-                        *    field will be set to an error code. An error
-                        *     string can be retrieved using amqp_error_string */
-} amqp_rpc_reply_t;
-
-/**
- * SASL method type
- *
- * \since v0.1
- */
-typedef enum amqp_sasl_method_enum_ {
-  AMQP_SASL_METHOD_UNDEFINED = -1, /**< Invalid SASL method */
-  AMQP_SASL_METHOD_PLAIN =
-      0, /**< the PLAIN SASL method for authentication to the broker */
-  AMQP_SASL_METHOD_EXTERNAL =
-      1 /**< the EXTERNAL SASL method for authentication to the broker */
-} amqp_sasl_method_enum;
-
-/**
- * connection state object
- *
- * \since v0.1
- */
-typedef struct amqp_connection_state_t_ *amqp_connection_state_t;
-
-/**
- * Socket object
- *
- * \since v0.4.0
- */
-typedef struct amqp_socket_t_ amqp_socket_t;
-
-/**
- * Status codes
- *
- * \since v0.4.0
- */
-/* NOTE: When updating this enum, update the strings in librabbitmq/amqp_api.c
- */
-typedef enum amqp_status_enum_ {
-  AMQP_STATUS_OK = 0x0,                             /**< Operation successful */
-  AMQP_STATUS_NO_MEMORY = -0x0001,                  /**< Memory allocation
-                                                         failed */
-  AMQP_STATUS_BAD_AMQP_DATA = -0x0002,              /**< Incorrect or corrupt
-                                                         data was received from
-                                                         the broker. This is a
-                                                         protocol error. */
-  AMQP_STATUS_UNKNOWN_CLASS = -0x0003,              /**< An unknown AMQP class
-                                                         was received. This is
-                                                         a protocol error. */
-  AMQP_STATUS_UNKNOWN_METHOD = -0x0004,             /**< An unknown AMQP method
-                                                         was received. This is
-                                                         a protocol error. */
-  AMQP_STATUS_HOSTNAME_RESOLUTION_FAILED = -0x0005, /**< Unable to resolve the
-                                                     * hostname */
-  AMQP_STATUS_INCOMPATIBLE_AMQP_VERSION = -0x0006,  /**< The broker advertised
-                                                         an incompaible AMQP
-                                                         version */
-  AMQP_STATUS_CONNECTION_CLOSED = -0x0007,          /**< The connection to the
-                                                         broker has been closed
-                                                         */
-  AMQP_STATUS_BAD_URL = -0x0008,                    /**< malformed AMQP URL */
-  AMQP_STATUS_SOCKET_ERROR = -0x0009,               /**< A socket error
-                                                         occurred */
-  AMQP_STATUS_INVALID_PARAMETER = -0x000A,          /**< An invalid parameter
-                                                         was passed into the
-                                                         function */
-  AMQP_STATUS_TABLE_TOO_BIG = -0x000B,              /**< The amqp_table_t object
-                                                         cannot be serialized
-                                                         because the output
-                                                         buffer is too small */
-  AMQP_STATUS_WRONG_METHOD = -0x000C,               /**< The wrong method was
-                                                         received */
-  AMQP_STATUS_TIMEOUT = -0x000D,                    /**< Operation timed out */
-  AMQP_STATUS_TIMER_FAILURE = -0x000E,              /**< The underlying system
-                                                         timer facility failed */
-  AMQP_STATUS_HEARTBEAT_TIMEOUT = -0x000F,          /**< Timed out waiting for
-                                                         heartbeat */
-  AMQP_STATUS_UNEXPECTED_STATE = -0x0010,           /**< Unexpected protocol
-                                                         state */
-  AMQP_STATUS_SOCKET_CLOSED = -0x0011,              /**< Underlying socket is
-                                                         closed */
-  AMQP_STATUS_SOCKET_INUSE = -0x0012,               /**< Underlying socket is
-                                                         already open */
-  AMQP_STATUS_BROKER_UNSUPPORTED_SASL_METHOD = -0x0013, /**< Broker does not
-                                                          support the requested
-                                                          SASL mechanism */
-  AMQP_STATUS_UNSUPPORTED = -0x0014, /**< Parameter is unsupported
-                                       in this version */
-  _AMQP_STATUS_NEXT_VALUE = -0x0015, /**< Internal value */
-
-  AMQP_STATUS_TCP_ERROR = -0x0100,                /**< A generic TCP error
-                                                       occurred */
-  AMQP_STATUS_TCP_SOCKETLIB_INIT_ERROR = -0x0101, /**< An error occurred trying
-                                                       to initialize the
-                                                       socket library*/
-  _AMQP_STATUS_TCP_NEXT_VALUE = -0x0102,          /**< Internal value */
-
-  AMQP_STATUS_SSL_ERROR = -0x0200,                  /**< A generic SSL error
-                                                         occurred. */
-  AMQP_STATUS_SSL_HOSTNAME_VERIFY_FAILED = -0x0201, /**< SSL validation of
-                                                         hostname against
-                                                         peer certificate
-                                                         failed */
-  AMQP_STATUS_SSL_PEER_VERIFY_FAILED = -0x0202,     /**< SSL validation of peer
-                                                         certificate failed. */
-  AMQP_STATUS_SSL_CONNECTION_FAILED = -0x0203, /**< SSL handshake failed. */
-  _AMQP_STATUS_SSL_NEXT_VALUE = -0x0204        /**< Internal value */
-} amqp_status_enum;
-
-/**
- * AMQP delivery modes.
- * Use these values for the #amqp_basic_properties_t::delivery_mode field.
- *
- * \since v0.5
- */
-typedef enum {
-  AMQP_DELIVERY_NONPERSISTENT = 1, /**< Non-persistent message */
-  AMQP_DELIVERY_PERSISTENT = 2     /**< Persistent message */
-} amqp_delivery_mode_enum;
-
-AMQP_END_DECLS
-
-#include <amqp_framing.h>
-
-AMQP_BEGIN_DECLS
-
-/**
- * Empty bytes structure
- *
- * \since v0.2
- */
-AMQP_PUBLIC_VARIABLE const amqp_bytes_t amqp_empty_bytes;
-
-/**
- * Empty table structure
- *
- * \since v0.2
- */
-AMQP_PUBLIC_VARIABLE const amqp_table_t amqp_empty_table;
-
-/**
- * Empty table array structure
- *
- * \since v0.2
- */
-AMQP_PUBLIC_VARIABLE const amqp_array_t amqp_empty_array;
-
-/* Compatibility macros for the above, to avoid the need to update
-   code written against earlier versions of librabbitmq. */
-
-/**
- * \def AMQP_EMPTY_BYTES
- *
- * Deprecated, use \ref amqp_empty_bytes instead
- *
- * \deprecated use \ref amqp_empty_bytes instead
- *
- * \since v0.1
- */
-#define AMQP_EMPTY_BYTES amqp_empty_bytes
-
-/**
- * \def AMQP_EMPTY_TABLE
- *
- * Deprecated, use \ref amqp_empty_table instead
- *
- * \deprecated use \ref amqp_empty_table instead
- *
- * \since v0.1
- */
-#define AMQP_EMPTY_TABLE amqp_empty_table
-
-/**
- * \def AMQP_EMPTY_ARRAY
- *
- * Deprecated, use \ref amqp_empty_array instead
- *
- * \deprecated use \ref amqp_empty_array instead
- *
- * \since v0.1
- */
-#define AMQP_EMPTY_ARRAY amqp_empty_array
-
-/**
- * Initializes an amqp_pool_t memory allocation pool for use
- *
- * Readies an allocation pool for use. An amqp_pool_t
- * must be initialized before use
- *
- * \param [in] pool the amqp_pool_t structure to initialize.
- *              Calling this function on a pool a pool that has
- *              already been initialized will result in undefined
- *              behavior
- * \param [in] pagesize the unit size that the pool will allocate
- *              memory chunks in. Anything allocated against the pool
- *              with a requested size will be carved out of a block
- *              this size. Allocations larger than this will be
- *              allocated individually
- *
- * \sa recycle_amqp_pool(), empty_amqp_pool(), amqp_pool_alloc(),
- *     amqp_pool_alloc_bytes(), amqp_pool_t
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL init_amqp_pool(amqp_pool_t *pool, size_t pagesize);
-
-/**
- * Recycles an amqp_pool_t memory allocation pool
- *
- * Recycles the space allocate by the pool
- *
- * This invalidates all allocations made against the pool before this call is
- * made, any use of any allocations made before recycle_amqp_pool() is called
- * will result in undefined behavior.
- *
- * Note: this may or may not release memory, to force memory to be released
- * call empty_amqp_pool().
- *
- * \param [in] pool the amqp_pool_t to recycle
- *
- * \sa recycle_amqp_pool(), empty_amqp_pool(), amqp_pool_alloc(),
- *      amqp_pool_alloc_bytes()
- *
- * \since v0.1
- *
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL recycle_amqp_pool(amqp_pool_t *pool);
-
-/**
- * Empties an amqp memory pool
- *
- * Releases all memory associated with an allocation pool
- *
- * \param [in] pool the amqp_pool_t to empty
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL empty_amqp_pool(amqp_pool_t *pool);
-
-/**
- * Allocates a block of memory from an amqp_pool_t memory pool
- *
- * Memory will be aligned on a 8-byte boundary. If a 0-length allocation is
- * requested, a NULL pointer will be returned.
- *
- * \param [in] pool the allocation pool to allocate the memory from
- * \param [in] amount the size of the allocation in bytes.
- * \return a pointer to the memory block, or NULL if the allocation cannot
- *          be satisfied.
- *
- * \sa init_amqp_pool(), recycle_amqp_pool(), empty_amqp_pool(),
- *     amqp_pool_alloc_bytes()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-void *AMQP_CALL amqp_pool_alloc(amqp_pool_t *pool, size_t amount);
-
-/**
- * Allocates a block of memory from an amqp_pool_t to an amqp_bytes_t
- *
- * Memory will be aligned on a 8-byte boundary. If a 0-length allocation is
- * requested, output.bytes = NULL.
- *
- * \param [in] pool the allocation pool to allocate the memory from
- * \param [in] amount the size of the allocation in bytes
- * \param [in] output the location to store the pointer. On success
- *              output.bytes will be set to the beginning of the buffer
- *              output.len will be set to amount
- *              On error output.bytes will be set to NULL and output.len
- *              set to 0
- *
- * \sa init_amqp_pool(), recycle_amqp_pool(), empty_amqp_pool(),
- *     amqp_pool_alloc()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_pool_alloc_bytes(amqp_pool_t *pool, size_t amount,
-                                     amqp_bytes_t *output);
-
-/**
- * Wraps a c string in an amqp_bytes_t
- *
- * Takes a string, calculates its length and creates an
- * amqp_bytes_t that points to it. The string is not duplicated.
- *
- * For a given input cstr, The amqp_bytes_t output.bytes is the
- * same as cstr, output.len is the length of the string not including
- * the \0 terminator
- *
- * This function uses strlen() internally so cstr must be properly
- * terminated
- *
- * \param [in] cstr the c string to wrap
- * \return an amqp_bytes_t that describes the string
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_bytes_t AMQP_CALL amqp_cstring_bytes(char const *cstr);
-
-/**
- * Duplicates an amqp_bytes_t buffer.
- *
- * The buffer is cloned and the contents copied.
- *
- * The memory associated with the output is allocated
- * with amqp_bytes_malloc() and should be freed with
- * amqp_bytes_free()
- *
- * \param [in] src
- * \return a clone of the src
- *
- * \sa amqp_bytes_free(), amqp_bytes_malloc()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_bytes_t AMQP_CALL amqp_bytes_malloc_dup(amqp_bytes_t src);
-
-/**
- * Allocates a amqp_bytes_t buffer
- *
- * Creates an amqp_bytes_t buffer of the specified amount, the buffer should be
- * freed using amqp_bytes_free()
- *
- * \param [in] amount the size of the buffer in bytes
- * \returns an amqp_bytes_t with amount bytes allocated.
- *           output.bytes will be set to NULL on error
- *
- * \sa amqp_bytes_free(), amqp_bytes_malloc_dup()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_bytes_t AMQP_CALL amqp_bytes_malloc(size_t amount);
-
-/**
- * Frees an amqp_bytes_t buffer
- *
- * Frees a buffer allocated with amqp_bytes_malloc() or amqp_bytes_malloc_dup()
- *
- * Calling amqp_bytes_free on buffers not allocated with one
- * of those two functions will result in undefined behavior
- *
- * \param [in] bytes the buffer to free
- *
- * \sa amqp_bytes_malloc(), amqp_bytes_malloc_dup()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_bytes_free(amqp_bytes_t bytes);
-
-/**
- * Allocate and initialize a new amqp_connection_state_t object
- *
- * amqp_connection_state_t objects created with this function
- * should be freed with amqp_destroy_connection()
- *
- * \returns an opaque pointer on success, NULL or 0 on failure.
- *
- * \sa amqp_destroy_connection()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_connection_state_t AMQP_CALL amqp_new_connection(void);
-
-/**
- * Get the underlying socket descriptor for the connection
- *
- * \warning Use the socket returned from this function carefully, incorrect use
- * of the socket outside of the library will lead to undefined behavior.
- * Additionally rabbitmq-c may use the socket differently version-to-version,
- * what may work in one version, may break in the next version. Be sure to
- * throughly test any applications that use the socket returned by this
- * function especially when using a newer version of rabbitmq-c
- *
- * \param [in] state the connection object
- * \returns the socket descriptor if one has been set, -1 otherwise
- *
- * \sa amqp_tcp_socket_new(), amqp_ssl_socket_new(), amqp_socket_open()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_get_sockfd(amqp_connection_state_t state);
-
-/**
- * Deprecated, use amqp_tcp_socket_new() or amqp_ssl_socket_new()
- *
- * \deprecated Use amqp_tcp_socket_new() or amqp_ssl_socket_new()
- *
- * Sets the socket descriptor associated with the connection. The socket
- * should be connected to a broker, and should not be read to or written from
- * before calling this function.  A socket descriptor can be created and opened
- * using amqp_open_socket()
- *
- * \param [in] state the connection object
- * \param [in] sockfd the socket
- *
- * \sa amqp_open_socket(), amqp_tcp_socket_new(), amqp_ssl_socket_new()
- *
- * \since v0.1
- */
-AMQP_DEPRECATED(AMQP_PUBLIC_FUNCTION void AMQP_CALL
-                    amqp_set_sockfd(amqp_connection_state_t state, int sockfd));
-
-/**
- * Tune client side parameters
- *
- * \warning This function may call abort() if the connection is in a certain
- *  state. As such it should probably not be called code outside the library.
- *  connection parameters should be specified when calling amqp_login() or
- *  amqp_login_with_properties()
- *
- * This function changes channel_max, frame_max, and heartbeat parameters, on
- * the client side only. It does not try to renegotiate these parameters with
- * the broker. Using this function will lead to unexpected results.
- *
- * \param [in] state the connection object
- * \param [in] channel_max the maximum number of channels.
- *              The largest this can be is 65535
- * \param [in] frame_max the maximum size of an frame.
- *              The smallest this can be is 4096
- *              The largest this can be is 2147483647
- *              Unless you know what you're doing the recommended
- *              size is 131072 or 128KB
- * \param [in] heartbeat the number of seconds between heartbeats
- *
- * \return AMQP_STATUS_OK on success, an amqp_status_enum value otherwise.
- *  Possible error codes include:
- *  - AMQP_STATUS_NO_MEMORY memory allocation failed.
- *  - AMQP_STATUS_TIMER_FAILURE the underlying system timer indicated it
- *    failed.
- *
- * \sa amqp_login(), amqp_login_with_properties()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_tune_connection(amqp_connection_state_t state,
-                                   int channel_max, int frame_max,
-                                   int heartbeat);
-
-/**
- * Get the maximum number of channels the connection can handle
- *
- * The maximum number of channels is set when connection negotiation takes
- * place in amqp_login() or amqp_login_with_properties().
- *
- * \param [in] state the connection object
- * \return the maximum number of channels. 0 if there is no limit
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_get_channel_max(amqp_connection_state_t state);
-
-/**
- * Get the maximum size of an frame the connection can handle
- *
- * The maximum size of an frame is set when connection negotiation takes
- * place in amqp_login() or amqp_login_with_properties().
- *
- * \param [in] state the connection object
- * \return the maximum size of an frame.
- *
- * \since v0.6
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_get_frame_max(amqp_connection_state_t state);
-
-/**
- * Get the number of seconds between heartbeats of the connection
- *
- * The number of seconds between heartbeats is set when connection
- * negotiation takes place in amqp_login() or amqp_login_with_properties().
- *
- * \param [in] state the connection object
- * \return the number of seconds between heartbeats.
- *
- * \since v0.6
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_get_heartbeat(amqp_connection_state_t state);
-
-/**
- * Destroys an amqp_connection_state_t object
- *
- * Destroys a amqp_connection_state_t object that was created with
- * amqp_new_connection(). If the connection with the broker is open, it will be
- * implicitly closed with a reply code of 200 (success). Any memory that
- * would be freed with amqp_maybe_release_buffers() or
- * amqp_maybe_release_buffers_on_channel() will be freed, and use of that
- * memory will caused undefined behavior.
- *
- * \param [in] state the connection object
- * \return AMQP_STATUS_OK on success. amqp_status_enum value failure
- *
- * \sa amqp_new_connection()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_destroy_connection(amqp_connection_state_t state);
-
-/**
- * Process incoming data
- *
- * \warning This is a low-level function intended for those who want to
- *  have greater control over input and output over the socket from the
- *  broker. Correctly using this function requires in-depth knowledge of AMQP
- *  and rabbitmq-c.
- *
- * For a given buffer of data received from the broker, decode the first
- * frame in the buffer. If more than one frame is contained in the input buffer
- * the return value will be less than the received_data size, the caller should
- * adjust received_data buffer descriptor to point to the beginning of the
- * buffer + the return value.
- *
- * \param [in] state the connection object
- * \param [in] received_data a buffer of data received from the broker. The
- *  function will return the number of bytes of the buffer it used. The
- *  function copies these bytes to an internal buffer: this part of the buffer
- *  may be reused after this function successfully completes.
- * \param [in,out] decoded_frame caller should pass in a pointer to an
- *  amqp_frame_t struct. If there is enough data in received_data for a
- *  complete frame, decoded_frame->frame_type will be set to something OTHER
- *  than 0. decoded_frame may contain members pointing to memory owned by
- *  the state object. This memory can be recycled with
- *  amqp_maybe_release_buffers() or amqp_maybe_release_buffers_on_channel().
- * \return number of bytes consumed from received_data or 0 if a 0-length
- *  buffer was passed. A negative return value indicates failure. Possible
- * errors:
- *  - AMQP_STATUS_NO_MEMORY failure in allocating memory. The library is likely
- *    in an indeterminate state making recovery unlikely. Client should note the
- *    error and terminate the application
- *  - AMQP_STATUS_BAD_AMQP_DATA bad AMQP data was received. The connection
- *    should be shutdown immediately
- *  - AMQP_STATUS_UNKNOWN_METHOD: an unknown method was received from the
- *    broker. This is likely a protocol error and the connection should be
- *    shutdown immediately
- *  - AMQP_STATUS_UNKNOWN_CLASS: a properties frame with an unknown class
- *    was received from the broker. This is likely a protocol error and the
- *    connection should be shutdown immediately
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_handle_input(amqp_connection_state_t state,
-                                amqp_bytes_t received_data,
-                                amqp_frame_t *decoded_frame);
-
-/**
- * Check to see if connection memory can be released
- *
- * \deprecated This function is deprecated in favor of
- *  amqp_maybe_release_buffers() or amqp_maybe_release_buffers_on_channel()
- *
- * Checks the state of an amqp_connection_state_t object to see if
- * amqp_release_buffers() can be called successfully.
- *
- * \param [in] state the connection object
- * \returns TRUE if the buffers can be released FALSE otherwise
- *
- * \sa amqp_release_buffers() amqp_maybe_release_buffers()
- *  amqp_maybe_release_buffers_on_channel()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_boolean_t AMQP_CALL amqp_release_buffers_ok(amqp_connection_state_t state);
-
-/**
- * Release amqp_connection_state_t owned memory
- *
- * \deprecated This function is deprecated in favor of
- *  amqp_maybe_release_buffers() or amqp_maybe_release_buffers_on_channel()
- *
- * \warning caller should ensure amqp_release_buffers_ok() returns true before
- *  calling this function. Failure to do so may result in abort() being called.
- *
- * Release memory owned by the amqp_connection_state_t for reuse by the
- * library. Use of any memory returned by the library before this function is
- * called will result in undefined behavior.
- *
- * \note internally rabbitmq-c tries to reuse memory when possible. As a result
- * its possible calling this function may not have a noticeable effect on
- * memory usage.
- *
- * \param [in] state the connection object
- *
- * \sa amqp_release_buffers_ok() amqp_maybe_release_buffers()
- *  amqp_maybe_release_buffers_on_channel()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_release_buffers(amqp_connection_state_t state);
-
-/**
- * Release amqp_connection_state_t owned memory
- *
- * Release memory owned by the amqp_connection_state_t object related to any
- * channel, allowing reuse by the library. Use of any memory returned by the
- * library before this function is called with result in undefined behavior.
- *
- * \note internally rabbitmq-c tries to reuse memory when possible. As a result
- * its possible calling this function may not have a noticeable effect on
- * memory usage.
- *
- * \param [in] state the connection object
- *
- * \sa amqp_maybe_release_buffers_on_channel()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_maybe_release_buffers(amqp_connection_state_t state);
-
-/**
- * Release amqp_connection_state_t owned memory related to a channel
- *
- * Release memory owned by the amqp_connection_state_t object related to the
- * specified channel, allowing reuse by the library. Use of any memory returned
- * the library for a specific channel will result in undefined behavior.
- *
- * \note internally rabbitmq-c tries to reuse memory when possible. As a result
- * its possible calling this function may not have a noticeable effect on
- * memory usage.
- *
- * \param [in] state the connection object
- * \param [in] channel the channel specifier for which memory should be
- *  released. Note that the library does not care about the state of the
- *  channel when calling this function
- *
- * \sa amqp_maybe_release_buffers()
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_maybe_release_buffers_on_channel(
-    amqp_connection_state_t state, amqp_channel_t channel);
-
-/**
- * Send a frame to the broker
- *
- * \param [in] state the connection object
- * \param [in] frame the frame to send to the broker
- * \return AMQP_STATUS_OK on success, an amqp_status_enum value on error.
- *  Possible error codes:
- *  - AMQP_STATUS_BAD_AMQP_DATA the serialized form of the method or
- *    properties was too large to fit in a single AMQP frame, or the
- *    method contains an invalid value. The frame was not sent.
- *  - AMQP_STATUS_TABLE_TOO_BIG the serialized form of an amqp_table_t is
- *    too large to fit in a single AMQP frame. Frame was not sent.
- *  - AMQP_STATUS_UNKNOWN_METHOD an invalid method type was passed in
- *  - AMQP_STATUS_UNKNOWN_CLASS an invalid properties type was passed in
- *  - AMQP_STATUS_TIMER_FAILURE system timer indicated failure. The frame
- *    was sent
- *  - AMQP_STATUS_SOCKET_ERROR
- *  - AMQP_STATUS_SSL_ERROR
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_send_frame(amqp_connection_state_t state,
-                              amqp_frame_t const *frame);
-
-/**
- * Compare two table entries
- *
- * Works just like strcmp(), comparing two the table keys, datatype, then values
- *
- * \param [in] entry1 the entry on the left
- * \param [in] entry2 the entry on the right
- * \return 0 if entries are equal, 0 < if left is greater, 0 > if right is
- * greater
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_table_entry_cmp(void const *entry1, void const *entry2);
-
-/**
- * Open a socket to a remote host
- *
- * \deprecated This function is deprecated in favor of amqp_socket_open()
- *
- * Looks up the hostname, then attempts to open a socket to the host using
- * the specified portnumber. It also sets various options on the socket to
- * improve performance and correctness.
- *
- * \param [in] hostname this can be a hostname or IP address.
- *              Both IPv4 and IPv6 are acceptable
- * \param [in] portnumber the port to connect on. RabbitMQ brokers
- *              listen on port 5672, and 5671 for SSL
- * \return a positive value indicates success and is the sockfd. A negative
- *  value (see amqp_status_enum)is returned on failure. Possible error codes:
- *  - AMQP_STATUS_TCP_SOCKETLIB_INIT_ERROR Initialization of underlying socket
- *    library failed.
- *  - AMQP_STATUS_HOSTNAME_RESOLUTION_FAILED hostname lookup failed.
- *  - AMQP_STATUS_SOCKET_ERROR a socket error occurred. errno or
- *    WSAGetLastError() may return more useful information.
- *
- * \note IPv6 support was added in v0.3
- *
- * \sa amqp_socket_open() amqp_set_sockfd()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_open_socket(char const *hostname, int portnumber);
-
-/**
- * Send initial AMQP header to the broker
- *
- * \warning this is a low level function intended for those who want to
- * interact with the broker at a very low level. Use of this function without
- * understanding what it does will result in AMQP protocol errors.
- *
- * This function sends the AMQP protocol header to the broker.
- *
- * \param [in] state the connection object
- * \return AMQP_STATUS_OK on success, a negative value on failure. Possible
- *  error codes:
- * - AMQP_STATUS_CONNECTION_CLOSED the connection to the broker was closed.
- * - AMQP_STATUS_SOCKET_ERROR a socket error occurred. It is likely the
- *   underlying socket has been closed. errno or WSAGetLastError() may provide
- *   further information.
- * - AMQP_STATUS_SSL_ERROR a SSL error occurred. The connection to the broker
- *   was closed.
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_send_header(amqp_connection_state_t state);
-
-/**
- * Checks to see if there are any incoming frames ready to be read
- *
- * Checks to see if there are any amqp_frame_t objects buffered by the
- * amqp_connection_state_t object. Having one or more frames buffered means
- * that amqp_simple_wait_frame() or amqp_simple_wait_frame_noblock() will
- * return a frame without potentially blocking on a read() call.
- *
- * \param [in] state the connection object
- * \return TRUE if there are frames enqueued, FALSE otherwise
- *
- * \sa amqp_simple_wait_frame() amqp_simple_wait_frame_noblock()
- *  amqp_data_in_buffer()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_boolean_t AMQP_CALL amqp_frames_enqueued(amqp_connection_state_t state);
-
-/**
- * Read a single amqp_frame_t
- *
- * Waits for the next amqp_frame_t frame to be read from the broker.
- * This function has the potential to block for a long time in the case of
- * waiting for a basic.deliver method frame from the broker.
- *
- * The library may buffer frames. When an amqp_connection_state_t object
- * has frames buffered calling amqp_simple_wait_frame() will return an
- * amqp_frame_t without entering a blocking read(). You can test to see if
- * an amqp_connection_state_t object has frames buffered by calling the
- * amqp_frames_enqueued() function.
- *
- * The library has a socket read buffer. When there is data in an
- * amqp_connection_state_t read buffer, amqp_simple_wait_frame() may return an
- * amqp_frame_t without entering a blocking read(). You can test to see if an
- * amqp_connection_state_t object has data in its read buffer by calling the
- * amqp_data_in_buffer() function.
- *
- * \param [in] state the connection object
- * \param [out] decoded_frame the frame
- * \return AMQP_STATUS_OK on success, an amqp_status_enum value
- *  is returned otherwise. Possible errors include:
- *  - AMQP_STATUS_NO_MEMORY failure in allocating memory. The library is likely
- *    in an indeterminate state making recovery unlikely. Client should note the
- *    error and terminate the application
- *  - AMQP_STATUS_BAD_AMQP_DATA bad AMQP data was received. The connection
- *    should be shutdown immediately
- *  - AMQP_STATUS_UNKNOWN_METHOD: an unknown method was received from the
- *    broker. This is likely a protocol error and the connection should be
- *    shutdown immediately
- *  - AMQP_STATUS_UNKNOWN_CLASS: a properties frame with an unknown class
- *    was received from the broker. This is likely a protocol error and the
- *    connection should be shutdown immediately
- *  - AMQP_STATUS_HEARTBEAT_TIMEOUT timed out while waiting for heartbeat
- *    from the broker. The connection has been closed.
- *  - AMQP_STATUS_TIMER_FAILURE system timer indicated failure.
- *  - AMQP_STATUS_SOCKET_ERROR a socket error occurred. The connection has
- *    been closed
- *  - AMQP_STATUS_SSL_ERROR a SSL socket error occurred. The connection has
- *    been closed.
- *
- * \sa amqp_simple_wait_frame_noblock() amqp_frames_enqueued()
- *  amqp_data_in_buffer()
- *
- * \note as of v0.4.0 this function will no longer return heartbeat frames
- *  when enabled by specifying a non-zero heartbeat value in amqp_login().
- *  Heartbeating is handled internally by the library.
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_simple_wait_frame(amqp_connection_state_t state,
-                                     amqp_frame_t *decoded_frame);
-
-/**
- * Read a single amqp_frame_t with a timeout.
- *
- * Waits for the next amqp_frame_t frame to be read from the broker, up to
- * a timespan specified by tv. The function will return AMQP_STATUS_TIMEOUT
- * if the timeout is reached. The tv value is not modified by the function.
- *
- * If a 0 timeval is specified, the function behaves as if its non-blocking: it
- * will test to see if a frame can be read from the broker, and return
- * immediately.
- *
- * If NULL is passed in for tv, the function will behave like
- * amqp_simple_wait_frame() and block until a frame is received from the broker
- *
- * The library may buffer frames.  When an amqp_connection_state_t object
- * has frames buffered calling amqp_simple_wait_frame_noblock() will return an
- * amqp_frame_t without entering a blocking read(). You can test to see if an
- * amqp_connection_state_t object has frames buffered by calling the
- * amqp_frames_enqueued() function.
- *
- * The library has a socket read buffer. When there is data in an
- * amqp_connection_state_t read buffer, amqp_simple_wait_frame_noblock() may
- * return
- * an amqp_frame_t without entering a blocking read(). You can test to see if an
- * amqp_connection_state_t object has data in its read buffer by calling the
- * amqp_data_in_buffer() function.
- *
- * \note This function does not return heartbeat frames. When enabled,
- *  heartbeating is handed internally internally by the library.
- *
- * \param [in,out] state the connection object
- * \param [out] decoded_frame the frame
- * \param [in] tv the maximum time to wait for a frame to be read. Setting
- * tv->tv_sec = 0 and tv->tv_usec = 0 will do a non-blocking read. Specifying
- * NULL for tv will make the function block until a frame is read.
- * \return AMQP_STATUS_OK on success. An amqp_status_enum value is returned
- *  otherwise. Possible errors include:
- *  - AMQP_STATUS_TIMEOUT the timeout was reached while waiting for a frame
- *    from the broker.
- *  - AMQP_STATUS_INVALID_PARAMETER the tv parameter contains an invalid value.
- *  - AMQP_STATUS_NO_MEMORY failure in allocating memory. The library is likely
- *    in an indeterminate state making recovery unlikely. Client should note the
- *    error and terminate the application
- *  - AMQP_STATUS_BAD_AMQP_DATA bad AMQP data was received. The connection
- *    should be shutdown immediately
- *  - AMQP_STATUS_UNKNOWN_METHOD: an unknown method was received from the
- *    broker. This is likely a protocol error and the connection should be
- *    shutdown immediately
- *  - AMQP_STATUS_UNKNOWN_CLASS: a properties frame with an unknown class
- *    was received from the broker. This is likely a protocol error and the
- *    connection should be shutdown immediately
- *  - AMQP_STATUS_HEARTBEAT_TIMEOUT timed out while waiting for heartbeat
- *    from the broker. The connection has been closed.
- *  - AMQP_STATUS_TIMER_FAILURE system timer indicated failure.
- *  - AMQP_STATUS_SOCKET_ERROR a socket error occurred. The connection has
- *    been closed
- *  - AMQP_STATUS_SSL_ERROR a SSL socket error occurred. The connection has
- *    been closed.
- *
- * \sa amqp_simple_wait_frame() amqp_frames_enqueued() amqp_data_in_buffer()
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_simple_wait_frame_noblock(amqp_connection_state_t state,
-                                             amqp_frame_t *decoded_frame,
-                                             struct timeval *tv);
-
-/**
- * Waits for a specific method from the broker
- *
- * \warning You probably don't want to use this function. If this function
- *  doesn't receive exactly the frame requested it closes the whole connection.
- *
- * Waits for a single method on a channel from the broker.
- * If a frame is received that does not match expected_channel
- * or expected_method the program will abort
- *
- * \param [in] state the connection object
- * \param [in] expected_channel the channel that the method should be delivered
- *  on
- * \param [in] expected_method the method to wait for
- * \param [out] output the method
- * \returns AMQP_STATUS_OK on success. An amqp_status_enum value is returned
- *  otherwise. Possible errors include:
- *  - AMQP_STATUS_WRONG_METHOD a frame containing the wrong method, wrong frame
- *    type or wrong channel was received. The connection is closed.
- *  - AMQP_STATUS_NO_MEMORY failure in allocating memory. The library is likely
- *    in an indeterminate state making recovery unlikely. Client should note the
- *    error and terminate the application
- *  - AMQP_STATUS_BAD_AMQP_DATA bad AMQP data was received. The connection
- *    should be shutdown immediately
- *  - AMQP_STATUS_UNKNOWN_METHOD: an unknown method was received from the
- *    broker. This is likely a protocol error and the connection should be
- *    shutdown immediately
- *  - AMQP_STATUS_UNKNOWN_CLASS: a properties frame with an unknown class
- *    was received from the broker. This is likely a protocol error and the
- *    connection should be shutdown immediately
- *  - AMQP_STATUS_HEARTBEAT_TIMEOUT timed out while waiting for heartbeat
- *    from the broker. The connection has been closed.
- *  - AMQP_STATUS_TIMER_FAILURE system timer indicated failure.
- *  - AMQP_STATUS_SOCKET_ERROR a socket error occurred. The connection has
- *    been closed
- *  - AMQP_STATUS_SSL_ERROR a SSL socket error occurred. The connection has
- *    been closed.
- *
- * \since v0.1
- */
-
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_simple_wait_method(amqp_connection_state_t state,
-                                      amqp_channel_t expected_channel,
-                                      amqp_method_number_t expected_method,
-                                      amqp_method_t *output);
-
-/**
- * Sends a method to the broker
- *
- * This is a thin wrapper around amqp_send_frame(), providing a way to send
- * a method to the broker on a specified channel.
- *
- * \param [in] state the connection object
- * \param [in] channel the channel object
- * \param [in] id the method number
- * \param [in] decoded the method object
- * \returns AMQP_STATUS_OK on success, an amqp_status_enum value otherwise.
- *  Possible errors include:
- *  - AMQP_STATUS_BAD_AMQP_DATA the serialized form of the method or
- *    properties was too large to fit in a single AMQP frame, or the
- *    method contains an invalid value. The frame was not sent.
- *  - AMQP_STATUS_TABLE_TOO_BIG the serialized form of an amqp_table_t is
- *    too large to fit in a single AMQP frame. Frame was not sent.
- *  - AMQP_STATUS_UNKNOWN_METHOD an invalid method type was passed in
- *  - AMQP_STATUS_UNKNOWN_CLASS an invalid properties type was passed in
- *  - AMQP_STATUS_TIMER_FAILURE system timer indicated failure. The frame
- *    was sent
- *  - AMQP_STATUS_SOCKET_ERROR
- *  - AMQP_STATUS_SSL_ERROR
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_send_method(amqp_connection_state_t state,
-                               amqp_channel_t channel, amqp_method_number_t id,
-                               void *decoded);
-
-/**
- * Sends a method to the broker and waits for a method response
- *
- * \param [in] state the connection object
- * \param [in] channel the channel object
- * \param [in] request_id the method number of the request
- * \param [in] expected_reply_ids a 0 terminated array of expected response
- *             method numbers
- * \param [in] decoded_request_method the method to be sent to the broker
- * \return a amqp_rpc_reply_t:
- *  - r.reply_type == AMQP_RESPONSE_NORMAL. RPC completed successfully
- *  - r.reply_type == AMQP_RESPONSE_SERVER_EXCEPTION. The broker returned an
- *    exception:
- *    - If r.reply.id == AMQP_CHANNEL_CLOSE_METHOD a channel exception
- *      occurred, cast r.reply.decoded to amqp_channel_close_t* to see details
- *      of the exception. The client should amqp_send_method() a
- *      amqp_channel_close_ok_t. The channel must be re-opened before it
- *      can be used again. Any resources associated with the channel
- *      (auto-delete exchanges, auto-delete queues, consumers) are invalid
- *      and must be recreated before attempting to use them again.
- *    - If r.reply.id == AMQP_CONNECTION_CLOSE_METHOD a connection exception
- *      occurred, cast r.reply.decoded to amqp_connection_close_t* to see
- *      details of the exception. The client amqp_send_method() a
- *      amqp_connection_close_ok_t and disconnect from the broker.
- *  - r.reply_type == AMQP_RESPONSE_LIBRARY_EXCEPTION. An exception occurred
- *    within the library. Examine r.library_error and compare it against
- *    amqp_status_enum values to determine the error.
- *
- * \sa amqp_simple_rpc_decoded()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_rpc_reply_t AMQP_CALL amqp_simple_rpc(
-    amqp_connection_state_t state, amqp_channel_t channel,
-    amqp_method_number_t request_id, amqp_method_number_t *expected_reply_ids,
-    void *decoded_request_method);
-
-/**
- * Sends a method to the broker and waits for a method response
- *
- * \param [in] state the connection object
- * \param [in] channel the channel object
- * \param [in] request_id the method number of the request
- * \param [in] reply_id the method number expected in response
- * \param [in] decoded_request_method the request method
- * \return a pointer to the method returned from the broker, or NULL on error.
- *  On error amqp_get_rpc_reply() will return an amqp_rpc_reply_t with
- *  details on the error that occurred.
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-void *AMQP_CALL amqp_simple_rpc_decoded(amqp_connection_state_t state,
-                                        amqp_channel_t channel,
-                                        amqp_method_number_t request_id,
-                                        amqp_method_number_t reply_id,
-                                        void *decoded_request_method);
-
-/**
- * Get the last global amqp_rpc_reply
- *
- * The API methods corresponding to most synchronous AMQP methods
- * return a pointer to the decoded method result.  Upon error, they
- * return NULL, and we need some way of discovering what, if anything,
- * went wrong. amqp_get_rpc_reply() returns the most recent
- * amqp_rpc_reply_t instance corresponding to such an API operation
- * for the given connection.
- *
- * Only use it for operations that do not themselves return
- * amqp_rpc_reply_t; operations that do return amqp_rpc_reply_t
- * generally do NOT update this per-connection-global amqp_rpc_reply_t
- * instance.
- *
- * \param [in] state the connection object
- * \return the most recent amqp_rpc_reply_t:
- *  - r.reply_type == AMQP_RESPONSE_NORMAL. RPC completed successfully
- *  - r.reply_type == AMQP_RESPONSE_SERVER_EXCEPTION. The broker returned an
- *    exception:
- *    - If r.reply.id == AMQP_CHANNEL_CLOSE_METHOD a channel exception
- *      occurred, cast r.reply.decoded to amqp_channel_close_t* to see details
- *      of the exception. The client should amqp_send_method() a
- *      amqp_channel_close_ok_t. The channel must be re-opened before it
- *      can be used again. Any resources associated with the channel
- *      (auto-delete exchanges, auto-delete queues, consumers) are invalid
- *      and must be recreated before attempting to use them again.
- *    - If r.reply.id == AMQP_CONNECTION_CLOSE_METHOD a connection exception
- *      occurred, cast r.reply.decoded to amqp_connection_close_t* to see
- *      details of the exception. The client amqp_send_method() a
- *      amqp_connection_close_ok_t and disconnect from the broker.
- *  - r.reply_type == AMQP_RESPONSE_LIBRARY_EXCEPTION. An exception occurred
- *    within the library. Examine r.library_error and compare it against
- *    amqp_status_enum values to determine the error.
- *
- * \sa amqp_simple_rpc_decoded()
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_rpc_reply_t AMQP_CALL amqp_get_rpc_reply(amqp_connection_state_t state);
-
-/**
- * Login to the broker
- *
- * After using amqp_open_socket and amqp_set_sockfd, call
- * amqp_login to complete connecting to the broker
- *
- * \param [in] state the connection object
- * \param [in] vhost the virtual host to connect to on the broker. The default
- *              on most brokers is "/"
- * \param [in] channel_max the limit for number of channels for the connection.
- *              0 means no limit, and is a good default
- *              (AMQP_DEFAULT_MAX_CHANNELS)
- *              Note that the maximum number of channels the protocol supports
- *              is 65535 (2^16, with the 0-channel reserved). The server can
- *              set a lower channel_max and then the client will use the lowest
- *              of the two
- * \param [in] frame_max the maximum size of an AMQP frame on the wire to
- *              request of the broker for this connection. 4096 is the minimum
- *              size, 2^31-1 is the maximum, a good default is 131072 (128KB),
- *              or AMQP_DEFAULT_FRAME_SIZE
- * \param [in] heartbeat the number of seconds between heartbeat frames to
- *              request of the broker. A value of 0 disables heartbeats.
- *              Note rabbitmq-c only has partial support for heartbeats, as of
- *              v0.4.0 they are only serviced during amqp_basic_publish() and
- *              amqp_simple_wait_frame()/amqp_simple_wait_frame_noblock()
- * \param [in] sasl_method the SASL method to authenticate with the broker.
- *              followed by the authentication information. The following SASL
- *              methods are implemented:
- *              -  AMQP_SASL_METHOD_PLAIN, the AMQP_SASL_METHOD_PLAIN argument
- *                 should be followed by two arguments in this order:
- *                 const char* username, and const char* password.
- *              -  AMQP_SASL_METHOD_EXTERNAL, the AMQP_SASL_METHOD_EXTERNAL
- *                 argument should be followed one argument:
- *                 const char* identity.
- * \return amqp_rpc_reply_t indicating success or failure.
- *  - r.reply_type == AMQP_RESPONSE_NORMAL. Login completed successfully
- *  - r.reply_type == AMQP_RESPONSE_LIBRARY_EXCEPTION. In most cases errors
- *    from the broker when logging in will be represented by the broker closing
- *    the socket. In this case r.library_error will be set to
- *    AMQP_STATUS_CONNECTION_CLOSED. This error can represent a number of
- *    error conditions including: invalid vhost, authentication failure.
- *  - r.reply_type == AMQP_RESPONSE_SERVER_EXCEPTION. The broker returned an
- *    exception:
- *    - If r.reply.id == AMQP_CHANNEL_CLOSE_METHOD a channel exception
- *      occurred, cast r.reply.decoded to amqp_channel_close_t* to see details
- *      of the exception. The client should amqp_send_method() a
- *      amqp_channel_close_ok_t. The channel must be re-opened before it
- *      can be used again. Any resources associated with the channel
- *      (auto-delete exchanges, auto-delete queues, consumers) are invalid
- *      and must be recreated before attempting to use them again.
- *    - If r.reply.id == AMQP_CONNECTION_CLOSE_METHOD a connection exception
- *      occurred, cast r.reply.decoded to amqp_connection_close_t* to see
- *      details of the exception. The client amqp_send_method() a
- *      amqp_connection_close_ok_t and disconnect from the broker.
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_rpc_reply_t AMQP_CALL amqp_login(amqp_connection_state_t state,
-                                      char const *vhost, int channel_max,
-                                      int frame_max, int heartbeat,
-                                      amqp_sasl_method_enum sasl_method, ...);
-
-/**
- * Login to the broker passing a properties table
- *
- * This function is similar to amqp_login() and differs in that it provides a
- * way to pass client properties to the broker. This is commonly used to
- * negotiate newer protocol features as they are supported by the broker.
- *
- * \param [in] state the connection object
- * \param [in] vhost the virtual host to connect to on the broker. The default
- *              on most brokers is "/"
- * \param [in] channel_max the limit for the number of channels for the
- *             connection.
- *             0 means no limit, and is a good default
- *             (AMQP_DEFAULT_MAX_CHANNELS)
- *             Note that the maximum number of channels the protocol supports
- *             is 65535 (2^16, with the 0-channel reserved). The server can
- *             set a lower channel_max and then the client will use the lowest
- *             of the two
- * \param [in] frame_max the maximum size of an AMQP frame ont he wire to
- *              request of the broker for this connection. 4096 is the minimum
- *              size, 2^31-1 is the maximum, a good default is 131072 (128KB),
- *              or AMQP_DEFAULT_FRAME_SIZE
- * \param [in] heartbeat the number of seconds between heartbeat frame to
- *             request of the broker. A value of 0 disables heartbeats.
- *             Note rabbitmq-c only has partial support for hearts, as of
- *             v0.4.0 heartbeats are only serviced during amqp_basic_publish(),
- *             and amqp_simple_wait_frame()/amqp_simple_wait_frame_noblock()
- * \param [in] properties a table of properties to send the broker.
- * \param [in] sasl_method the SASL method to authenticate with the broker
- *             followed by the authentication information. The following SASL
- *             methods are implemented:
- *             -  AMQP_SASL_METHOD_PLAIN, the AMQP_SASL_METHOD_PLAIN argument
- *                should be followed by two arguments in this order:
- *                const char* username, and const char* password.
- *             -  AMQP_SASL_METHOD_EXTERNAL, the AMQP_SASL_METHOD_EXTERNAL
- *                argument should be followed one argument:
- *                const char* identity.
- * \return amqp_rpc_reply_t indicating success or failure.
- *  - r.reply_type == AMQP_RESPONSE_NORMAL. Login completed successfully
- *  - r.reply_type == AMQP_RESPONSE_LIBRARY_EXCEPTION. In most cases errors
- *    from the broker when logging in will be represented by the broker closing
- *    the socket. In this case r.library_error will be set to
- *    AMQP_STATUS_CONNECTION_CLOSED. This error can represent a number of
- *    error conditions including: invalid vhost, authentication failure.
- *  - r.reply_type == AMQP_RESPONSE_SERVER_EXCEPTION. The broker returned an
- *    exception:
- *    - If r.reply.id == AMQP_CHANNEL_CLOSE_METHOD a channel exception
- *      occurred, cast r.reply.decoded to amqp_channel_close_t* to see details
- *      of the exception. The client should amqp_send_method() a
- *      amqp_channel_close_ok_t. The channel must be re-opened before it
- *      can be used again. Any resources associated with the channel
- *      (auto-delete exchanges, auto-delete queues, consumers) are invalid
- *      and must be recreated before attempting to use them again.
- *    - If r.reply.id == AMQP_CONNECTION_CLOSE_METHOD a connection exception
- *      occurred, cast r.reply.decoded to amqp_connection_close_t* to see
- *      details of the exception. The client amqp_send_method() a
- *      amqp_connection_close_ok_t and disconnect from the broker.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-amqp_rpc_reply_t AMQP_CALL amqp_login_with_properties(
-    amqp_connection_state_t state, char const *vhost, int channel_max,
-    int frame_max, int heartbeat, const amqp_table_t *properties,
-    amqp_sasl_method_enum sasl_method, ...);
-
-struct amqp_basic_properties_t_;
-
-/**
- * Publish a message to the broker
- *
- * Publish a message on an exchange with a routing key.
- *
- * Note that at the AMQ protocol level basic.publish is an async method:
- * this means error conditions that occur on the broker (such as publishing to
- * a non-existent exchange) will not be reflected in the return value of this
- * function.
- *
- * \param [in] state the connection object
- * \param [in] channel the channel identifier
- * \param [in] exchange the exchange on the broker to publish to
- * \param [in] routing_key the routing key to use when publishing the message
- * \param [in] mandatory indicate to the broker that the message MUST be routed
- *              to a queue. If the broker cannot do this it should respond with
- *              a basic.return method.
- * \param [in] immediate indicate to the broker that the message MUST be
- *             delivered to a consumer immediately. If the broker cannot do this
- *             it should respond with a basic.return method.
- * \param [in] properties the properties associated with the message
- * \param [in] body the message body
- * \return AMQP_STATUS_OK on success, amqp_status_enum value on failure. Note
- *         that basic.publish is an async method, the return value from this
- *         function only indicates that the message data was successfully
- *         transmitted to the broker. It does not indicate failures that occur
- *         on the broker, such as publishing to a non-existent exchange.
- *         Possible error values:
- *         - AMQP_STATUS_TIMER_FAILURE: system timer facility returned an error
- *           the message was not sent.
- *         - AMQP_STATUS_HEARTBEAT_TIMEOUT: connection timed out waiting for a
- *           heartbeat from the broker. The message was not sent.
- *         - AMQP_STATUS_NO_MEMORY: memory allocation failed. The message was
- *           not sent.
- *         - AMQP_STATUS_TABLE_TOO_BIG: a table in the properties was too large
- *           to fit in a single frame. Message was not sent.
- *         - AMQP_STATUS_CONNECTION_CLOSED: the connection was closed.
- *         - AMQP_STATUS_SSL_ERROR: a SSL error occurred.
- *         - AMQP_STATUS_TCP_ERROR: a TCP error occurred. errno or
- *           WSAGetLastError() may provide more information
- *
- * Note: this function does heartbeat processing as of v0.4.0
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_basic_publish(
-    amqp_connection_state_t state, amqp_channel_t channel,
-    amqp_bytes_t exchange, amqp_bytes_t routing_key, amqp_boolean_t mandatory,
-    amqp_boolean_t immediate, struct amqp_basic_properties_t_ const *properties,
-    amqp_bytes_t body);
-
-/**
- * Closes an channel
- *
- * \param [in] state the connection object
- * \param [in] channel the channel identifier
- * \param [in] code the reason for closing the channel, AMQP_REPLY_SUCCESS is a
- *             good default
- * \return amqp_rpc_reply_t indicating success or failure
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_rpc_reply_t AMQP_CALL amqp_channel_close(amqp_connection_state_t state,
-                                              amqp_channel_t channel, int code);
-
-/**
- * Closes the entire connection
- *
- * Implicitly closes all channels and informs the broker the connection
- * is being closed, after receiving acknowledgment from the broker it closes
- * the socket.
- *
- * \param [in] state the connection object
- * \param [in] code the reason code for closing the connection.
- *             AMQP_REPLY_SUCCESS is a good default.
- * \return amqp_rpc_reply_t indicating the result
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_rpc_reply_t AMQP_CALL amqp_connection_close(amqp_connection_state_t state,
-                                                 int code);
-
-/**
- * Acknowledges a message
- *
- * Does a basic.ack on a received message
- *
- * \param [in] state the connection object
- * \param [in] channel the channel identifier
- * \param [in] delivery_tag the delivery tag of the message to be ack'd
- * \param [in] multiple if true, ack all messages up to this delivery tag, if
- *              false ack only this delivery tag
- * \return 0 on success,  0 > on failing to send the ack to the broker.
- *            this will not indicate failure if something goes wrong on the
- *            broker
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_basic_ack(amqp_connection_state_t state,
-                             amqp_channel_t channel, uint64_t delivery_tag,
-                             amqp_boolean_t multiple);
-
-/**
- * Do a basic.get
- *
- * Synchonously polls the broker for a message in a queue, and
- * retrieves the message if a message is in the queue.
- *
- * \param [in] state the connection object
- * \param [in] channel the channel identifier to use
- * \param [in] queue the queue name to retrieve from
- * \param [in] no_ack if true the message is automatically ack'ed
- *              if false amqp_basic_ack should be called once the message
- *              retrieved has been processed
- * \return amqp_rpc_reply indicating success or failure
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_rpc_reply_t AMQP_CALL amqp_basic_get(amqp_connection_state_t state,
-                                          amqp_channel_t channel,
-                                          amqp_bytes_t queue,
-                                          amqp_boolean_t no_ack);
-
-/**
- * Do a basic.reject
- *
- * Actively reject a message that has been delivered
- *
- * \param [in] state the connection object
- * \param [in] channel the channel identifier
- * \param [in] delivery_tag the delivery tag of the message to reject
- * \param [in] requeue indicate to the broker whether it should requeue the
- *              message or just discard it.
- * \return 0 on success, 0 > on failing to send the reject method to the broker.
- *          This will not indicate failure if something goes wrong on the
- * broker.
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_basic_reject(amqp_connection_state_t state,
-                                amqp_channel_t channel, uint64_t delivery_tag,
-                                amqp_boolean_t requeue);
-
-/**
- * Do a basic.nack
- *
- * Actively reject a message, this has the same effect as amqp_basic_reject()
- * however, amqp_basic_nack() can negatively acknowledge multiple messages with
- * one call much like amqp_basic_ack() can acknowledge mutliple messages with
- * one call.
- *
- * \param [in] state the connection object
- * \param [in] channel the channel identifier
- * \param [in] delivery_tag the delivery tag of the message to reject
- * \param [in] multiple if set to 1 negatively acknowledge all unacknowledged
- *              messages on this channel.
- * \param [in] requeue indicate to the broker whether it should requeue the
- *              message or dead-letter it.
- * \return AMQP_STATUS_OK on success, an amqp_status_enum value otherwise.
- *
- * \since v0.5.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_basic_nack(amqp_connection_state_t state,
-                              amqp_channel_t channel, uint64_t delivery_tag,
-                              amqp_boolean_t multiple, amqp_boolean_t requeue);
-/**
- * Check to see if there is data left in the receive buffer
- *
- * Can be used to see if there is data still in the buffer, if so
- * calling amqp_simple_wait_frame will not immediately enter a
- * blocking read.
- *
- * \param [in] state the connection object
- * \return true if there is data in the recieve buffer, false otherwise
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-amqp_boolean_t AMQP_CALL amqp_data_in_buffer(amqp_connection_state_t state);
-
-/**
- * Get the error string for the given error code.
- *
- * \deprecated This function has been deprecated in favor of
- *  \ref amqp_error_string2() which returns statically allocated
- *  string which do not need to be freed by the caller.
- *
- * The returned string resides on the heap; the caller is responsible
- * for freeing it.
- *
- * \param [in] err return error code
- * \return the error string
- *
- * \since v0.1
- */
-AMQP_DEPRECATED(
-    AMQP_PUBLIC_FUNCTION char *AMQP_CALL amqp_error_string(int err));
-
-/**
- * Get the error string for the given error code.
- *
- * Get an error string associated with an error code. The string is statically
- * allocated and does not need to be freed
- *
- * \param [in] err the error code
- * \return the error string
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-const char *AMQP_CALL amqp_error_string2(int err);
-
-/**
- * Deserialize an amqp_table_t from AMQP wireformat
- *
- * This is an internal function and is not typically used by
- * client applications
- *
- * \param [in] encoded the buffer containing the serialized data
- * \param [in] pool memory pool used to allocate the table entries from
- * \param [in] output the amqp_table_t structure to fill in. Any existing
- *             entries will be erased
- * \param [in,out] offset The offset into the encoded buffer to start
- *                 reading the serialized table. It will be updated
- *                 by this function to end of the table
- * \return AMQP_STATUS_OK on success, an amqp_status_enum value on failure
- *  Possible error codes:
- *  - AMQP_STATUS_NO_MEMORY out of memory
- *  - AMQP_STATUS_BAD_AMQP_DATA invalid wireformat
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_decode_table(amqp_bytes_t encoded, amqp_pool_t *pool,
-                                amqp_table_t *output, size_t *offset);
-
-/**
- * Serializes an amqp_table_t to the AMQP wireformat
- *
- * This is an internal function and is not typically used by
- * client applications
- *
- * \param [in] encoded the buffer where to serialize the table to
- * \param [in] input the amqp_table_t to serialize
- * \param [in,out] offset The offset into the encoded buffer to start
- *                 writing the serialized table. It will be updated
- *                 by this function to where writing left off
- * \return AMQP_STATUS_OK on success, an amqp_status_enum value on failure
- *  Possible error codes:
- *  - AMQP_STATUS_TABLE_TOO_BIG the serialized form is too large for the
- *    buffer
- *  - AMQP_STATUS_BAD_AMQP_DATA invalid table
- *
- * \since v0.1
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_encode_table(amqp_bytes_t encoded, amqp_table_t *input,
-                                size_t *offset);
-
-/**
- * Create a deep-copy of an amqp_table_t object
- *
- * Creates a deep-copy of an amqp_table_t object, using the provided pool
- * object to allocate the necessary memory. This memory can be freed later by
- * call recycle_amqp_pool(), or empty_amqp_pool()
- *
- * \param [in] original the table to copy
- * \param [in,out] clone the table to copy to
- * \param [in] pool the initialized memory pool to do allocations for the table
- *             from
- * \return AMQP_STATUS_OK on success, amqp_status_enum value on failure.
- *  Possible error values:
- *  - AMQP_STATUS_NO_MEMORY - memory allocation failure.
- *  - AMQP_STATUS_INVALID_PARAMETER - invalid table (e.g., no key name)
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_table_clone(const amqp_table_t *original,
-                               amqp_table_t *clone, amqp_pool_t *pool);
-
-/**
- * A message object
- *
- * \since v0.4.0
- */
-typedef struct amqp_message_t_ {
-  amqp_basic_properties_t properties; /**< message properties */
-  amqp_bytes_t body;                  /**< message body */
-  amqp_pool_t pool;                   /**< pool used to allocate properties */
-} amqp_message_t;
-
-/**
- * Reads the next message on a channel
- *
- * Reads a complete message (header + body) on a specified channel. This
- * function is intended to be used with amqp_basic_get() or when an
- * AMQP_BASIC_DELIVERY_METHOD method is received.
- *
- * \param [in,out] state the connection object
- * \param [in] channel the channel on which to read the message from
- * \param [in,out] message a pointer to a amqp_message_t object. Caller should
- *                 call amqp_message_destroy() when it is done using the
- *                 fields in the message object.  The caller is responsible for
- *                 allocating/destroying the amqp_message_t object itself.
- * \param [in] flags pass in 0. Currently unused.
- * \returns a amqp_rpc_reply_t object. ret.reply_type == AMQP_RESPONSE_NORMAL on
- * success.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-amqp_rpc_reply_t AMQP_CALL amqp_read_message(amqp_connection_state_t state,
-                                             amqp_channel_t channel,
-                                             amqp_message_t *message,
-                                             int flags);
-
-/**
- * Frees memory associated with a amqp_message_t allocated in amqp_read_message
- *
- * \param [in] message
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_destroy_message(amqp_message_t *message);
-
-/**
- * Envelope object
- *
- * \since v0.4.0
- */
-typedef struct amqp_envelope_t_ {
-  amqp_channel_t channel; /**< channel message was delivered on */
-  amqp_bytes_t
-      consumer_tag;      /**< the consumer tag the message was delivered to */
-  uint64_t delivery_tag; /**< the messages delivery tag */
-  amqp_boolean_t redelivered; /**< flag indicating whether this message is being
-                                 redelivered */
-  amqp_bytes_t exchange;      /**< exchange this message was published to */
-  amqp_bytes_t
-      routing_key; /**< the routing key this message was published with */
-  amqp_message_t message; /**< the message */
-} amqp_envelope_t;
-
-/**
- * Wait for and consume a message
- *
- * Waits for a basic.deliver method on any channel, upon receipt of
- * basic.deliver it reads that message, and returns. If any other method is
- * received before basic.deliver, this function will return an amqp_rpc_reply_t
- * with ret.reply_type == AMQP_RESPONSE_LIBRARY_EXCEPTION, and
- * ret.library_error == AMQP_STATUS_UNEXPECTED_STATE. The caller should then
- * call amqp_simple_wait_frame() to read this frame and take appropriate action.
- *
- * This function should be used after starting a consumer with the
- * amqp_basic_consume() function
- *
- * \param [in,out] state the connection object
- * \param [in,out] envelope a pointer to a amqp_envelope_t object. Caller
- *                 should call #amqp_destroy_envelope() when it is done using
- *                 the fields in the envelope object. The caller is responsible
- *                 for allocating/destroying the amqp_envelope_t object itself.
- * \param [in] timeout a timeout to wait for a message delivery. Passing in
- *             NULL will result in blocking behavior.
- * \param [in] flags pass in 0. Currently unused.
- * \returns a amqp_rpc_reply_t object.  ret.reply_type == AMQP_RESPONSE_NORMAL
- *          on success. If ret.reply_type == AMQP_RESPONSE_LIBRARY_EXCEPTION,
- *          and ret.library_error == AMQP_STATUS_UNEXPECTED_STATE, a frame other
- *          than AMQP_BASIC_DELIVER_METHOD was received, the caller should call
- *          amqp_simple_wait_frame() to read this frame and take appropriate
- *          action.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-amqp_rpc_reply_t AMQP_CALL amqp_consume_message(amqp_connection_state_t state,
-                                                amqp_envelope_t *envelope,
-                                                struct timeval *timeout,
-                                                int flags);
-
-/**
- * Frees memory associated with a amqp_envelope_t allocated in
- * amqp_consume_message()
- *
- * \param [in] envelope
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_destroy_envelope(amqp_envelope_t *envelope);
-
-/**
- * Parameters used to connect to the RabbitMQ broker
- *
- * \since v0.2
- */
-struct amqp_connection_info {
-  char *user; /**< the username to authenticate with the broker, default on most
-                 broker is 'guest' */
-  char *password; /**< the password to authenticate with the broker, default on
-                     most brokers is 'guest' */
-  char *host;     /**< the hostname of the broker */
-  char *vhost; /**< the virtual host on the broker to connect to, a good default
-                  is "/" */
-  int port;    /**< the port that the broker is listening on, default on most
-                  brokers is 5672 */
-  amqp_boolean_t ssl;
-};
-
-/**
- * Initialze an amqp_connection_info to default values
- *
- * The default values are:
- * - user: "guest"
- * - password: "guest"
- * - host: "localhost"
- * - vhost: "/"
- * - port: 5672
- *
- * \param [out] parsed the connection info to set defaults on
- *
- * \since v0.2
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL
-    amqp_default_connection_info(struct amqp_connection_info *parsed);
-
-/**
- * Parse a connection URL
- *
- * An amqp connection url takes the form:
- *
- * amqp://[$USERNAME[:$PASSWORD]\@]$HOST[:$PORT]/[$VHOST]
- *
- * Examples:
- *  amqp://guest:guest\@localhost:5672//
- *  amqp://guest:guest\@localhost/myvhost
- *
- *  Any missing parts of the URL will be set to the defaults specified in
- *  amqp_default_connection_info. For amqps: URLs the default port will be set
- *  to 5671 instead of 5672 for non-SSL URLs.
- *
- * \note This function modifies url parameter.
- *
- * \param [in] url URI to parse, note that this parameter is modified by the
- *             function.
- * \param [out] parsed the connection info gleaned from the URI. The char*
- *              members will point to parts of the url input parameter.
- *              Memory management will depend on how the url is allocated.
- * \returns AMQP_STATUS_OK on success, AMQP_STATUS_BAD_URL on failure
- *
- * \since v0.2
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_parse_url(char *url, struct amqp_connection_info *parsed);
-
-/* socket API */
-
-/**
- * Open a socket connection.
- *
- * This function opens a socket connection returned from amqp_tcp_socket_new()
- * or amqp_ssl_socket_new(). This function should be called after setting
- * socket options and prior to assigning the socket to an AMQP connection with
- * amqp_set_socket().
- *
- * \param [in,out] self A socket object.
- * \param [in] host Connect to this host.
- * \param [in] port Connect on this remote port.
- *
- * \return AMQP_STATUS_OK on success, an amqp_status_enum on failure
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_socket_open(amqp_socket_t *self, const char *host, int port);
-
-/**
- * Open a socket connection.
- *
- * This function opens a socket connection returned from amqp_tcp_socket_new()
- * or amqp_ssl_socket_new(). This function should be called after setting
- * socket options and prior to assigning the socket to an AMQP connection with
- * amqp_set_socket().
- *
- * \param [in,out] self A socket object.
- * \param [in] host Connect to this host.
- * \param [in] port Connect on this remote port.
- * \param [in] timeout Max allowed time to spent on opening. If NULL - run in
- *             blocking mode
- *
- * \return AMQP_STATUS_OK on success, an amqp_status_enum on failure.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_socket_open_noblock(amqp_socket_t *self, const char *host,
-                                       int port, struct timeval *timeout);
-
-/**
- * Get the socket descriptor in use by a socket object.
- *
- * Retrieve the underlying socket descriptor. This function can be used to
- * perform low-level socket operations that aren't supported by the socket
- * interface. Use with caution!
- *
- * \param [in,out] self A socket object.
- *
- * \return The underlying socket descriptor, or -1 if there is no socket
- *  descriptor associated with
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_socket_get_sockfd(amqp_socket_t *self);
-
-/**
- * Get the socket object associated with a amqp_connection_state_t
- *
- * \param [in] state the connection object to get the socket from
- * \return a pointer to the socket object, or NULL if one has not been assigned
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-amqp_socket_t *AMQP_CALL amqp_get_socket(amqp_connection_state_t state);
-
-/**
- * Get the broker properties table
- *
- * \param [in] state the connection object
- * \return a pointer to an amqp_table_t containing the properties advertised
- *  by the broker on connection. The connection object owns the table, it
- *  should not be modified.
- *
- * \since v0.5.0
- */
-AMQP_PUBLIC_FUNCTION
-amqp_table_t *AMQP_CALL
-    amqp_get_server_properties(amqp_connection_state_t state);
-
-/**
- * Get the client properties table
- *
- * Get the properties that were passed to the broker on connection.
- *
- * \param [in] state the connection object
- * \return a pointer to an amqp_table_t containing the properties advertised
- *  by the client on connection. The connection object owns the table, it
- *  should not be modified.
- *
- * \since v0.7.0
- */
-AMQP_PUBLIC_FUNCTION
-amqp_table_t *AMQP_CALL
-    amqp_get_client_properties(amqp_connection_state_t state);
-
-/**
- * Get the login handshake timeout.
- *
- * amqp_login and amqp_login_with_properties perform the login handshake with
- * the broker.  This function returns the timeout associated with completing
- * this operation from the client side. This value can be set by using the
- * amqp_set_handshake_timeout.
- *
- * Note that the RabbitMQ broker has configurable timeout for completing the
- * login handshake, the default is 10 seconds.  rabbitmq-c has a default of 12
- * seconds.
- *
- * \param [in] state the connection object
- * \return a struct timeval representing the current login timeout for the state
- *  object. A NULL value represents an infinite timeout. The memory returned is
- *  owned by the connection object.
- *
- * \since v0.9.0
- */
-AMQP_PUBLIC_FUNCTION
-struct timeval *AMQP_CALL
-    amqp_get_handshake_timeout(amqp_connection_state_t state);
-
-/**
- * Set the login handshake timeout.
- *
- * amqp_login and amqp_login_with_properties perform the login handshake with
- * the broker. This function sets the timeout associated with completing this
- * operation from the client side.
- *
- * The timeout must be set before amqp_login or amqp_login_with_properties is
- * called to change from the default timeout.
- *
- * Note that the RabbitMQ broker has a configurable timeout for completing the
- * login handshake, the default is 10 seconds. rabbitmq-c has a default of 12
- * seconds.
- *
- * \param [in] state the connection object
- * \param [in] timeout a struct timeval* representing new login timeout for the
- *  state object. NULL represents an infinite timeout. The value of timeout is
- *  copied internally, the caller is responsible for ownership of the passed in
- *  pointer, it does not need to remain valid after this function is called.
- * \return AMQP_STATUS_OK on success.
- *
- * \since v0.9.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_set_handshake_timeout(amqp_connection_state_t state,
-                                         struct timeval *timeout);
-
-/**
- * Get the RPC timeout
- *
- * Gets the timeout for any RPC-style AMQP command (e.g., amqp_queue_declare).
- * This timeout may be changed at any time by calling \amqp_set_rpc_timeout
- * function with a new timeout. The timeout applies individually to each RPC
- * that is made.
- *
- * The default value is NULL, or an infinite timeout.
- *
- * When an RPC times out, the function will return an error AMQP_STATUS_TIMEOUT,
- * and the connection will be closed.
- *
- *\warning RPC-timeouts are an advanced feature intended to be used to detect
- * dead connections quickly when the rabbitmq-c implementation of heartbeats
- * does not work. Do not use RPC timeouts unless you understand the implications
- * of doing so.
- *
- * \param [in] state the connection object
- * \return a struct timeval representing the current RPC timeout for the state
- * object. A NULL value represents an infinite timeout. The memory returned is
- * owned by the connection object.
- *
- * \since v0.9.0
- */
-AMQP_PUBLIC_FUNCTION
-struct timeval *AMQP_CALL amqp_get_rpc_timeout(amqp_connection_state_t state);
-
-/**
- * Set the RPC timeout
- *
- * Sets the timeout for any RPC-style AMQP command (e.g., amqp_queue_declare).
- * This timeout may be changed at any time by calling this function with a new
- * timeout. The timeout applies individually to each RPC that is made.
- *
- * The default value is NULL, or an infinite timeout.
- *
- * When an RPC times out, the function will return an error AMQP_STATUS_TIMEOUT,
- * and the connection will be closed.
- *
- *\warning RPC-timeouts are an advanced feature intended to be used to detect
- * dead connections quickly when the rabbitmq-c implementation of heartbeats
- * does not work. Do not use RPC timeouts unless you understand the implications
- * of doing so.
- *
- * \param [in] state the connection object
- * \param [in] timeout a struct timeval* representing new RPC timeout for the
- * state object. NULL represents an infinite timeout. The value of timeout is
- * copied internally, the caller is responsible for ownership of the passed
- * pointer, it does not need to remain valid after this function is called.
- * \return AMQP_STATUS_SUCCESS on success.
- *
- * \since v0.9.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_set_rpc_timeout(amqp_connection_state_t state,
-                                   struct timeval *timeout);
-
-AMQP_END_DECLS
-
-#endif /* AMQP_H */

ext/librabbitmq/librabbitmq/amqp_api.c

@@ -1,394 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#ifdef _MSC_VER
-/* MSVC complains about sprintf being deprecated in favor of sprintf_s */
-#define _CRT_SECURE_NO_WARNINGS
-/* MSVC complains about strdup being deprecated in favor of _strdup */
-#define _CRT_NONSTDC_NO_DEPRECATE
-#endif
-
-#include "amqp_private.h"
-#include "amqp_time.h"
-#include <stdarg.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define ERROR_MASK (0x00FF)
-#define ERROR_CATEGORY_MASK (0xFF00)
-
-enum error_category_enum_ { EC_base = 0, EC_tcp = 1, EC_ssl = 2 };
-
-static const char *base_error_strings[] = {
-    /* AMQP_STATUS_OK 0x0 */
-    "operation completed successfully",
-    /* AMQP_STATUS_NO_MEMORY                  -0x0001 */
-    "could not allocate memory",
-    /* AMQP_STATUS_BAD_AQMP_DATA              -0x0002 */
-    "invalid AMQP data",
-    /* AMQP_STATUS_UNKNOWN_CLASS              -0x0003 */
-    "unknown AMQP class id",
-    /* AMQP_STATUS_UNKNOWN_METHOD             -0x0004 */
-    "unknown AMQP method id",
-    /* AMQP_STATUS_HOSTNAME_RESOLUTION_FAILED -0x0005 */
-    "hostname lookup failed",
-    /* AMQP_STATUS_INCOMPATIBLE_AMQP_VERSION  -0x0006 */
-    "incompatible AMQP version",
-    /* AMQP_STATUS_CONNECTION_CLOSED          -0x0007 */
-    "connection closed unexpectedly",
-    /* AMQP_STATUS_BAD_AMQP_URL               -0x0008 */
-    "could not parse AMQP URL",
-    /* AMQP_STATUS_SOCKET_ERROR               -0x0009 */
-    "a socket error occurred",
-    /* AMQP_STATUS_INVALID_PARAMETER          -0x000A */
-    "invalid parameter",
-    /* AMQP_STATUS_TABLE_TOO_BIG              -0x000B */
-    "table too large for buffer",
-    /* AMQP_STATUS_WRONG_METHOD               -0x000C */
-    "unexpected method received",
-    /* AMQP_STATUS_TIMEOUT                    -0x000D */
-    "request timed out",
-    /* AMQP_STATUS_TIMER_FAILED               -0x000E */
-    "system timer has failed",
-    /* AMQP_STATUS_HEARTBEAT_TIMEOUT          -0x000F */
-    "heartbeat timeout, connection closed",
-    /* AMQP_STATUS_UNEXPECTED STATE           -0x0010 */
-    "unexpected protocol state",
-    /* AMQP_STATUS_SOCKET_CLOSED              -0x0011 */
-    "socket is closed",
-    /* AMQP_STATUS_SOCKET_INUSE               -0x0012 */
-    "socket already open",
-    /* AMQP_STATUS_BROKER_UNSUPPORTED_SASL_METHOD -0x00013 */
-    "unsupported sasl method requested",
-    /* AMQP_STATUS_UNSUPPORTED                -0x0014 */
-    "parameter value is unsupported"};
-
-static const char *tcp_error_strings[] = {
-    /* AMQP_STATUS_TCP_ERROR                  -0x0100 */
-    "a socket error occurred",
-    /* AMQP_STATUS_TCP_SOCKETLIB_INIT_ERROR   -0x0101 */
-    "socket library initialization failed"};
-
-static const char *ssl_error_strings[] = {
-    /* AMQP_STATUS_SSL_ERRO  R                -0x0200 */
-    "a SSL error occurred",
-    /* AMQP_STATUS_SSL_HOSTNAME_VERIFY_FAILED -0x0201 */
-    "SSL hostname verification failed",
-    /* AMQP_STATUS_SSL_PEER_VERIFY_FAILED     -0x0202 */
-    "SSL peer cert verification failed",
-    /* AMQP_STATUS_SSL_CONNECTION_FAILED      -0x0203 */
-    "SSL handshake failed"};
-
-static const char *unknown_error_string = "(unknown error)";
-
-const char *amqp_error_string2(int code) {
-  const char *error_string;
-  size_t category = (((-code) & ERROR_CATEGORY_MASK) >> 8);
-  size_t error = (-code) & ERROR_MASK;
-
-  switch (category) {
-    case EC_base:
-      if (error < (sizeof(base_error_strings) / sizeof(char *))) {
-        error_string = base_error_strings[error];
-      } else {
-        error_string = unknown_error_string;
-      }
-      break;
-
-    case EC_tcp:
-      if (error < (sizeof(tcp_error_strings) / sizeof(char *))) {
-        error_string = tcp_error_strings[error];
-      } else {
-        error_string = unknown_error_string;
-      }
-      break;
-
-    case EC_ssl:
-      if (error < (sizeof(ssl_error_strings) / sizeof(char *))) {
-        error_string = ssl_error_strings[error];
-      } else {
-        error_string = unknown_error_string;
-      }
-
-      break;
-
-    default:
-      error_string = unknown_error_string;
-      break;
-  }
-
-  return error_string;
-}
-
-char *amqp_error_string(int code) {
-  /* Previously sometimes clients had to flip the sign on a return value from a
-   * function to get the correct error code. Now, all error codes are negative.
-   * To keep people's legacy code running correctly, we map all error codes to
-   * negative values.
-   *
-   * This is only done with this deprecated function.
-   */
-  if (code > 0) {
-    code = -code;
-  }
-  return strdup(amqp_error_string2(code));
-}
-
-void amqp_abort(const char *fmt, ...) {
-  va_list ap;
-  va_start(ap, fmt);
-  vfprintf(stderr, fmt, ap);
-  va_end(ap);
-  fputc('\n', stderr);
-  abort();
-}
-
-const amqp_bytes_t amqp_empty_bytes = {0, NULL};
-const amqp_table_t amqp_empty_table = {0, NULL};
-const amqp_array_t amqp_empty_array = {0, NULL};
-
-int amqp_basic_publish(amqp_connection_state_t state, amqp_channel_t channel,
-                       amqp_bytes_t exchange, amqp_bytes_t routing_key,
-                       amqp_boolean_t mandatory, amqp_boolean_t immediate,
-                       amqp_basic_properties_t const *properties,
-                       amqp_bytes_t body) {
-  amqp_frame_t f;
-  size_t body_offset;
-  size_t usable_body_payload_size =
-      state->frame_max - (HEADER_SIZE + FOOTER_SIZE);
-  int res;
-  int flagz;
-
-  amqp_basic_publish_t m;
-  amqp_basic_properties_t default_properties;
-
-  m.exchange = exchange;
-  m.routing_key = routing_key;
-  m.mandatory = mandatory;
-  m.immediate = immediate;
-  m.ticket = 0;
-
-  /* TODO(alanxz): this heartbeat check is happening in the wrong place, it
-   * should really be done in amqp_try_send/writev */
-  res = amqp_time_has_past(state->next_recv_heartbeat);
-  if (AMQP_STATUS_TIMER_FAILURE == res) {
-    return res;
-  } else if (AMQP_STATUS_TIMEOUT == res) {
-    res = amqp_try_recv(state);
-    if (AMQP_STATUS_TIMEOUT == res) {
-      return AMQP_STATUS_HEARTBEAT_TIMEOUT;
-    } else if (AMQP_STATUS_OK != res) {
-      return res;
-    }
-  }
-
-  res = amqp_send_method_inner(state, channel, AMQP_BASIC_PUBLISH_METHOD, &m,
-                               AMQP_SF_MORE, amqp_time_infinite());
-  if (res < 0) {
-    return res;
-  }
-
-  if (properties == NULL) {
-    memset(&default_properties, 0, sizeof(default_properties));
-    properties = &default_properties;
-  }
-
-  f.frame_type = AMQP_FRAME_HEADER;
-  f.channel = channel;
-  f.payload.properties.class_id = AMQP_BASIC_CLASS;
-  f.payload.properties.body_size = body.len;
-  f.payload.properties.decoded = (void *)properties;
-
-  if (body.len > 0) {
-    flagz = AMQP_SF_MORE;
-  } else {
-    flagz = AMQP_SF_NONE;
-  }
-  res = amqp_send_frame_inner(state, &f, flagz, amqp_time_infinite());
-  if (res < 0) {
-    return res;
-  }
-
-  body_offset = 0;
-  while (body_offset < body.len) {
-    size_t remaining = body.len - body_offset;
-
-    if (remaining == 0) {
-      break;
-    }
-
-    f.frame_type = AMQP_FRAME_BODY;
-    f.channel = channel;
-    f.payload.body_fragment.bytes = amqp_offset(body.bytes, body_offset);
-    if (remaining >= usable_body_payload_size) {
-      f.payload.body_fragment.len = usable_body_payload_size;
-      flagz = AMQP_SF_MORE;
-    } else {
-      f.payload.body_fragment.len = remaining;
-      flagz = AMQP_SF_NONE;
-    }
-
-    body_offset += f.payload.body_fragment.len;
-    res = amqp_send_frame_inner(state, &f, flagz, amqp_time_infinite());
-    if (res < 0) {
-      return res;
-    }
-  }
-
-  return AMQP_STATUS_OK;
-}
-
-amqp_rpc_reply_t amqp_channel_close(amqp_connection_state_t state,
-                                    amqp_channel_t channel, int code) {
-  char codestr[13];
-  amqp_method_number_t replies[2] = {AMQP_CHANNEL_CLOSE_OK_METHOD, 0};
-  amqp_channel_close_t req;
-
-  if (code < 0 || code > UINT16_MAX) {
-    return amqp_rpc_reply_error(AMQP_STATUS_INVALID_PARAMETER);
-  }
-
-  req.reply_code = (uint16_t)code;
-  req.reply_text.bytes = codestr;
-  req.reply_text.len = sprintf(codestr, "%d", code);
-  req.class_id = 0;
-  req.method_id = 0;
-
-  return amqp_simple_rpc(state, channel, AMQP_CHANNEL_CLOSE_METHOD, replies,
-                         &req);
-}
-
-amqp_rpc_reply_t amqp_connection_close(amqp_connection_state_t state,
-                                       int code) {
-  char codestr[13];
-  amqp_method_number_t replies[2] = {AMQP_CONNECTION_CLOSE_OK_METHOD, 0};
-  amqp_channel_close_t req;
-
-  if (code < 0 || code > UINT16_MAX) {
-    return amqp_rpc_reply_error(AMQP_STATUS_INVALID_PARAMETER);
-  }
-
-  req.reply_code = (uint16_t)code;
-  req.reply_text.bytes = codestr;
-  req.reply_text.len = sprintf(codestr, "%d", code);
-  req.class_id = 0;
-  req.method_id = 0;
-
-  return amqp_simple_rpc(state, 0, AMQP_CONNECTION_CLOSE_METHOD, replies, &req);
-}
-
-int amqp_basic_ack(amqp_connection_state_t state, amqp_channel_t channel,
-                   uint64_t delivery_tag, amqp_boolean_t multiple) {
-  amqp_basic_ack_t m;
-  m.delivery_tag = delivery_tag;
-  m.multiple = multiple;
-  return amqp_send_method(state, channel, AMQP_BASIC_ACK_METHOD, &m);
-}
-
-amqp_rpc_reply_t amqp_basic_get(amqp_connection_state_t state,
-                                amqp_channel_t channel, amqp_bytes_t queue,
-                                amqp_boolean_t no_ack) {
-  amqp_method_number_t replies[] = {AMQP_BASIC_GET_OK_METHOD,
-                                    AMQP_BASIC_GET_EMPTY_METHOD, 0};
-  amqp_basic_get_t req;
-  req.ticket = 0;
-  req.queue = queue;
-  req.no_ack = no_ack;
-
-  state->most_recent_api_result =
-      amqp_simple_rpc(state, channel, AMQP_BASIC_GET_METHOD, replies, &req);
-  return state->most_recent_api_result;
-}
-
-int amqp_basic_reject(amqp_connection_state_t state, amqp_channel_t channel,
-                      uint64_t delivery_tag, amqp_boolean_t requeue) {
-  amqp_basic_reject_t req;
-  req.delivery_tag = delivery_tag;
-  req.requeue = requeue;
-  return amqp_send_method(state, channel, AMQP_BASIC_REJECT_METHOD, &req);
-}
-
-int amqp_basic_nack(amqp_connection_state_t state, amqp_channel_t channel,
-                    uint64_t delivery_tag, amqp_boolean_t multiple,
-                    amqp_boolean_t requeue) {
-  amqp_basic_nack_t req;
-  req.delivery_tag = delivery_tag;
-  req.multiple = multiple;
-  req.requeue = requeue;
-  return amqp_send_method(state, channel, AMQP_BASIC_NACK_METHOD, &req);
-}
-
-struct timeval *amqp_get_handshake_timeout(amqp_connection_state_t state) {
-  return state->handshake_timeout;
-}
-
-int amqp_set_handshake_timeout(amqp_connection_state_t state,
-                               struct timeval *timeout) {
-  if (timeout) {
-    if (timeout->tv_sec < 0 || timeout->tv_usec < 0) {
-      return AMQP_STATUS_INVALID_PARAMETER;
-    }
-    state->internal_handshake_timeout = *timeout;
-    state->handshake_timeout = &state->internal_handshake_timeout;
-  } else {
-    state->handshake_timeout = NULL;
-  }
-
-  return AMQP_STATUS_OK;
-}
-
-struct timeval *amqp_get_rpc_timeout(amqp_connection_state_t state) {
-  return state->rpc_timeout;
-}
-
-int amqp_set_rpc_timeout(amqp_connection_state_t state,
-                         struct timeval *timeout) {
-  if (timeout) {
-    if (timeout->tv_sec < 0 || timeout->tv_usec < 0) {
-      return AMQP_STATUS_INVALID_PARAMETER;
-    }
-    state->rpc_timeout = &state->internal_rpc_timeout;
-    *state->rpc_timeout = *timeout;
-  } else {
-    state->rpc_timeout = NULL;
-  }
-  return AMQP_STATUS_OK;
-}

ext/librabbitmq/librabbitmq/amqp_connection.c

@@ -1,595 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2014
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#ifdef _MSC_VER
-#define _CRT_SECURE_NO_WARNINGS
-#endif
-
-#include "amqp_private.h"
-#include "amqp_tcp_socket.h"
-#include "amqp_time.h"
-#include <errno.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#ifndef AMQP_INITIAL_FRAME_POOL_PAGE_SIZE
-#define AMQP_INITIAL_FRAME_POOL_PAGE_SIZE 65536
-#endif
-
-#ifndef AMQP_INITIAL_INBOUND_SOCK_BUFFER_SIZE
-#define AMQP_INITIAL_INBOUND_SOCK_BUFFER_SIZE 131072
-#endif
-
-#ifndef AMQP_DEFAULT_LOGIN_TIMEOUT_SEC
-#define AMQP_DEFAULT_LOGIN_TIMEOUT_SEC 12
-#endif
-
-#define ENFORCE_STATE(statevec, statenum)                                   \
-  {                                                                         \
-    amqp_connection_state_t _check_state = (statevec);                      \
-    amqp_connection_state_enum _wanted_state = (statenum);                  \
-    if (_check_state->state != _wanted_state)                               \
-      amqp_abort(                                                           \
-          "Programming error: invalid AMQP connection state: expected %d, " \
-          "got %d",                                                         \
-          _wanted_state, _check_state->state);                              \
-  }
-
-amqp_connection_state_t amqp_new_connection(void) {
-  int res;
-  amqp_connection_state_t state = (amqp_connection_state_t)calloc(
-      1, sizeof(struct amqp_connection_state_t_));
-
-  if (state == NULL) {
-    return NULL;
-  }
-
-  res = amqp_tune_connection(state, 0, AMQP_INITIAL_FRAME_POOL_PAGE_SIZE, 0);
-  if (0 != res) {
-    goto out_nomem;
-  }
-
-  state->inbound_buffer.bytes = state->header_buffer;
-  state->inbound_buffer.len = sizeof(state->header_buffer);
-
-  state->state = CONNECTION_STATE_INITIAL;
-  /* the server protocol version response is 8 bytes, which conveniently
-     is also the minimum frame size */
-  state->target_size = 8;
-
-  state->sock_inbound_buffer.len = AMQP_INITIAL_INBOUND_SOCK_BUFFER_SIZE;
-  state->sock_inbound_buffer.bytes =
-      malloc(AMQP_INITIAL_INBOUND_SOCK_BUFFER_SIZE);
-  if (state->sock_inbound_buffer.bytes == NULL) {
-    goto out_nomem;
-  }
-
-  init_amqp_pool(&state->properties_pool, 512);
-
-  /* Use address of the internal_handshake_timeout object by default. */
-  state->internal_handshake_timeout.tv_sec = AMQP_DEFAULT_LOGIN_TIMEOUT_SEC;
-  state->internal_handshake_timeout.tv_usec = 0;
-  state->handshake_timeout = &state->internal_handshake_timeout;
-
-  return state;
-
-out_nomem:
-  free(state->sock_inbound_buffer.bytes);
-  free(state);
-  return NULL;
-}
-
-int amqp_get_sockfd(amqp_connection_state_t state) {
-  return state->socket ? amqp_socket_get_sockfd(state->socket) : -1;
-}
-
-void amqp_set_sockfd(amqp_connection_state_t state, int sockfd) {
-  amqp_socket_t *socket = amqp_tcp_socket_new(state);
-  if (!socket) {
-    amqp_abort("%s", strerror(errno));
-  }
-  amqp_tcp_socket_set_sockfd(socket, sockfd);
-}
-
-void amqp_set_socket(amqp_connection_state_t state, amqp_socket_t *socket) {
-  amqp_socket_delete(state->socket);
-  state->socket = socket;
-}
-
-amqp_socket_t *amqp_get_socket(amqp_connection_state_t state) {
-  return state->socket;
-}
-
-int amqp_tune_connection(amqp_connection_state_t state, int channel_max,
-                         int frame_max, int heartbeat) {
-  void *newbuf;
-  int res;
-
-  ENFORCE_STATE(state, CONNECTION_STATE_IDLE);
-
-  state->channel_max = channel_max;
-  state->frame_max = frame_max;
-
-  state->heartbeat = heartbeat;
-  if (0 > state->heartbeat) {
-    state->heartbeat = 0;
-  }
-
-  res = amqp_time_s_from_now(&state->next_send_heartbeat,
-                             amqp_heartbeat_send(state));
-  if (AMQP_STATUS_OK != res) {
-    return res;
-  }
-  res = amqp_time_s_from_now(&state->next_recv_heartbeat,
-                             amqp_heartbeat_recv(state));
-  if (AMQP_STATUS_OK != res) {
-    return res;
-  }
-
-  state->outbound_buffer.len = frame_max;
-  newbuf = realloc(state->outbound_buffer.bytes, frame_max);
-  if (newbuf == NULL) {
-    return AMQP_STATUS_NO_MEMORY;
-  }
-  state->outbound_buffer.bytes = newbuf;
-
-  return AMQP_STATUS_OK;
-}
-
-int amqp_get_channel_max(amqp_connection_state_t state) {
-  return state->channel_max;
-}
-
-int amqp_get_frame_max(amqp_connection_state_t state) {
-  return state->frame_max;
-}
-
-int amqp_get_heartbeat(amqp_connection_state_t state) {
-  return state->heartbeat;
-}
-
-int amqp_destroy_connection(amqp_connection_state_t state) {
-  int status = AMQP_STATUS_OK;
-  if (state) {
-    int i;
-    for (i = 0; i < POOL_TABLE_SIZE; ++i) {
-      amqp_pool_table_entry_t *entry = state->pool_table[i];
-      while (NULL != entry) {
-        amqp_pool_table_entry_t *todelete = entry;
-        empty_amqp_pool(&entry->pool);
-        entry = entry->next;
-        free(todelete);
-      }
-    }
-
-    free(state->outbound_buffer.bytes);
-    free(state->sock_inbound_buffer.bytes);
-    amqp_socket_delete(state->socket);
-    empty_amqp_pool(&state->properties_pool);
-    free(state);
-  }
-  return status;
-}
-
-static void return_to_idle(amqp_connection_state_t state) {
-  state->inbound_buffer.len = sizeof(state->header_buffer);
-  state->inbound_buffer.bytes = state->header_buffer;
-  state->inbound_offset = 0;
-  state->target_size = HEADER_SIZE;
-  state->state = CONNECTION_STATE_IDLE;
-}
-
-static size_t consume_data(amqp_connection_state_t state,
-                           amqp_bytes_t *received_data) {
-  /* how much data is available and will fit? */
-  size_t bytes_consumed = state->target_size - state->inbound_offset;
-  if (received_data->len < bytes_consumed) {
-    bytes_consumed = received_data->len;
-  }
-
-  memcpy(amqp_offset(state->inbound_buffer.bytes, state->inbound_offset),
-         received_data->bytes, bytes_consumed);
-  state->inbound_offset += bytes_consumed;
-  received_data->bytes = amqp_offset(received_data->bytes, bytes_consumed);
-  received_data->len -= bytes_consumed;
-
-  return bytes_consumed;
-}
-
-int amqp_handle_input(amqp_connection_state_t state, amqp_bytes_t received_data,
-                      amqp_frame_t *decoded_frame) {
-  size_t bytes_consumed;
-  void *raw_frame;
-
-  /* Returning frame_type of zero indicates either insufficient input,
-     or a complete, ignored frame was read. */
-  decoded_frame->frame_type = 0;
-
-  if (received_data.len == 0) {
-    return AMQP_STATUS_OK;
-  }
-
-  if (state->state == CONNECTION_STATE_IDLE) {
-    state->state = CONNECTION_STATE_HEADER;
-  }
-
-  bytes_consumed = consume_data(state, &received_data);
-
-  /* do we have target_size data yet? if not, return with the
-     expectation that more will arrive */
-  if (state->inbound_offset < state->target_size) {
-    return (int)bytes_consumed;
-  }
-
-  raw_frame = state->inbound_buffer.bytes;
-
-  switch (state->state) {
-    case CONNECTION_STATE_INITIAL:
-      /* check for a protocol header from the server */
-      if (memcmp(raw_frame, "AMQP", 4) == 0) {
-        decoded_frame->frame_type = AMQP_PSEUDOFRAME_PROTOCOL_HEADER;
-        decoded_frame->channel = 0;
-
-        decoded_frame->payload.protocol_header.transport_high =
-            amqp_d8(amqp_offset(raw_frame, 4));
-        decoded_frame->payload.protocol_header.transport_low =
-            amqp_d8(amqp_offset(raw_frame, 5));
-        decoded_frame->payload.protocol_header.protocol_version_major =
-            amqp_d8(amqp_offset(raw_frame, 6));
-        decoded_frame->payload.protocol_header.protocol_version_minor =
-            amqp_d8(amqp_offset(raw_frame, 7));
-
-        return_to_idle(state);
-        return (int)bytes_consumed;
-      }
-
-    /* it's not a protocol header; fall through to process it as a
-       regular frame header */
-
-    case CONNECTION_STATE_HEADER: {
-      amqp_channel_t channel;
-      amqp_pool_t *channel_pool;
-      /* frame length is 3 bytes in */
-      channel = amqp_d16(amqp_offset(raw_frame, 1));
-
-      state->target_size =
-          amqp_d32(amqp_offset(raw_frame, 3)) + HEADER_SIZE + FOOTER_SIZE;
-
-      if ((size_t)state->frame_max < state->target_size) {
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-
-      channel_pool = amqp_get_or_create_channel_pool(state, channel);
-      if (NULL == channel_pool) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-
-      amqp_pool_alloc_bytes(channel_pool, state->target_size,
-                            &state->inbound_buffer);
-      if (NULL == state->inbound_buffer.bytes) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      memcpy(state->inbound_buffer.bytes, state->header_buffer, HEADER_SIZE);
-      raw_frame = state->inbound_buffer.bytes;
-
-      state->state = CONNECTION_STATE_BODY;
-
-      bytes_consumed += consume_data(state, &received_data);
-
-      /* do we have target_size data yet? if not, return with the
-         expectation that more will arrive */
-      if (state->inbound_offset < state->target_size) {
-        return (int)bytes_consumed;
-      }
-    }
-    /* fall through to process body */
-
-    case CONNECTION_STATE_BODY: {
-      amqp_bytes_t encoded;
-      int res;
-      amqp_pool_t *channel_pool;
-
-      /* Check frame end marker (footer) */
-      if (amqp_d8(amqp_offset(raw_frame, state->target_size - 1)) !=
-          AMQP_FRAME_END) {
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-
-      decoded_frame->frame_type = amqp_d8(amqp_offset(raw_frame, 0));
-      decoded_frame->channel = amqp_d16(amqp_offset(raw_frame, 1));
-
-      channel_pool =
-          amqp_get_or_create_channel_pool(state, decoded_frame->channel);
-      if (NULL == channel_pool) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-
-      switch (decoded_frame->frame_type) {
-        case AMQP_FRAME_METHOD:
-          decoded_frame->payload.method.id =
-              amqp_d32(amqp_offset(raw_frame, HEADER_SIZE));
-          encoded.bytes = amqp_offset(raw_frame, HEADER_SIZE + 4);
-          encoded.len = state->target_size - HEADER_SIZE - 4 - FOOTER_SIZE;
-
-          res = amqp_decode_method(decoded_frame->payload.method.id,
-                                   channel_pool, encoded,
-                                   &decoded_frame->payload.method.decoded);
-          if (res < 0) {
-            return res;
-          }
-
-          break;
-
-        case AMQP_FRAME_HEADER:
-          decoded_frame->payload.properties.class_id =
-              amqp_d16(amqp_offset(raw_frame, HEADER_SIZE));
-          /* unused 2-byte weight field goes here */
-          decoded_frame->payload.properties.body_size =
-              amqp_d64(amqp_offset(raw_frame, HEADER_SIZE + 4));
-          encoded.bytes = amqp_offset(raw_frame, HEADER_SIZE + 12);
-          encoded.len = state->target_size - HEADER_SIZE - 12 - FOOTER_SIZE;
-          decoded_frame->payload.properties.raw = encoded;
-
-          res = amqp_decode_properties(
-              decoded_frame->payload.properties.class_id, channel_pool, encoded,
-              &decoded_frame->payload.properties.decoded);
-          if (res < 0) {
-            return res;
-          }
-
-          break;
-
-        case AMQP_FRAME_BODY:
-          decoded_frame->payload.body_fragment.len =
-              state->target_size - HEADER_SIZE - FOOTER_SIZE;
-          decoded_frame->payload.body_fragment.bytes =
-              amqp_offset(raw_frame, HEADER_SIZE);
-          break;
-
-        case AMQP_FRAME_HEARTBEAT:
-          break;
-
-        default:
-          /* Ignore the frame */
-          decoded_frame->frame_type = 0;
-          break;
-      }
-
-      return_to_idle(state);
-      return (int)bytes_consumed;
-    }
-
-    default:
-      amqp_abort("Internal error: invalid amqp_connection_state_t->state %d",
-                 state->state);
-  }
-}
-
-amqp_boolean_t amqp_release_buffers_ok(amqp_connection_state_t state) {
-  return (state->state == CONNECTION_STATE_IDLE);
-}
-
-void amqp_release_buffers(amqp_connection_state_t state) {
-  int i;
-  ENFORCE_STATE(state, CONNECTION_STATE_IDLE);
-
-  for (i = 0; i < POOL_TABLE_SIZE; ++i) {
-    amqp_pool_table_entry_t *entry = state->pool_table[i];
-
-    for (; NULL != entry; entry = entry->next) {
-      amqp_maybe_release_buffers_on_channel(state, entry->channel);
-    }
-  }
-}
-
-void amqp_maybe_release_buffers(amqp_connection_state_t state) {
-  if (amqp_release_buffers_ok(state)) {
-    amqp_release_buffers(state);
-  }
-}
-
-void amqp_maybe_release_buffers_on_channel(amqp_connection_state_t state,
-                                           amqp_channel_t channel) {
-  amqp_link_t *queued_link;
-  amqp_pool_t *pool;
-  if (CONNECTION_STATE_IDLE != state->state) {
-    return;
-  }
-
-  queued_link = state->first_queued_frame;
-
-  while (NULL != queued_link) {
-    amqp_frame_t *frame = queued_link->data;
-    if (channel == frame->channel) {
-      return;
-    }
-
-    queued_link = queued_link->next;
-  }
-
-  pool = amqp_get_channel_pool(state, channel);
-
-  if (pool != NULL) {
-    recycle_amqp_pool(pool);
-  }
-}
-
-static int amqp_frame_to_bytes(const amqp_frame_t *frame, amqp_bytes_t buffer,
-                               amqp_bytes_t *encoded) {
-  void *out_frame = buffer.bytes;
-  size_t out_frame_len;
-  int res;
-
-  amqp_e8(frame->frame_type, amqp_offset(out_frame, 0));
-  amqp_e16(frame->channel, amqp_offset(out_frame, 1));
-
-  switch (frame->frame_type) {
-    case AMQP_FRAME_BODY: {
-      const amqp_bytes_t *body = &frame->payload.body_fragment;
-
-      memcpy(amqp_offset(out_frame, HEADER_SIZE), body->bytes, body->len);
-
-      out_frame_len = body->len;
-      break;
-    }
-    case AMQP_FRAME_METHOD: {
-      amqp_bytes_t method_encoded;
-
-      amqp_e32(frame->payload.method.id, amqp_offset(out_frame, HEADER_SIZE));
-
-      method_encoded.bytes = amqp_offset(out_frame, HEADER_SIZE + 4);
-      method_encoded.len = buffer.len - HEADER_SIZE - 4 - FOOTER_SIZE;
-
-      res = amqp_encode_method(frame->payload.method.id,
-                               frame->payload.method.decoded, method_encoded);
-      if (res < 0) {
-        return res;
-      }
-
-      out_frame_len = res + 4;
-      break;
-    }
-
-    case AMQP_FRAME_HEADER: {
-      amqp_bytes_t properties_encoded;
-
-      amqp_e16(frame->payload.properties.class_id,
-               amqp_offset(out_frame, HEADER_SIZE));
-      amqp_e16(0, amqp_offset(out_frame, HEADER_SIZE + 2)); /* "weight" */
-      amqp_e64(frame->payload.properties.body_size,
-               amqp_offset(out_frame, HEADER_SIZE + 4));
-
-      properties_encoded.bytes = amqp_offset(out_frame, HEADER_SIZE + 12);
-      properties_encoded.len = buffer.len - HEADER_SIZE - 12 - FOOTER_SIZE;
-
-      res = amqp_encode_properties(frame->payload.properties.class_id,
-                                   frame->payload.properties.decoded,
-                                   properties_encoded);
-      if (res < 0) {
-        return res;
-      }
-
-      out_frame_len = res + 12;
-      break;
-    }
-
-    case AMQP_FRAME_HEARTBEAT:
-      out_frame_len = 0;
-      break;
-
-    default:
-      return AMQP_STATUS_INVALID_PARAMETER;
-  }
-
-  amqp_e32((uint32_t)out_frame_len, amqp_offset(out_frame, 3));
-  amqp_e8(AMQP_FRAME_END, amqp_offset(out_frame, HEADER_SIZE + out_frame_len));
-
-  encoded->bytes = out_frame;
-  encoded->len = out_frame_len + HEADER_SIZE + FOOTER_SIZE;
-
-  return AMQP_STATUS_OK;
-}
-
-int amqp_send_frame(amqp_connection_state_t state, const amqp_frame_t *frame) {
-  return amqp_send_frame_inner(state, frame, AMQP_SF_NONE,
-                               amqp_time_infinite());
-}
-
-int amqp_send_frame_inner(amqp_connection_state_t state,
-                          const amqp_frame_t *frame, int flags,
-                          amqp_time_t deadline) {
-  int res;
-  ssize_t sent;
-  amqp_bytes_t encoded;
-  amqp_time_t next_timeout;
-
-  /* TODO: if the AMQP_SF_MORE socket optimization can be shown to work
-   * correctly, then this could be un-done so that body-frames are sent as 3
-   * send calls, getting rid of the copy of the body content, some testing
-   * would need to be done to see if this would actually a win for performance.
-   * */
-  res = amqp_frame_to_bytes(frame, state->outbound_buffer, &encoded);
-  if (AMQP_STATUS_OK != res) {
-    return res;
-  }
-
-start_send:
-
-  next_timeout = amqp_time_first(deadline, state->next_recv_heartbeat);
-
-  sent = amqp_try_send(state, encoded.bytes, encoded.len, next_timeout, flags);
-  if (0 > sent) {
-    return (int)sent;
-  }
-
-  /* A partial send has occurred, because of a heartbeat timeout (so try recv
-   * something) or common timeout (so return AMQP_STATUS_TIMEOUT) */
-  if ((ssize_t)encoded.len != sent) {
-    if (amqp_time_equal(next_timeout, deadline)) {
-      /* timeout of method was received, so return from method*/
-      return AMQP_STATUS_TIMEOUT;
-    }
-
-    res = amqp_try_recv(state);
-
-    if (AMQP_STATUS_TIMEOUT == res) {
-      return AMQP_STATUS_HEARTBEAT_TIMEOUT;
-    } else if (AMQP_STATUS_OK != res) {
-      return res;
-    }
-
-    encoded.bytes = (uint8_t *)encoded.bytes + sent;
-    encoded.len -= sent;
-    goto start_send;
-  }
-
-  res = amqp_time_s_from_now(&state->next_send_heartbeat,
-                             amqp_heartbeat_send(state));
-  return res;
-}
-
-amqp_table_t *amqp_get_server_properties(amqp_connection_state_t state) {
-  return &state->server_properties;
-}
-
-amqp_table_t *amqp_get_client_properties(amqp_connection_state_t state) {
-  return &state->client_properties;
-}

ext/librabbitmq/librabbitmq/amqp_consumer.c

@@ -1,307 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2013-2014
- * Alan Antonuk. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-#include "amqp.h"
-#include "amqp_private.h"
-#include "amqp_socket.h"
-
-#include <stdlib.h>
-#include <string.h>
-
-static int amqp_basic_properties_clone(amqp_basic_properties_t *original,
-                                       amqp_basic_properties_t *clone,
-                                       amqp_pool_t *pool) {
-  memset(clone, 0, sizeof(*clone));
-  clone->_flags = original->_flags;
-
-#define CLONE_BYTES_POOL(original, clone, pool)        \
-  if (0 == original.len) {                             \
-    clone = amqp_empty_bytes;                          \
-  } else {                                             \
-    amqp_pool_alloc_bytes(pool, original.len, &clone); \
-    if (NULL == clone.bytes) {                         \
-      return AMQP_STATUS_NO_MEMORY;                    \
-    }                                                  \
-    memcpy(clone.bytes, original.bytes, clone.len);    \
-  }
-
-  if (clone->_flags & AMQP_BASIC_CONTENT_TYPE_FLAG) {
-    CLONE_BYTES_POOL(original->content_type, clone->content_type, pool)
-  }
-
-  if (clone->_flags & AMQP_BASIC_CONTENT_ENCODING_FLAG) {
-    CLONE_BYTES_POOL(original->content_encoding, clone->content_encoding, pool)
-  }
-
-  if (clone->_flags & AMQP_BASIC_HEADERS_FLAG) {
-    int res = amqp_table_clone(&original->headers, &clone->headers, pool);
-    if (AMQP_STATUS_OK != res) {
-      return res;
-    }
-  }
-
-  if (clone->_flags & AMQP_BASIC_DELIVERY_MODE_FLAG) {
-    clone->delivery_mode = original->delivery_mode;
-  }
-
-  if (clone->_flags & AMQP_BASIC_PRIORITY_FLAG) {
-    clone->priority = original->priority;
-  }
-
-  if (clone->_flags & AMQP_BASIC_CORRELATION_ID_FLAG) {
-    CLONE_BYTES_POOL(original->correlation_id, clone->correlation_id, pool)
-  }
-
-  if (clone->_flags & AMQP_BASIC_REPLY_TO_FLAG) {
-    CLONE_BYTES_POOL(original->reply_to, clone->reply_to, pool)
-  }
-
-  if (clone->_flags & AMQP_BASIC_EXPIRATION_FLAG) {
-    CLONE_BYTES_POOL(original->expiration, clone->expiration, pool)
-  }
-
-  if (clone->_flags & AMQP_BASIC_MESSAGE_ID_FLAG) {
-    CLONE_BYTES_POOL(original->message_id, clone->message_id, pool)
-  }
-
-  if (clone->_flags & AMQP_BASIC_TIMESTAMP_FLAG) {
-    clone->timestamp = original->timestamp;
-  }
-
-  if (clone->_flags & AMQP_BASIC_TYPE_FLAG) {
-    CLONE_BYTES_POOL(original->type, clone->type, pool)
-  }
-
-  if (clone->_flags & AMQP_BASIC_USER_ID_FLAG) {
-    CLONE_BYTES_POOL(original->user_id, clone->user_id, pool)
-  }
-
-  if (clone->_flags & AMQP_BASIC_APP_ID_FLAG) {
-    CLONE_BYTES_POOL(original->app_id, clone->app_id, pool)
-  }
-
-  if (clone->_flags & AMQP_BASIC_CLUSTER_ID_FLAG) {
-    CLONE_BYTES_POOL(original->cluster_id, clone->cluster_id, pool)
-  }
-
-  return AMQP_STATUS_OK;
-#undef CLONE_BYTES_POOL
-}
-
-void amqp_destroy_message(amqp_message_t *message) {
-  empty_amqp_pool(&message->pool);
-  amqp_bytes_free(message->body);
-}
-
-void amqp_destroy_envelope(amqp_envelope_t *envelope) {
-  amqp_destroy_message(&envelope->message);
-  amqp_bytes_free(envelope->routing_key);
-  amqp_bytes_free(envelope->exchange);
-  amqp_bytes_free(envelope->consumer_tag);
-}
-
-static int amqp_bytes_malloc_dup_failed(amqp_bytes_t bytes) {
-  if (bytes.len != 0 && bytes.bytes == NULL) {
-    return 1;
-  }
-  return 0;
-}
-
-amqp_rpc_reply_t amqp_consume_message(amqp_connection_state_t state,
-                                      amqp_envelope_t *envelope,
-                                      struct timeval *timeout,
-                                      AMQP_UNUSED int flags) {
-  int res;
-  amqp_frame_t frame;
-  amqp_basic_deliver_t *delivery_method;
-  amqp_rpc_reply_t ret;
-
-  memset(&ret, 0, sizeof(ret));
-  memset(envelope, 0, sizeof(*envelope));
-
-  res = amqp_simple_wait_frame_noblock(state, &frame, timeout);
-  if (AMQP_STATUS_OK != res) {
-    ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-    ret.library_error = res;
-    goto error_out1;
-  }
-
-  if (AMQP_FRAME_METHOD != frame.frame_type ||
-      AMQP_BASIC_DELIVER_METHOD != frame.payload.method.id) {
-    amqp_put_back_frame(state, &frame);
-    ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-    ret.library_error = AMQP_STATUS_UNEXPECTED_STATE;
-    goto error_out1;
-  }
-
-  delivery_method = frame.payload.method.decoded;
-
-  envelope->channel = frame.channel;
-  envelope->consumer_tag = amqp_bytes_malloc_dup(delivery_method->consumer_tag);
-  envelope->delivery_tag = delivery_method->delivery_tag;
-  envelope->redelivered = delivery_method->redelivered;
-  envelope->exchange = amqp_bytes_malloc_dup(delivery_method->exchange);
-  envelope->routing_key = amqp_bytes_malloc_dup(delivery_method->routing_key);
-
-  if (amqp_bytes_malloc_dup_failed(envelope->consumer_tag) ||
-      amqp_bytes_malloc_dup_failed(envelope->exchange) ||
-      amqp_bytes_malloc_dup_failed(envelope->routing_key)) {
-    ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-    ret.library_error = AMQP_STATUS_NO_MEMORY;
-    goto error_out2;
-  }
-
-  ret = amqp_read_message(state, envelope->channel, &envelope->message, 0);
-  if (AMQP_RESPONSE_NORMAL != ret.reply_type) {
-    goto error_out2;
-  }
-
-  ret.reply_type = AMQP_RESPONSE_NORMAL;
-  return ret;
-
-error_out2:
-  amqp_bytes_free(envelope->routing_key);
-  amqp_bytes_free(envelope->exchange);
-  amqp_bytes_free(envelope->consumer_tag);
-error_out1:
-  return ret;
-}
-
-amqp_rpc_reply_t amqp_read_message(amqp_connection_state_t state,
-                                   amqp_channel_t channel,
-                                   amqp_message_t *message,
-                                   AMQP_UNUSED int flags) {
-  amqp_frame_t frame;
-  amqp_rpc_reply_t ret;
-
-  size_t body_read;
-  char *body_read_ptr;
-  int res;
-
-  memset(&ret, 0, sizeof(ret));
-  memset(message, 0, sizeof(*message));
-
-  res = amqp_simple_wait_frame_on_channel(state, channel, &frame);
-  if (AMQP_STATUS_OK != res) {
-    ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-    ret.library_error = res;
-
-    goto error_out1;
-  }
-
-  if (AMQP_FRAME_HEADER != frame.frame_type) {
-    if (AMQP_FRAME_METHOD == frame.frame_type &&
-        (AMQP_CHANNEL_CLOSE_METHOD == frame.payload.method.id ||
-         AMQP_CONNECTION_CLOSE_METHOD == frame.payload.method.id)) {
-
-      ret.reply_type = AMQP_RESPONSE_SERVER_EXCEPTION;
-      ret.reply = frame.payload.method;
-
-    } else {
-      ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-      ret.library_error = AMQP_STATUS_UNEXPECTED_STATE;
-
-      amqp_put_back_frame(state, &frame);
-    }
-    goto error_out1;
-  }
-
-  init_amqp_pool(&message->pool, 4096);
-  res = amqp_basic_properties_clone(frame.payload.properties.decoded,
-                                    &message->properties, &message->pool);
-
-  if (AMQP_STATUS_OK != res) {
-    ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-    ret.library_error = res;
-    goto error_out3;
-  }
-
-  if (0 == frame.payload.properties.body_size) {
-    message->body = amqp_empty_bytes;
-  } else {
-    if (SIZE_MAX < frame.payload.properties.body_size) {
-      ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-      ret.library_error = AMQP_STATUS_NO_MEMORY;
-      goto error_out1;
-    }
-    message->body =
-        amqp_bytes_malloc((size_t)frame.payload.properties.body_size);
-    if (NULL == message->body.bytes) {
-      ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-      ret.library_error = AMQP_STATUS_NO_MEMORY;
-      goto error_out1;
-    }
-  }
-
-  body_read = 0;
-  body_read_ptr = message->body.bytes;
-
-  while (body_read < message->body.len) {
-    res = amqp_simple_wait_frame_on_channel(state, channel, &frame);
-    if (AMQP_STATUS_OK != res) {
-      ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-      ret.library_error = res;
-      goto error_out2;
-    }
-    if (AMQP_FRAME_BODY != frame.frame_type) {
-      if (AMQP_FRAME_METHOD == frame.frame_type &&
-          (AMQP_CHANNEL_CLOSE_METHOD == frame.payload.method.id ||
-           AMQP_CONNECTION_CLOSE_METHOD == frame.payload.method.id)) {
-
-        ret.reply_type = AMQP_RESPONSE_SERVER_EXCEPTION;
-        ret.reply = frame.payload.method;
-      } else {
-        ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-        ret.library_error = AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      goto error_out2;
-    }
-
-    if (body_read + frame.payload.body_fragment.len > message->body.len) {
-      ret.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-      ret.library_error = AMQP_STATUS_BAD_AMQP_DATA;
-      goto error_out2;
-    }
-
-    memcpy(body_read_ptr, frame.payload.body_fragment.bytes,
-           frame.payload.body_fragment.len);
-
-    body_read += frame.payload.body_fragment.len;
-    body_read_ptr += frame.payload.body_fragment.len;
-  }
-
-  ret.reply_type = AMQP_RESPONSE_NORMAL;
-  return ret;
-
-error_out2:
-  amqp_bytes_free(message->body);
-error_out3:
-  empty_amqp_pool(&message->pool);
-error_out1:
-  return ret;
-}

ext/librabbitmq/librabbitmq/amqp_framing.c

@@ -1,2876 +0,0 @@
-/* Generated code. Do not edit. Edit and re-run codegen.py instead.
- *
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include "amqp_private.h"
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-char const *amqp_constant_name(int constantNumber) {
-  switch (constantNumber) {
-    case AMQP_FRAME_METHOD:
-      return "AMQP_FRAME_METHOD";
-    case AMQP_FRAME_HEADER:
-      return "AMQP_FRAME_HEADER";
-    case AMQP_FRAME_BODY:
-      return "AMQP_FRAME_BODY";
-    case AMQP_FRAME_HEARTBEAT:
-      return "AMQP_FRAME_HEARTBEAT";
-    case AMQP_FRAME_MIN_SIZE:
-      return "AMQP_FRAME_MIN_SIZE";
-    case AMQP_FRAME_END:
-      return "AMQP_FRAME_END";
-    case AMQP_REPLY_SUCCESS:
-      return "AMQP_REPLY_SUCCESS";
-    case AMQP_CONTENT_TOO_LARGE:
-      return "AMQP_CONTENT_TOO_LARGE";
-    case AMQP_NO_ROUTE:
-      return "AMQP_NO_ROUTE";
-    case AMQP_NO_CONSUMERS:
-      return "AMQP_NO_CONSUMERS";
-    case AMQP_ACCESS_REFUSED:
-      return "AMQP_ACCESS_REFUSED";
-    case AMQP_NOT_FOUND:
-      return "AMQP_NOT_FOUND";
-    case AMQP_RESOURCE_LOCKED:
-      return "AMQP_RESOURCE_LOCKED";
-    case AMQP_PRECONDITION_FAILED:
-      return "AMQP_PRECONDITION_FAILED";
-    case AMQP_CONNECTION_FORCED:
-      return "AMQP_CONNECTION_FORCED";
-    case AMQP_INVALID_PATH:
-      return "AMQP_INVALID_PATH";
-    case AMQP_FRAME_ERROR:
-      return "AMQP_FRAME_ERROR";
-    case AMQP_SYNTAX_ERROR:
-      return "AMQP_SYNTAX_ERROR";
-    case AMQP_COMMAND_INVALID:
-      return "AMQP_COMMAND_INVALID";
-    case AMQP_CHANNEL_ERROR:
-      return "AMQP_CHANNEL_ERROR";
-    case AMQP_UNEXPECTED_FRAME:
-      return "AMQP_UNEXPECTED_FRAME";
-    case AMQP_RESOURCE_ERROR:
-      return "AMQP_RESOURCE_ERROR";
-    case AMQP_NOT_ALLOWED:
-      return "AMQP_NOT_ALLOWED";
-    case AMQP_NOT_IMPLEMENTED:
-      return "AMQP_NOT_IMPLEMENTED";
-    case AMQP_INTERNAL_ERROR:
-      return "AMQP_INTERNAL_ERROR";
-    default:
-      return "(unknown)";
-  }
-}
-
-amqp_boolean_t amqp_constant_is_hard_error(int constantNumber) {
-  switch (constantNumber) {
-    case AMQP_CONNECTION_FORCED:
-      return 1;
-    case AMQP_INVALID_PATH:
-      return 1;
-    case AMQP_FRAME_ERROR:
-      return 1;
-    case AMQP_SYNTAX_ERROR:
-      return 1;
-    case AMQP_COMMAND_INVALID:
-      return 1;
-    case AMQP_CHANNEL_ERROR:
-      return 1;
-    case AMQP_UNEXPECTED_FRAME:
-      return 1;
-    case AMQP_RESOURCE_ERROR:
-      return 1;
-    case AMQP_NOT_ALLOWED:
-      return 1;
-    case AMQP_NOT_IMPLEMENTED:
-      return 1;
-    case AMQP_INTERNAL_ERROR:
-      return 1;
-    default:
-      return 0;
-  }
-}
-
-char const *amqp_method_name(amqp_method_number_t methodNumber) {
-  switch (methodNumber) {
-    case AMQP_CONNECTION_START_METHOD:
-      return "AMQP_CONNECTION_START_METHOD";
-    case AMQP_CONNECTION_START_OK_METHOD:
-      return "AMQP_CONNECTION_START_OK_METHOD";
-    case AMQP_CONNECTION_SECURE_METHOD:
-      return "AMQP_CONNECTION_SECURE_METHOD";
-    case AMQP_CONNECTION_SECURE_OK_METHOD:
-      return "AMQP_CONNECTION_SECURE_OK_METHOD";
-    case AMQP_CONNECTION_TUNE_METHOD:
-      return "AMQP_CONNECTION_TUNE_METHOD";
-    case AMQP_CONNECTION_TUNE_OK_METHOD:
-      return "AMQP_CONNECTION_TUNE_OK_METHOD";
-    case AMQP_CONNECTION_OPEN_METHOD:
-      return "AMQP_CONNECTION_OPEN_METHOD";
-    case AMQP_CONNECTION_OPEN_OK_METHOD:
-      return "AMQP_CONNECTION_OPEN_OK_METHOD";
-    case AMQP_CONNECTION_CLOSE_METHOD:
-      return "AMQP_CONNECTION_CLOSE_METHOD";
-    case AMQP_CONNECTION_CLOSE_OK_METHOD:
-      return "AMQP_CONNECTION_CLOSE_OK_METHOD";
-    case AMQP_CONNECTION_BLOCKED_METHOD:
-      return "AMQP_CONNECTION_BLOCKED_METHOD";
-    case AMQP_CONNECTION_UNBLOCKED_METHOD:
-      return "AMQP_CONNECTION_UNBLOCKED_METHOD";
-    case AMQP_CHANNEL_OPEN_METHOD:
-      return "AMQP_CHANNEL_OPEN_METHOD";
-    case AMQP_CHANNEL_OPEN_OK_METHOD:
-      return "AMQP_CHANNEL_OPEN_OK_METHOD";
-    case AMQP_CHANNEL_FLOW_METHOD:
-      return "AMQP_CHANNEL_FLOW_METHOD";
-    case AMQP_CHANNEL_FLOW_OK_METHOD:
-      return "AMQP_CHANNEL_FLOW_OK_METHOD";
-    case AMQP_CHANNEL_CLOSE_METHOD:
-      return "AMQP_CHANNEL_CLOSE_METHOD";
-    case AMQP_CHANNEL_CLOSE_OK_METHOD:
-      return "AMQP_CHANNEL_CLOSE_OK_METHOD";
-    case AMQP_ACCESS_REQUEST_METHOD:
-      return "AMQP_ACCESS_REQUEST_METHOD";
-    case AMQP_ACCESS_REQUEST_OK_METHOD:
-      return "AMQP_ACCESS_REQUEST_OK_METHOD";
-    case AMQP_EXCHANGE_DECLARE_METHOD:
-      return "AMQP_EXCHANGE_DECLARE_METHOD";
-    case AMQP_EXCHANGE_DECLARE_OK_METHOD:
-      return "AMQP_EXCHANGE_DECLARE_OK_METHOD";
-    case AMQP_EXCHANGE_DELETE_METHOD:
-      return "AMQP_EXCHANGE_DELETE_METHOD";
-    case AMQP_EXCHANGE_DELETE_OK_METHOD:
-      return "AMQP_EXCHANGE_DELETE_OK_METHOD";
-    case AMQP_EXCHANGE_BIND_METHOD:
-      return "AMQP_EXCHANGE_BIND_METHOD";
-    case AMQP_EXCHANGE_BIND_OK_METHOD:
-      return "AMQP_EXCHANGE_BIND_OK_METHOD";
-    case AMQP_EXCHANGE_UNBIND_METHOD:
-      return "AMQP_EXCHANGE_UNBIND_METHOD";
-    case AMQP_EXCHANGE_UNBIND_OK_METHOD:
-      return "AMQP_EXCHANGE_UNBIND_OK_METHOD";
-    case AMQP_QUEUE_DECLARE_METHOD:
-      return "AMQP_QUEUE_DECLARE_METHOD";
-    case AMQP_QUEUE_DECLARE_OK_METHOD:
-      return "AMQP_QUEUE_DECLARE_OK_METHOD";
-    case AMQP_QUEUE_BIND_METHOD:
-      return "AMQP_QUEUE_BIND_METHOD";
-    case AMQP_QUEUE_BIND_OK_METHOD:
-      return "AMQP_QUEUE_BIND_OK_METHOD";
-    case AMQP_QUEUE_PURGE_METHOD:
-      return "AMQP_QUEUE_PURGE_METHOD";
-    case AMQP_QUEUE_PURGE_OK_METHOD:
-      return "AMQP_QUEUE_PURGE_OK_METHOD";
-    case AMQP_QUEUE_DELETE_METHOD:
-      return "AMQP_QUEUE_DELETE_METHOD";
-    case AMQP_QUEUE_DELETE_OK_METHOD:
-      return "AMQP_QUEUE_DELETE_OK_METHOD";
-    case AMQP_QUEUE_UNBIND_METHOD:
-      return "AMQP_QUEUE_UNBIND_METHOD";
-    case AMQP_QUEUE_UNBIND_OK_METHOD:
-      return "AMQP_QUEUE_UNBIND_OK_METHOD";
-    case AMQP_BASIC_QOS_METHOD:
-      return "AMQP_BASIC_QOS_METHOD";
-    case AMQP_BASIC_QOS_OK_METHOD:
-      return "AMQP_BASIC_QOS_OK_METHOD";
-    case AMQP_BASIC_CONSUME_METHOD:
-      return "AMQP_BASIC_CONSUME_METHOD";
-    case AMQP_BASIC_CONSUME_OK_METHOD:
-      return "AMQP_BASIC_CONSUME_OK_METHOD";
-    case AMQP_BASIC_CANCEL_METHOD:
-      return "AMQP_BASIC_CANCEL_METHOD";
-    case AMQP_BASIC_CANCEL_OK_METHOD:
-      return "AMQP_BASIC_CANCEL_OK_METHOD";
-    case AMQP_BASIC_PUBLISH_METHOD:
-      return "AMQP_BASIC_PUBLISH_METHOD";
-    case AMQP_BASIC_RETURN_METHOD:
-      return "AMQP_BASIC_RETURN_METHOD";
-    case AMQP_BASIC_DELIVER_METHOD:
-      return "AMQP_BASIC_DELIVER_METHOD";
-    case AMQP_BASIC_GET_METHOD:
-      return "AMQP_BASIC_GET_METHOD";
-    case AMQP_BASIC_GET_OK_METHOD:
-      return "AMQP_BASIC_GET_OK_METHOD";
-    case AMQP_BASIC_GET_EMPTY_METHOD:
-      return "AMQP_BASIC_GET_EMPTY_METHOD";
-    case AMQP_BASIC_ACK_METHOD:
-      return "AMQP_BASIC_ACK_METHOD";
-    case AMQP_BASIC_REJECT_METHOD:
-      return "AMQP_BASIC_REJECT_METHOD";
-    case AMQP_BASIC_RECOVER_ASYNC_METHOD:
-      return "AMQP_BASIC_RECOVER_ASYNC_METHOD";
-    case AMQP_BASIC_RECOVER_METHOD:
-      return "AMQP_BASIC_RECOVER_METHOD";
-    case AMQP_BASIC_RECOVER_OK_METHOD:
-      return "AMQP_BASIC_RECOVER_OK_METHOD";
-    case AMQP_BASIC_NACK_METHOD:
-      return "AMQP_BASIC_NACK_METHOD";
-    case AMQP_TX_SELECT_METHOD:
-      return "AMQP_TX_SELECT_METHOD";
-    case AMQP_TX_SELECT_OK_METHOD:
-      return "AMQP_TX_SELECT_OK_METHOD";
-    case AMQP_TX_COMMIT_METHOD:
-      return "AMQP_TX_COMMIT_METHOD";
-    case AMQP_TX_COMMIT_OK_METHOD:
-      return "AMQP_TX_COMMIT_OK_METHOD";
-    case AMQP_TX_ROLLBACK_METHOD:
-      return "AMQP_TX_ROLLBACK_METHOD";
-    case AMQP_TX_ROLLBACK_OK_METHOD:
-      return "AMQP_TX_ROLLBACK_OK_METHOD";
-    case AMQP_CONFIRM_SELECT_METHOD:
-      return "AMQP_CONFIRM_SELECT_METHOD";
-    case AMQP_CONFIRM_SELECT_OK_METHOD:
-      return "AMQP_CONFIRM_SELECT_OK_METHOD";
-    default:
-      return NULL;
-  }
-}
-
-amqp_boolean_t amqp_method_has_content(amqp_method_number_t methodNumber) {
-  switch (methodNumber) {
-    case AMQP_BASIC_PUBLISH_METHOD:
-      return 1;
-    case AMQP_BASIC_RETURN_METHOD:
-      return 1;
-    case AMQP_BASIC_DELIVER_METHOD:
-      return 1;
-    case AMQP_BASIC_GET_OK_METHOD:
-      return 1;
-    default:
-      return 0;
-  }
-}
-
-int amqp_decode_method(amqp_method_number_t methodNumber, amqp_pool_t *pool,
-                       amqp_bytes_t encoded, void **decoded) {
-  size_t offset = 0;
-  uint8_t bit_buffer;
-
-  switch (methodNumber) {
-    case AMQP_CONNECTION_START_METHOD: {
-      amqp_connection_start_t *m = (amqp_connection_start_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_connection_start_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_8(encoded, &offset, &m->version_major))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_8(encoded, &offset, &m->version_minor))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        int res =
-            amqp_decode_table(encoded, pool, &(m->server_properties), &offset);
-        if (res < 0) return res;
-      }
-      {
-        uint32_t len;
-        if (!amqp_decode_32(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->mechanisms, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint32_t len;
-        if (!amqp_decode_32(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->locales, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_START_OK_METHOD: {
-      amqp_connection_start_ok_t *m =
-          (amqp_connection_start_ok_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_connection_start_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        int res =
-            amqp_decode_table(encoded, pool, &(m->client_properties), &offset);
-        if (res < 0) return res;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->mechanism, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint32_t len;
-        if (!amqp_decode_32(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->response, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->locale, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_SECURE_METHOD: {
-      amqp_connection_secure_t *m = (amqp_connection_secure_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_connection_secure_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint32_t len;
-        if (!amqp_decode_32(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->challenge, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_SECURE_OK_METHOD: {
-      amqp_connection_secure_ok_t *m =
-          (amqp_connection_secure_ok_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_connection_secure_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint32_t len;
-        if (!amqp_decode_32(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->response, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_TUNE_METHOD: {
-      amqp_connection_tune_t *m = (amqp_connection_tune_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_connection_tune_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->channel_max))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_32(encoded, &offset, &m->frame_max))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_16(encoded, &offset, &m->heartbeat))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_TUNE_OK_METHOD: {
-      amqp_connection_tune_ok_t *m =
-          (amqp_connection_tune_ok_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_connection_tune_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->channel_max))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_32(encoded, &offset, &m->frame_max))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_16(encoded, &offset, &m->heartbeat))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_OPEN_METHOD: {
-      amqp_connection_open_t *m = (amqp_connection_open_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_connection_open_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->virtual_host, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->capabilities, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->insist = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_OPEN_OK_METHOD: {
-      amqp_connection_open_ok_t *m =
-          (amqp_connection_open_ok_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_connection_open_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->known_hosts, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_CLOSE_METHOD: {
-      amqp_connection_close_t *m = (amqp_connection_close_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_connection_close_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->reply_code))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->reply_text, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->class_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_16(encoded, &offset, &m->method_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_CLOSE_OK_METHOD: {
-      amqp_connection_close_ok_t *m =
-          (amqp_connection_close_ok_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_connection_close_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_BLOCKED_METHOD: {
-      amqp_connection_blocked_t *m =
-          (amqp_connection_blocked_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_connection_blocked_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->reason, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONNECTION_UNBLOCKED_METHOD: {
-      amqp_connection_unblocked_t *m =
-          (amqp_connection_unblocked_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_connection_unblocked_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CHANNEL_OPEN_METHOD: {
-      amqp_channel_open_t *m = (amqp_channel_open_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_channel_open_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->out_of_band, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CHANNEL_OPEN_OK_METHOD: {
-      amqp_channel_open_ok_t *m = (amqp_channel_open_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_channel_open_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint32_t len;
-        if (!amqp_decode_32(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->channel_id, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CHANNEL_FLOW_METHOD: {
-      amqp_channel_flow_t *m = (amqp_channel_flow_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_channel_flow_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->active = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CHANNEL_FLOW_OK_METHOD: {
-      amqp_channel_flow_ok_t *m = (amqp_channel_flow_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_channel_flow_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->active = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CHANNEL_CLOSE_METHOD: {
-      amqp_channel_close_t *m = (amqp_channel_close_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_channel_close_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->reply_code))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->reply_text, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->class_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_16(encoded, &offset, &m->method_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CHANNEL_CLOSE_OK_METHOD: {
-      amqp_channel_close_ok_t *m = (amqp_channel_close_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_channel_close_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_ACCESS_REQUEST_METHOD: {
-      amqp_access_request_t *m = (amqp_access_request_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_access_request_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->realm, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->exclusive = (bit_buffer & (1 << 0)) ? 1 : 0;
-      m->passive = (bit_buffer & (1 << 1)) ? 1 : 0;
-      m->active = (bit_buffer & (1 << 2)) ? 1 : 0;
-      m->write = (bit_buffer & (1 << 3)) ? 1 : 0;
-      m->read = (bit_buffer & (1 << 4)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_ACCESS_REQUEST_OK_METHOD: {
-      amqp_access_request_ok_t *m = (amqp_access_request_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_access_request_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_EXCHANGE_DECLARE_METHOD: {
-      amqp_exchange_declare_t *m = (amqp_exchange_declare_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_exchange_declare_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->exchange, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->type, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->passive = (bit_buffer & (1 << 0)) ? 1 : 0;
-      m->durable = (bit_buffer & (1 << 1)) ? 1 : 0;
-      m->auto_delete = (bit_buffer & (1 << 2)) ? 1 : 0;
-      m->internal = (bit_buffer & (1 << 3)) ? 1 : 0;
-      m->nowait = (bit_buffer & (1 << 4)) ? 1 : 0;
-      {
-        int res = amqp_decode_table(encoded, pool, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_EXCHANGE_DECLARE_OK_METHOD: {
-      amqp_exchange_declare_ok_t *m =
-          (amqp_exchange_declare_ok_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_exchange_declare_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_EXCHANGE_DELETE_METHOD: {
-      amqp_exchange_delete_t *m = (amqp_exchange_delete_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_exchange_delete_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->exchange, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->if_unused = (bit_buffer & (1 << 0)) ? 1 : 0;
-      m->nowait = (bit_buffer & (1 << 1)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_EXCHANGE_DELETE_OK_METHOD: {
-      amqp_exchange_delete_ok_t *m =
-          (amqp_exchange_delete_ok_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_exchange_delete_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_EXCHANGE_BIND_METHOD: {
-      amqp_exchange_bind_t *m = (amqp_exchange_bind_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_exchange_bind_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->destination, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->source, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->routing_key, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->nowait = (bit_buffer & (1 << 0)) ? 1 : 0;
-      {
-        int res = amqp_decode_table(encoded, pool, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_EXCHANGE_BIND_OK_METHOD: {
-      amqp_exchange_bind_ok_t *m = (amqp_exchange_bind_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_exchange_bind_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_EXCHANGE_UNBIND_METHOD: {
-      amqp_exchange_unbind_t *m = (amqp_exchange_unbind_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_exchange_unbind_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->destination, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->source, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->routing_key, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->nowait = (bit_buffer & (1 << 0)) ? 1 : 0;
-      {
-        int res = amqp_decode_table(encoded, pool, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_EXCHANGE_UNBIND_OK_METHOD: {
-      amqp_exchange_unbind_ok_t *m =
-          (amqp_exchange_unbind_ok_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_exchange_unbind_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_DECLARE_METHOD: {
-      amqp_queue_declare_t *m = (amqp_queue_declare_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_declare_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->queue, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->passive = (bit_buffer & (1 << 0)) ? 1 : 0;
-      m->durable = (bit_buffer & (1 << 1)) ? 1 : 0;
-      m->exclusive = (bit_buffer & (1 << 2)) ? 1 : 0;
-      m->auto_delete = (bit_buffer & (1 << 3)) ? 1 : 0;
-      m->nowait = (bit_buffer & (1 << 4)) ? 1 : 0;
-      {
-        int res = amqp_decode_table(encoded, pool, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_DECLARE_OK_METHOD: {
-      amqp_queue_declare_ok_t *m = (amqp_queue_declare_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_declare_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->queue, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_32(encoded, &offset, &m->message_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_32(encoded, &offset, &m->consumer_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_BIND_METHOD: {
-      amqp_queue_bind_t *m =
-          (amqp_queue_bind_t *)amqp_pool_alloc(pool, sizeof(amqp_queue_bind_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->queue, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->exchange, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->routing_key, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->nowait = (bit_buffer & (1 << 0)) ? 1 : 0;
-      {
-        int res = amqp_decode_table(encoded, pool, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_BIND_OK_METHOD: {
-      amqp_queue_bind_ok_t *m = (amqp_queue_bind_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_bind_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_PURGE_METHOD: {
-      amqp_queue_purge_t *m = (amqp_queue_purge_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_purge_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->queue, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->nowait = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_PURGE_OK_METHOD: {
-      amqp_queue_purge_ok_t *m = (amqp_queue_purge_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_purge_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_32(encoded, &offset, &m->message_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_DELETE_METHOD: {
-      amqp_queue_delete_t *m = (amqp_queue_delete_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_delete_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->queue, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->if_unused = (bit_buffer & (1 << 0)) ? 1 : 0;
-      m->if_empty = (bit_buffer & (1 << 1)) ? 1 : 0;
-      m->nowait = (bit_buffer & (1 << 2)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_DELETE_OK_METHOD: {
-      amqp_queue_delete_ok_t *m = (amqp_queue_delete_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_delete_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_32(encoded, &offset, &m->message_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_UNBIND_METHOD: {
-      amqp_queue_unbind_t *m = (amqp_queue_unbind_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_unbind_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->queue, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->exchange, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->routing_key, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        int res = amqp_decode_table(encoded, pool, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_QUEUE_UNBIND_OK_METHOD: {
-      amqp_queue_unbind_ok_t *m = (amqp_queue_unbind_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_unbind_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_QOS_METHOD: {
-      amqp_basic_qos_t *m =
-          (amqp_basic_qos_t *)amqp_pool_alloc(pool, sizeof(amqp_basic_qos_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_32(encoded, &offset, &m->prefetch_size))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_16(encoded, &offset, &m->prefetch_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->global = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_QOS_OK_METHOD: {
-      amqp_basic_qos_ok_t *m = (amqp_basic_qos_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_qos_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_CONSUME_METHOD: {
-      amqp_basic_consume_t *m = (amqp_basic_consume_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_consume_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->queue, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->consumer_tag, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->no_local = (bit_buffer & (1 << 0)) ? 1 : 0;
-      m->no_ack = (bit_buffer & (1 << 1)) ? 1 : 0;
-      m->exclusive = (bit_buffer & (1 << 2)) ? 1 : 0;
-      m->nowait = (bit_buffer & (1 << 3)) ? 1 : 0;
-      {
-        int res = amqp_decode_table(encoded, pool, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_CONSUME_OK_METHOD: {
-      amqp_basic_consume_ok_t *m = (amqp_basic_consume_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_consume_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->consumer_tag, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_CANCEL_METHOD: {
-      amqp_basic_cancel_t *m = (amqp_basic_cancel_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_cancel_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->consumer_tag, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->nowait = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_CANCEL_OK_METHOD: {
-      amqp_basic_cancel_ok_t *m = (amqp_basic_cancel_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_cancel_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->consumer_tag, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_PUBLISH_METHOD: {
-      amqp_basic_publish_t *m = (amqp_basic_publish_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_publish_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->exchange, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->routing_key, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->mandatory = (bit_buffer & (1 << 0)) ? 1 : 0;
-      m->immediate = (bit_buffer & (1 << 1)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_RETURN_METHOD: {
-      amqp_basic_return_t *m = (amqp_basic_return_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_return_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->reply_code))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->reply_text, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->exchange, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->routing_key, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_DELIVER_METHOD: {
-      amqp_basic_deliver_t *m = (amqp_basic_deliver_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_deliver_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->consumer_tag, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_64(encoded, &offset, &m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->redelivered = (bit_buffer & (1 << 0)) ? 1 : 0;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->exchange, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->routing_key, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_GET_METHOD: {
-      amqp_basic_get_t *m =
-          (amqp_basic_get_t *)amqp_pool_alloc(pool, sizeof(amqp_basic_get_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_16(encoded, &offset, &m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->queue, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->no_ack = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_GET_OK_METHOD: {
-      amqp_basic_get_ok_t *m = (amqp_basic_get_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_get_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_64(encoded, &offset, &m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->redelivered = (bit_buffer & (1 << 0)) ? 1 : 0;
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->exchange, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->routing_key, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (!amqp_decode_32(encoded, &offset, &m->message_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_GET_EMPTY_METHOD: {
-      amqp_basic_get_empty_t *m = (amqp_basic_get_empty_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_get_empty_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      {
-        uint8_t len;
-        if (!amqp_decode_8(encoded, &offset, &len) ||
-            !amqp_decode_bytes(encoded, &offset, &m->cluster_id, len))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_ACK_METHOD: {
-      amqp_basic_ack_t *m =
-          (amqp_basic_ack_t *)amqp_pool_alloc(pool, sizeof(amqp_basic_ack_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_64(encoded, &offset, &m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->multiple = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_REJECT_METHOD: {
-      amqp_basic_reject_t *m = (amqp_basic_reject_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_reject_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_64(encoded, &offset, &m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->requeue = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_RECOVER_ASYNC_METHOD: {
-      amqp_basic_recover_async_t *m =
-          (amqp_basic_recover_async_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_basic_recover_async_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->requeue = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_RECOVER_METHOD: {
-      amqp_basic_recover_t *m = (amqp_basic_recover_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_recover_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->requeue = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_RECOVER_OK_METHOD: {
-      amqp_basic_recover_ok_t *m = (amqp_basic_recover_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_recover_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_BASIC_NACK_METHOD: {
-      amqp_basic_nack_t *m =
-          (amqp_basic_nack_t *)amqp_pool_alloc(pool, sizeof(amqp_basic_nack_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_64(encoded, &offset, &m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->multiple = (bit_buffer & (1 << 0)) ? 1 : 0;
-      m->requeue = (bit_buffer & (1 << 1)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_TX_SELECT_METHOD: {
-      amqp_tx_select_t *m =
-          (amqp_tx_select_t *)amqp_pool_alloc(pool, sizeof(amqp_tx_select_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_TX_SELECT_OK_METHOD: {
-      amqp_tx_select_ok_t *m = (amqp_tx_select_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_tx_select_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_TX_COMMIT_METHOD: {
-      amqp_tx_commit_t *m =
-          (amqp_tx_commit_t *)amqp_pool_alloc(pool, sizeof(amqp_tx_commit_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_TX_COMMIT_OK_METHOD: {
-      amqp_tx_commit_ok_t *m = (amqp_tx_commit_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_tx_commit_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_TX_ROLLBACK_METHOD: {
-      amqp_tx_rollback_t *m = (amqp_tx_rollback_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_tx_rollback_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_TX_ROLLBACK_OK_METHOD: {
-      amqp_tx_rollback_ok_t *m = (amqp_tx_rollback_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_tx_rollback_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONFIRM_SELECT_METHOD: {
-      amqp_confirm_select_t *m = (amqp_confirm_select_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_confirm_select_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      if (!amqp_decode_8(encoded, &offset, &bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      m->nowait = (bit_buffer & (1 << 0)) ? 1 : 0;
-      *decoded = m;
-      return 0;
-    }
-    case AMQP_CONFIRM_SELECT_OK_METHOD: {
-      amqp_confirm_select_ok_t *m = (amqp_confirm_select_ok_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_confirm_select_ok_t));
-      if (m == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      *decoded = m;
-      return 0;
-    }
-    default:
-      return AMQP_STATUS_UNKNOWN_METHOD;
-  }
-}
-
-int amqp_decode_properties(uint16_t class_id, amqp_pool_t *pool,
-                           amqp_bytes_t encoded, void **decoded) {
-  size_t offset = 0;
-
-  amqp_flags_t flags = 0;
-  int flagword_index = 0;
-  uint16_t partial_flags;
-
-  do {
-    if (!amqp_decode_16(encoded, &offset, &partial_flags))
-      return AMQP_STATUS_BAD_AMQP_DATA;
-    flags |= (partial_flags << (flagword_index * 16));
-    flagword_index++;
-  } while (partial_flags & 1);
-
-  switch (class_id) {
-    case 10: {
-      amqp_connection_properties_t *p =
-          (amqp_connection_properties_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_connection_properties_t));
-      if (p == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      p->_flags = flags;
-      *decoded = p;
-      return 0;
-    }
-    case 20: {
-      amqp_channel_properties_t *p =
-          (amqp_channel_properties_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_channel_properties_t));
-      if (p == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      p->_flags = flags;
-      *decoded = p;
-      return 0;
-    }
-    case 30: {
-      amqp_access_properties_t *p = (amqp_access_properties_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_access_properties_t));
-      if (p == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      p->_flags = flags;
-      *decoded = p;
-      return 0;
-    }
-    case 40: {
-      amqp_exchange_properties_t *p =
-          (amqp_exchange_properties_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_exchange_properties_t));
-      if (p == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      p->_flags = flags;
-      *decoded = p;
-      return 0;
-    }
-    case 50: {
-      amqp_queue_properties_t *p = (amqp_queue_properties_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_queue_properties_t));
-      if (p == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      p->_flags = flags;
-      *decoded = p;
-      return 0;
-    }
-    case 60: {
-      amqp_basic_properties_t *p = (amqp_basic_properties_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_basic_properties_t));
-      if (p == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      p->_flags = flags;
-      if (flags & AMQP_BASIC_CONTENT_TYPE_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->content_type, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      if (flags & AMQP_BASIC_CONTENT_ENCODING_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->content_encoding, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      if (flags & AMQP_BASIC_HEADERS_FLAG) {
-        {
-          int res = amqp_decode_table(encoded, pool, &(p->headers), &offset);
-          if (res < 0) return res;
-        }
-      }
-      if (flags & AMQP_BASIC_DELIVERY_MODE_FLAG) {
-        if (!amqp_decode_8(encoded, &offset, &p->delivery_mode))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_PRIORITY_FLAG) {
-        if (!amqp_decode_8(encoded, &offset, &p->priority))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_CORRELATION_ID_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->correlation_id, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      if (flags & AMQP_BASIC_REPLY_TO_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->reply_to, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      if (flags & AMQP_BASIC_EXPIRATION_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->expiration, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      if (flags & AMQP_BASIC_MESSAGE_ID_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->message_id, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      if (flags & AMQP_BASIC_TIMESTAMP_FLAG) {
-        if (!amqp_decode_64(encoded, &offset, &p->timestamp))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_TYPE_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->type, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      if (flags & AMQP_BASIC_USER_ID_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->user_id, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      if (flags & AMQP_BASIC_APP_ID_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->app_id, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      if (flags & AMQP_BASIC_CLUSTER_ID_FLAG) {
-        {
-          uint8_t len;
-          if (!amqp_decode_8(encoded, &offset, &len) ||
-              !amqp_decode_bytes(encoded, &offset, &p->cluster_id, len))
-            return AMQP_STATUS_BAD_AMQP_DATA;
-        }
-      }
-      *decoded = p;
-      return 0;
-    }
-    case 90: {
-      amqp_tx_properties_t *p = (amqp_tx_properties_t *)amqp_pool_alloc(
-          pool, sizeof(amqp_tx_properties_t));
-      if (p == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      p->_flags = flags;
-      *decoded = p;
-      return 0;
-    }
-    case 85: {
-      amqp_confirm_properties_t *p =
-          (amqp_confirm_properties_t *)amqp_pool_alloc(
-              pool, sizeof(amqp_confirm_properties_t));
-      if (p == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-      p->_flags = flags;
-      *decoded = p;
-      return 0;
-    }
-    default:
-      return AMQP_STATUS_UNKNOWN_CLASS;
-  }
-}
-
-int amqp_encode_method(amqp_method_number_t methodNumber, void *decoded,
-                       amqp_bytes_t encoded) {
-  size_t offset = 0;
-  uint8_t bit_buffer;
-
-  switch (methodNumber) {
-    case AMQP_CONNECTION_START_METHOD: {
-      amqp_connection_start_t *m = (amqp_connection_start_t *)decoded;
-      if (!amqp_encode_8(encoded, &offset, m->version_major))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_8(encoded, &offset, m->version_minor))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        int res = amqp_encode_table(encoded, &(m->server_properties), &offset);
-        if (res < 0) return res;
-      }
-      if (UINT32_MAX < m->mechanisms.len ||
-          !amqp_encode_32(encoded, &offset, (uint32_t)m->mechanisms.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->mechanisms))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT32_MAX < m->locales.len ||
-          !amqp_encode_32(encoded, &offset, (uint32_t)m->locales.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->locales))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_START_OK_METHOD: {
-      amqp_connection_start_ok_t *m = (amqp_connection_start_ok_t *)decoded;
-      {
-        int res = amqp_encode_table(encoded, &(m->client_properties), &offset);
-        if (res < 0) return res;
-      }
-      if (UINT8_MAX < m->mechanism.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->mechanism.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->mechanism))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT32_MAX < m->response.len ||
-          !amqp_encode_32(encoded, &offset, (uint32_t)m->response.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->response))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->locale.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->locale.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->locale))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_SECURE_METHOD: {
-      amqp_connection_secure_t *m = (amqp_connection_secure_t *)decoded;
-      if (UINT32_MAX < m->challenge.len ||
-          !amqp_encode_32(encoded, &offset, (uint32_t)m->challenge.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->challenge))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_SECURE_OK_METHOD: {
-      amqp_connection_secure_ok_t *m = (amqp_connection_secure_ok_t *)decoded;
-      if (UINT32_MAX < m->response.len ||
-          !amqp_encode_32(encoded, &offset, (uint32_t)m->response.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->response))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_TUNE_METHOD: {
-      amqp_connection_tune_t *m = (amqp_connection_tune_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->channel_max))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_32(encoded, &offset, m->frame_max))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_16(encoded, &offset, m->heartbeat))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_TUNE_OK_METHOD: {
-      amqp_connection_tune_ok_t *m = (amqp_connection_tune_ok_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->channel_max))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_32(encoded, &offset, m->frame_max))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_16(encoded, &offset, m->heartbeat))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_OPEN_METHOD: {
-      amqp_connection_open_t *m = (amqp_connection_open_t *)decoded;
-      if (UINT8_MAX < m->virtual_host.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->virtual_host.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->virtual_host))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->capabilities.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->capabilities.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->capabilities))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->insist) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_OPEN_OK_METHOD: {
-      amqp_connection_open_ok_t *m = (amqp_connection_open_ok_t *)decoded;
-      if (UINT8_MAX < m->known_hosts.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->known_hosts.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->known_hosts))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_CLOSE_METHOD: {
-      amqp_connection_close_t *m = (amqp_connection_close_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->reply_code))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->reply_text.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->reply_text.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->reply_text))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_16(encoded, &offset, m->class_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_16(encoded, &offset, m->method_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_CLOSE_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_BLOCKED_METHOD: {
-      amqp_connection_blocked_t *m = (amqp_connection_blocked_t *)decoded;
-      if (UINT8_MAX < m->reason.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->reason.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->reason))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONNECTION_UNBLOCKED_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_CHANNEL_OPEN_METHOD: {
-      amqp_channel_open_t *m = (amqp_channel_open_t *)decoded;
-      if (UINT8_MAX < m->out_of_band.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->out_of_band.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->out_of_band))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CHANNEL_OPEN_OK_METHOD: {
-      amqp_channel_open_ok_t *m = (amqp_channel_open_ok_t *)decoded;
-      if (UINT32_MAX < m->channel_id.len ||
-          !amqp_encode_32(encoded, &offset, (uint32_t)m->channel_id.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->channel_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CHANNEL_FLOW_METHOD: {
-      amqp_channel_flow_t *m = (amqp_channel_flow_t *)decoded;
-      bit_buffer = 0;
-      if (m->active) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CHANNEL_FLOW_OK_METHOD: {
-      amqp_channel_flow_ok_t *m = (amqp_channel_flow_ok_t *)decoded;
-      bit_buffer = 0;
-      if (m->active) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CHANNEL_CLOSE_METHOD: {
-      amqp_channel_close_t *m = (amqp_channel_close_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->reply_code))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->reply_text.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->reply_text.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->reply_text))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_16(encoded, &offset, m->class_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_16(encoded, &offset, m->method_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CHANNEL_CLOSE_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_ACCESS_REQUEST_METHOD: {
-      amqp_access_request_t *m = (amqp_access_request_t *)decoded;
-      if (UINT8_MAX < m->realm.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->realm.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->realm))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->exclusive) bit_buffer |= (1 << 0);
-      if (m->passive) bit_buffer |= (1 << 1);
-      if (m->active) bit_buffer |= (1 << 2);
-      if (m->write) bit_buffer |= (1 << 3);
-      if (m->read) bit_buffer |= (1 << 4);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_ACCESS_REQUEST_OK_METHOD: {
-      amqp_access_request_ok_t *m = (amqp_access_request_ok_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_EXCHANGE_DECLARE_METHOD: {
-      amqp_exchange_declare_t *m = (amqp_exchange_declare_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->exchange.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->exchange.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->exchange))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->type.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->type.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->type))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->passive) bit_buffer |= (1 << 0);
-      if (m->durable) bit_buffer |= (1 << 1);
-      if (m->auto_delete) bit_buffer |= (1 << 2);
-      if (m->internal) bit_buffer |= (1 << 3);
-      if (m->nowait) bit_buffer |= (1 << 4);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        int res = amqp_encode_table(encoded, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      return (int)offset;
-    }
-    case AMQP_EXCHANGE_DECLARE_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_EXCHANGE_DELETE_METHOD: {
-      amqp_exchange_delete_t *m = (amqp_exchange_delete_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->exchange.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->exchange.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->exchange))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->if_unused) bit_buffer |= (1 << 0);
-      if (m->nowait) bit_buffer |= (1 << 1);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_EXCHANGE_DELETE_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_EXCHANGE_BIND_METHOD: {
-      amqp_exchange_bind_t *m = (amqp_exchange_bind_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->destination.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->destination.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->destination))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->source.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->source.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->source))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->routing_key.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->routing_key.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->routing_key))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->nowait) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        int res = amqp_encode_table(encoded, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      return (int)offset;
-    }
-    case AMQP_EXCHANGE_BIND_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_EXCHANGE_UNBIND_METHOD: {
-      amqp_exchange_unbind_t *m = (amqp_exchange_unbind_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->destination.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->destination.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->destination))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->source.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->source.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->source))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->routing_key.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->routing_key.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->routing_key))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->nowait) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        int res = amqp_encode_table(encoded, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      return (int)offset;
-    }
-    case AMQP_EXCHANGE_UNBIND_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_QUEUE_DECLARE_METHOD: {
-      amqp_queue_declare_t *m = (amqp_queue_declare_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->queue.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->queue.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->queue))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->passive) bit_buffer |= (1 << 0);
-      if (m->durable) bit_buffer |= (1 << 1);
-      if (m->exclusive) bit_buffer |= (1 << 2);
-      if (m->auto_delete) bit_buffer |= (1 << 3);
-      if (m->nowait) bit_buffer |= (1 << 4);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        int res = amqp_encode_table(encoded, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      return (int)offset;
-    }
-    case AMQP_QUEUE_DECLARE_OK_METHOD: {
-      amqp_queue_declare_ok_t *m = (amqp_queue_declare_ok_t *)decoded;
-      if (UINT8_MAX < m->queue.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->queue.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->queue))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_32(encoded, &offset, m->message_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_32(encoded, &offset, m->consumer_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_QUEUE_BIND_METHOD: {
-      amqp_queue_bind_t *m = (amqp_queue_bind_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->queue.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->queue.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->queue))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->exchange.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->exchange.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->exchange))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->routing_key.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->routing_key.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->routing_key))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->nowait) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        int res = amqp_encode_table(encoded, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      return (int)offset;
-    }
-    case AMQP_QUEUE_BIND_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_QUEUE_PURGE_METHOD: {
-      amqp_queue_purge_t *m = (amqp_queue_purge_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->queue.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->queue.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->queue))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->nowait) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_QUEUE_PURGE_OK_METHOD: {
-      amqp_queue_purge_ok_t *m = (amqp_queue_purge_ok_t *)decoded;
-      if (!amqp_encode_32(encoded, &offset, m->message_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_QUEUE_DELETE_METHOD: {
-      amqp_queue_delete_t *m = (amqp_queue_delete_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->queue.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->queue.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->queue))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->if_unused) bit_buffer |= (1 << 0);
-      if (m->if_empty) bit_buffer |= (1 << 1);
-      if (m->nowait) bit_buffer |= (1 << 2);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_QUEUE_DELETE_OK_METHOD: {
-      amqp_queue_delete_ok_t *m = (amqp_queue_delete_ok_t *)decoded;
-      if (!amqp_encode_32(encoded, &offset, m->message_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_QUEUE_UNBIND_METHOD: {
-      amqp_queue_unbind_t *m = (amqp_queue_unbind_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->queue.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->queue.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->queue))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->exchange.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->exchange.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->exchange))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->routing_key.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->routing_key.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->routing_key))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        int res = amqp_encode_table(encoded, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      return (int)offset;
-    }
-    case AMQP_QUEUE_UNBIND_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_BASIC_QOS_METHOD: {
-      amqp_basic_qos_t *m = (amqp_basic_qos_t *)decoded;
-      if (!amqp_encode_32(encoded, &offset, m->prefetch_size))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_16(encoded, &offset, m->prefetch_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->global) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_QOS_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_BASIC_CONSUME_METHOD: {
-      amqp_basic_consume_t *m = (amqp_basic_consume_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->queue.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->queue.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->queue))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->consumer_tag.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->consumer_tag.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->consumer_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->no_local) bit_buffer |= (1 << 0);
-      if (m->no_ack) bit_buffer |= (1 << 1);
-      if (m->exclusive) bit_buffer |= (1 << 2);
-      if (m->nowait) bit_buffer |= (1 << 3);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      {
-        int res = amqp_encode_table(encoded, &(m->arguments), &offset);
-        if (res < 0) return res;
-      }
-      return (int)offset;
-    }
-    case AMQP_BASIC_CONSUME_OK_METHOD: {
-      amqp_basic_consume_ok_t *m = (amqp_basic_consume_ok_t *)decoded;
-      if (UINT8_MAX < m->consumer_tag.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->consumer_tag.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->consumer_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_CANCEL_METHOD: {
-      amqp_basic_cancel_t *m = (amqp_basic_cancel_t *)decoded;
-      if (UINT8_MAX < m->consumer_tag.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->consumer_tag.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->consumer_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->nowait) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_CANCEL_OK_METHOD: {
-      amqp_basic_cancel_ok_t *m = (amqp_basic_cancel_ok_t *)decoded;
-      if (UINT8_MAX < m->consumer_tag.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->consumer_tag.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->consumer_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_PUBLISH_METHOD: {
-      amqp_basic_publish_t *m = (amqp_basic_publish_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->exchange.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->exchange.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->exchange))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->routing_key.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->routing_key.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->routing_key))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->mandatory) bit_buffer |= (1 << 0);
-      if (m->immediate) bit_buffer |= (1 << 1);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_RETURN_METHOD: {
-      amqp_basic_return_t *m = (amqp_basic_return_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->reply_code))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->reply_text.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->reply_text.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->reply_text))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->exchange.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->exchange.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->exchange))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->routing_key.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->routing_key.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->routing_key))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_DELIVER_METHOD: {
-      amqp_basic_deliver_t *m = (amqp_basic_deliver_t *)decoded;
-      if (UINT8_MAX < m->consumer_tag.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->consumer_tag.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->consumer_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_64(encoded, &offset, m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->redelivered) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->exchange.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->exchange.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->exchange))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->routing_key.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->routing_key.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->routing_key))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_GET_METHOD: {
-      amqp_basic_get_t *m = (amqp_basic_get_t *)decoded;
-      if (!amqp_encode_16(encoded, &offset, m->ticket))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->queue.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->queue.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->queue))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->no_ack) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_GET_OK_METHOD: {
-      amqp_basic_get_ok_t *m = (amqp_basic_get_ok_t *)decoded;
-      if (!amqp_encode_64(encoded, &offset, m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->redelivered) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->exchange.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->exchange.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->exchange))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (UINT8_MAX < m->routing_key.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->routing_key.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->routing_key))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      if (!amqp_encode_32(encoded, &offset, m->message_count))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_GET_EMPTY_METHOD: {
-      amqp_basic_get_empty_t *m = (amqp_basic_get_empty_t *)decoded;
-      if (UINT8_MAX < m->cluster_id.len ||
-          !amqp_encode_8(encoded, &offset, (uint8_t)m->cluster_id.len) ||
-          !amqp_encode_bytes(encoded, &offset, m->cluster_id))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_ACK_METHOD: {
-      amqp_basic_ack_t *m = (amqp_basic_ack_t *)decoded;
-      if (!amqp_encode_64(encoded, &offset, m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->multiple) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_REJECT_METHOD: {
-      amqp_basic_reject_t *m = (amqp_basic_reject_t *)decoded;
-      if (!amqp_encode_64(encoded, &offset, m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->requeue) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_RECOVER_ASYNC_METHOD: {
-      amqp_basic_recover_async_t *m = (amqp_basic_recover_async_t *)decoded;
-      bit_buffer = 0;
-      if (m->requeue) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_RECOVER_METHOD: {
-      amqp_basic_recover_t *m = (amqp_basic_recover_t *)decoded;
-      bit_buffer = 0;
-      if (m->requeue) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_BASIC_RECOVER_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_BASIC_NACK_METHOD: {
-      amqp_basic_nack_t *m = (amqp_basic_nack_t *)decoded;
-      if (!amqp_encode_64(encoded, &offset, m->delivery_tag))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      bit_buffer = 0;
-      if (m->multiple) bit_buffer |= (1 << 0);
-      if (m->requeue) bit_buffer |= (1 << 1);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_TX_SELECT_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_TX_SELECT_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_TX_COMMIT_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_TX_COMMIT_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_TX_ROLLBACK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_TX_ROLLBACK_OK_METHOD: {
-      return (int)offset;
-    }
-    case AMQP_CONFIRM_SELECT_METHOD: {
-      amqp_confirm_select_t *m = (amqp_confirm_select_t *)decoded;
-      bit_buffer = 0;
-      if (m->nowait) bit_buffer |= (1 << 0);
-      if (!amqp_encode_8(encoded, &offset, bit_buffer))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      return (int)offset;
-    }
-    case AMQP_CONFIRM_SELECT_OK_METHOD: {
-      return (int)offset;
-    }
-    default:
-      return AMQP_STATUS_UNKNOWN_METHOD;
-  }
-}
-
-int amqp_encode_properties(uint16_t class_id, void *decoded,
-                           amqp_bytes_t encoded) {
-  size_t offset = 0;
-
-  /* Cheat, and get the flags out generically, relying on the
-     similarity of structure between classes */
-  amqp_flags_t flags = *(amqp_flags_t *)decoded; /* cheating! */
-
-  {
-    /* We take a copy of flags to avoid destroying it, as it is used
-       in the autogenerated code below. */
-    amqp_flags_t remaining_flags = flags;
-    do {
-      amqp_flags_t remainder = remaining_flags >> 16;
-      uint16_t partial_flags = remaining_flags & 0xFFFE;
-      if (remainder != 0) {
-        partial_flags |= 1;
-      }
-      if (!amqp_encode_16(encoded, &offset, partial_flags))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      remaining_flags = remainder;
-    } while (remaining_flags != 0);
-  }
-
-  switch (class_id) {
-    case 10: {
-      return (int)offset;
-    }
-    case 20: {
-      return (int)offset;
-    }
-    case 30: {
-      return (int)offset;
-    }
-    case 40: {
-      return (int)offset;
-    }
-    case 50: {
-      return (int)offset;
-    }
-    case 60: {
-      amqp_basic_properties_t *p = (amqp_basic_properties_t *)decoded;
-      if (flags & AMQP_BASIC_CONTENT_TYPE_FLAG) {
-        if (UINT8_MAX < p->content_type.len ||
-            !amqp_encode_8(encoded, &offset, (uint8_t)p->content_type.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->content_type))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_CONTENT_ENCODING_FLAG) {
-        if (UINT8_MAX < p->content_encoding.len ||
-            !amqp_encode_8(encoded, &offset,
-                           (uint8_t)p->content_encoding.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->content_encoding))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_HEADERS_FLAG) {
-        {
-          int res = amqp_encode_table(encoded, &(p->headers), &offset);
-          if (res < 0) return res;
-        }
-      }
-      if (flags & AMQP_BASIC_DELIVERY_MODE_FLAG) {
-        if (!amqp_encode_8(encoded, &offset, p->delivery_mode))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_PRIORITY_FLAG) {
-        if (!amqp_encode_8(encoded, &offset, p->priority))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_CORRELATION_ID_FLAG) {
-        if (UINT8_MAX < p->correlation_id.len ||
-            !amqp_encode_8(encoded, &offset, (uint8_t)p->correlation_id.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->correlation_id))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_REPLY_TO_FLAG) {
-        if (UINT8_MAX < p->reply_to.len ||
-            !amqp_encode_8(encoded, &offset, (uint8_t)p->reply_to.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->reply_to))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_EXPIRATION_FLAG) {
-        if (UINT8_MAX < p->expiration.len ||
-            !amqp_encode_8(encoded, &offset, (uint8_t)p->expiration.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->expiration))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_MESSAGE_ID_FLAG) {
-        if (UINT8_MAX < p->message_id.len ||
-            !amqp_encode_8(encoded, &offset, (uint8_t)p->message_id.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->message_id))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_TIMESTAMP_FLAG) {
-        if (!amqp_encode_64(encoded, &offset, p->timestamp))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_TYPE_FLAG) {
-        if (UINT8_MAX < p->type.len ||
-            !amqp_encode_8(encoded, &offset, (uint8_t)p->type.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->type))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_USER_ID_FLAG) {
-        if (UINT8_MAX < p->user_id.len ||
-            !amqp_encode_8(encoded, &offset, (uint8_t)p->user_id.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->user_id))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_APP_ID_FLAG) {
-        if (UINT8_MAX < p->app_id.len ||
-            !amqp_encode_8(encoded, &offset, (uint8_t)p->app_id.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->app_id))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      if (flags & AMQP_BASIC_CLUSTER_ID_FLAG) {
-        if (UINT8_MAX < p->cluster_id.len ||
-            !amqp_encode_8(encoded, &offset, (uint8_t)p->cluster_id.len) ||
-            !amqp_encode_bytes(encoded, &offset, p->cluster_id))
-          return AMQP_STATUS_BAD_AMQP_DATA;
-      }
-      return (int)offset;
-    }
-    case 90: {
-      return (int)offset;
-    }
-    case 85: {
-      return (int)offset;
-    }
-    default:
-      return AMQP_STATUS_UNKNOWN_CLASS;
-  }
-}
-
-/**
- * amqp_channel_open
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_channel_open_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_channel_open_ok_t *AMQP_CALL
-    amqp_channel_open(amqp_connection_state_t state, amqp_channel_t channel) {
-  amqp_channel_open_t req;
-  req.out_of_band = amqp_empty_bytes;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_CHANNEL_OPEN_METHOD,
-                                 AMQP_CHANNEL_OPEN_OK_METHOD, &req);
-}
-
-/**
- * amqp_channel_flow
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] active active
- * @returns amqp_channel_flow_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_channel_flow_ok_t *AMQP_CALL
-    amqp_channel_flow(amqp_connection_state_t state, amqp_channel_t channel,
-                      amqp_boolean_t active) {
-  amqp_channel_flow_t req;
-  req.active = active;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_CHANNEL_FLOW_METHOD,
-                                 AMQP_CHANNEL_FLOW_OK_METHOD, &req);
-}
-
-/**
- * amqp_exchange_declare
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] exchange exchange
- * @param [in] type type
- * @param [in] passive passive
- * @param [in] durable durable
- * @param [in] auto_delete auto_delete
- * @param [in] internal internal
- * @param [in] arguments arguments
- * @returns amqp_exchange_declare_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_exchange_declare_ok_t *AMQP_CALL amqp_exchange_declare(
-    amqp_connection_state_t state, amqp_channel_t channel,
-    amqp_bytes_t exchange, amqp_bytes_t type, amqp_boolean_t passive,
-    amqp_boolean_t durable, amqp_boolean_t auto_delete, amqp_boolean_t internal,
-    amqp_table_t arguments) {
-  amqp_exchange_declare_t req;
-  req.ticket = 0;
-  req.exchange = exchange;
-  req.type = type;
-  req.passive = passive;
-  req.durable = durable;
-  req.auto_delete = auto_delete;
-  req.internal = internal;
-  req.nowait = 0;
-  req.arguments = arguments;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_EXCHANGE_DECLARE_METHOD,
-                                 AMQP_EXCHANGE_DECLARE_OK_METHOD, &req);
-}
-
-/**
- * amqp_exchange_delete
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] exchange exchange
- * @param [in] if_unused if_unused
- * @returns amqp_exchange_delete_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_exchange_delete_ok_t *AMQP_CALL
-    amqp_exchange_delete(amqp_connection_state_t state, amqp_channel_t channel,
-                         amqp_bytes_t exchange, amqp_boolean_t if_unused) {
-  amqp_exchange_delete_t req;
-  req.ticket = 0;
-  req.exchange = exchange;
-  req.if_unused = if_unused;
-  req.nowait = 0;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_EXCHANGE_DELETE_METHOD,
-                                 AMQP_EXCHANGE_DELETE_OK_METHOD, &req);
-}
-
-/**
- * amqp_exchange_bind
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] destination destination
- * @param [in] source source
- * @param [in] routing_key routing_key
- * @param [in] arguments arguments
- * @returns amqp_exchange_bind_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_exchange_bind_ok_t *AMQP_CALL
-    amqp_exchange_bind(amqp_connection_state_t state, amqp_channel_t channel,
-                       amqp_bytes_t destination, amqp_bytes_t source,
-                       amqp_bytes_t routing_key, amqp_table_t arguments) {
-  amqp_exchange_bind_t req;
-  req.ticket = 0;
-  req.destination = destination;
-  req.source = source;
-  req.routing_key = routing_key;
-  req.nowait = 0;
-  req.arguments = arguments;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_EXCHANGE_BIND_METHOD,
-                                 AMQP_EXCHANGE_BIND_OK_METHOD, &req);
-}
-
-/**
- * amqp_exchange_unbind
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] destination destination
- * @param [in] source source
- * @param [in] routing_key routing_key
- * @param [in] arguments arguments
- * @returns amqp_exchange_unbind_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_exchange_unbind_ok_t *AMQP_CALL
-    amqp_exchange_unbind(amqp_connection_state_t state, amqp_channel_t channel,
-                         amqp_bytes_t destination, amqp_bytes_t source,
-                         amqp_bytes_t routing_key, amqp_table_t arguments) {
-  amqp_exchange_unbind_t req;
-  req.ticket = 0;
-  req.destination = destination;
-  req.source = source;
-  req.routing_key = routing_key;
-  req.nowait = 0;
-  req.arguments = arguments;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_EXCHANGE_UNBIND_METHOD,
-                                 AMQP_EXCHANGE_UNBIND_OK_METHOD, &req);
-}
-
-/**
- * amqp_queue_declare
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] passive passive
- * @param [in] durable durable
- * @param [in] exclusive exclusive
- * @param [in] auto_delete auto_delete
- * @param [in] arguments arguments
- * @returns amqp_queue_declare_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_declare_ok_t *AMQP_CALL amqp_queue_declare(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_boolean_t passive, amqp_boolean_t durable, amqp_boolean_t exclusive,
-    amqp_boolean_t auto_delete, amqp_table_t arguments) {
-  amqp_queue_declare_t req;
-  req.ticket = 0;
-  req.queue = queue;
-  req.passive = passive;
-  req.durable = durable;
-  req.exclusive = exclusive;
-  req.auto_delete = auto_delete;
-  req.nowait = 0;
-  req.arguments = arguments;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_QUEUE_DECLARE_METHOD,
-                                 AMQP_QUEUE_DECLARE_OK_METHOD, &req);
-}
-
-/**
- * amqp_queue_bind
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] exchange exchange
- * @param [in] routing_key routing_key
- * @param [in] arguments arguments
- * @returns amqp_queue_bind_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_bind_ok_t *AMQP_CALL amqp_queue_bind(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_bytes_t exchange, amqp_bytes_t routing_key, amqp_table_t arguments) {
-  amqp_queue_bind_t req;
-  req.ticket = 0;
-  req.queue = queue;
-  req.exchange = exchange;
-  req.routing_key = routing_key;
-  req.nowait = 0;
-  req.arguments = arguments;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_QUEUE_BIND_METHOD,
-                                 AMQP_QUEUE_BIND_OK_METHOD, &req);
-}
-
-/**
- * amqp_queue_purge
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @returns amqp_queue_purge_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_purge_ok_t *AMQP_CALL amqp_queue_purge(amqp_connection_state_t state,
-                                                  amqp_channel_t channel,
-                                                  amqp_bytes_t queue) {
-  amqp_queue_purge_t req;
-  req.ticket = 0;
-  req.queue = queue;
-  req.nowait = 0;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_QUEUE_PURGE_METHOD,
-                                 AMQP_QUEUE_PURGE_OK_METHOD, &req);
-}
-
-/**
- * amqp_queue_delete
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] if_unused if_unused
- * @param [in] if_empty if_empty
- * @returns amqp_queue_delete_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_delete_ok_t *AMQP_CALL amqp_queue_delete(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_boolean_t if_unused, amqp_boolean_t if_empty) {
-  amqp_queue_delete_t req;
-  req.ticket = 0;
-  req.queue = queue;
-  req.if_unused = if_unused;
-  req.if_empty = if_empty;
-  req.nowait = 0;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_QUEUE_DELETE_METHOD,
-                                 AMQP_QUEUE_DELETE_OK_METHOD, &req);
-}
-
-/**
- * amqp_queue_unbind
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] exchange exchange
- * @param [in] routing_key routing_key
- * @param [in] arguments arguments
- * @returns amqp_queue_unbind_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_unbind_ok_t *AMQP_CALL amqp_queue_unbind(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_bytes_t exchange, amqp_bytes_t routing_key, amqp_table_t arguments) {
-  amqp_queue_unbind_t req;
-  req.ticket = 0;
-  req.queue = queue;
-  req.exchange = exchange;
-  req.routing_key = routing_key;
-  req.arguments = arguments;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_QUEUE_UNBIND_METHOD,
-                                 AMQP_QUEUE_UNBIND_OK_METHOD, &req);
-}
-
-/**
- * amqp_basic_qos
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] prefetch_size prefetch_size
- * @param [in] prefetch_count prefetch_count
- * @param [in] global global
- * @returns amqp_basic_qos_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_basic_qos_ok_t *AMQP_CALL amqp_basic_qos(amqp_connection_state_t state,
-                                              amqp_channel_t channel,
-                                              uint32_t prefetch_size,
-                                              uint16_t prefetch_count,
-                                              amqp_boolean_t global) {
-  amqp_basic_qos_t req;
-  req.prefetch_size = prefetch_size;
-  req.prefetch_count = prefetch_count;
-  req.global = global;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_BASIC_QOS_METHOD,
-                                 AMQP_BASIC_QOS_OK_METHOD, &req);
-}
-
-/**
- * amqp_basic_consume
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] consumer_tag consumer_tag
- * @param [in] no_local no_local
- * @param [in] no_ack no_ack
- * @param [in] exclusive exclusive
- * @param [in] arguments arguments
- * @returns amqp_basic_consume_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_basic_consume_ok_t *AMQP_CALL amqp_basic_consume(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_bytes_t consumer_tag, amqp_boolean_t no_local, amqp_boolean_t no_ack,
-    amqp_boolean_t exclusive, amqp_table_t arguments) {
-  amqp_basic_consume_t req;
-  req.ticket = 0;
-  req.queue = queue;
-  req.consumer_tag = consumer_tag;
-  req.no_local = no_local;
-  req.no_ack = no_ack;
-  req.exclusive = exclusive;
-  req.nowait = 0;
-  req.arguments = arguments;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_BASIC_CONSUME_METHOD,
-                                 AMQP_BASIC_CONSUME_OK_METHOD, &req);
-}
-
-/**
- * amqp_basic_cancel
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] consumer_tag consumer_tag
- * @returns amqp_basic_cancel_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_basic_cancel_ok_t *AMQP_CALL
-    amqp_basic_cancel(amqp_connection_state_t state, amqp_channel_t channel,
-                      amqp_bytes_t consumer_tag) {
-  amqp_basic_cancel_t req;
-  req.consumer_tag = consumer_tag;
-  req.nowait = 0;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_BASIC_CANCEL_METHOD,
-                                 AMQP_BASIC_CANCEL_OK_METHOD, &req);
-}
-
-/**
- * amqp_basic_recover
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] requeue requeue
- * @returns amqp_basic_recover_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_basic_recover_ok_t *AMQP_CALL
-    amqp_basic_recover(amqp_connection_state_t state, amqp_channel_t channel,
-                       amqp_boolean_t requeue) {
-  amqp_basic_recover_t req;
-  req.requeue = requeue;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_BASIC_RECOVER_METHOD,
-                                 AMQP_BASIC_RECOVER_OK_METHOD, &req);
-}
-
-/**
- * amqp_tx_select
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_tx_select_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_tx_select_ok_t *AMQP_CALL amqp_tx_select(amqp_connection_state_t state,
-                                              amqp_channel_t channel) {
-  amqp_tx_select_t req;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_TX_SELECT_METHOD,
-                                 AMQP_TX_SELECT_OK_METHOD, &req);
-}
-
-/**
- * amqp_tx_commit
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_tx_commit_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_tx_commit_ok_t *AMQP_CALL amqp_tx_commit(amqp_connection_state_t state,
-                                              amqp_channel_t channel) {
-  amqp_tx_commit_t req;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_TX_COMMIT_METHOD,
-                                 AMQP_TX_COMMIT_OK_METHOD, &req);
-}
-
-/**
- * amqp_tx_rollback
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_tx_rollback_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_tx_rollback_ok_t *AMQP_CALL amqp_tx_rollback(amqp_connection_state_t state,
-                                                  amqp_channel_t channel) {
-  amqp_tx_rollback_t req;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_TX_ROLLBACK_METHOD,
-                                 AMQP_TX_ROLLBACK_OK_METHOD, &req);
-}
-
-/**
- * amqp_confirm_select
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_confirm_select_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_confirm_select_ok_t *AMQP_CALL
-    amqp_confirm_select(amqp_connection_state_t state, amqp_channel_t channel) {
-  amqp_confirm_select_t req;
-  req.nowait = 0;
-
-  return amqp_simple_rpc_decoded(state, channel, AMQP_CONFIRM_SELECT_METHOD,
-                                 AMQP_CONFIRM_SELECT_OK_METHOD, &req);
-}

ext/librabbitmq/librabbitmq/amqp_framing.h

@@ -1,1144 +0,0 @@
-/* Generated code. Do not edit. Edit and re-run codegen.py instead.
- *
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-/** @file amqp_framing.h */
-#ifndef AMQP_FRAMING_H
-#define AMQP_FRAMING_H
-
-#include <amqp.h>
-
-AMQP_BEGIN_DECLS
-
-#define AMQP_PROTOCOL_VERSION_MAJOR 0 /**< AMQP protocol version major */
-#define AMQP_PROTOCOL_VERSION_MINOR 9 /**< AMQP protocol version minor */
-#define AMQP_PROTOCOL_VERSION_REVISION                                   \
-  1                                  /**< AMQP protocol version revision \
-                                        */
-#define AMQP_PROTOCOL_PORT 5672      /**< Default AMQP Port */
-#define AMQP_FRAME_METHOD 1          /**< Constant: FRAME-METHOD */
-#define AMQP_FRAME_HEADER 2          /**< Constant: FRAME-HEADER */
-#define AMQP_FRAME_BODY 3            /**< Constant: FRAME-BODY */
-#define AMQP_FRAME_HEARTBEAT 8       /**< Constant: FRAME-HEARTBEAT */
-#define AMQP_FRAME_MIN_SIZE 4096     /**< Constant: FRAME-MIN-SIZE */
-#define AMQP_FRAME_END 206           /**< Constant: FRAME-END */
-#define AMQP_REPLY_SUCCESS 200       /**< Constant: REPLY-SUCCESS */
-#define AMQP_CONTENT_TOO_LARGE 311   /**< Constant: CONTENT-TOO-LARGE */
-#define AMQP_NO_ROUTE 312            /**< Constant: NO-ROUTE */
-#define AMQP_NO_CONSUMERS 313        /**< Constant: NO-CONSUMERS */
-#define AMQP_ACCESS_REFUSED 403      /**< Constant: ACCESS-REFUSED */
-#define AMQP_NOT_FOUND 404           /**< Constant: NOT-FOUND */
-#define AMQP_RESOURCE_LOCKED 405     /**< Constant: RESOURCE-LOCKED */
-#define AMQP_PRECONDITION_FAILED 406 /**< Constant: PRECONDITION-FAILED */
-#define AMQP_CONNECTION_FORCED 320   /**< Constant: CONNECTION-FORCED */
-#define AMQP_INVALID_PATH 402        /**< Constant: INVALID-PATH */
-#define AMQP_FRAME_ERROR 501         /**< Constant: FRAME-ERROR */
-#define AMQP_SYNTAX_ERROR 502        /**< Constant: SYNTAX-ERROR */
-#define AMQP_COMMAND_INVALID 503     /**< Constant: COMMAND-INVALID */
-#define AMQP_CHANNEL_ERROR 504       /**< Constant: CHANNEL-ERROR */
-#define AMQP_UNEXPECTED_FRAME 505    /**< Constant: UNEXPECTED-FRAME */
-#define AMQP_RESOURCE_ERROR 506      /**< Constant: RESOURCE-ERROR */
-#define AMQP_NOT_ALLOWED 530         /**< Constant: NOT-ALLOWED */
-#define AMQP_NOT_IMPLEMENTED 540     /**< Constant: NOT-IMPLEMENTED */
-#define AMQP_INTERNAL_ERROR 541      /**< Constant: INTERNAL-ERROR */
-
-/* Function prototypes. */
-
-/**
- * Get constant name string from constant
- *
- * @param [in] constantNumber constant to get the name of
- * @returns string describing the constant. String is managed by
- *           the library and should not be free()'d by the program
- */
-AMQP_PUBLIC_FUNCTION
-char const *AMQP_CALL amqp_constant_name(int constantNumber);
-
-/**
- * Checks to see if a constant is a hard error
- *
- * A hard error occurs when something severe enough
- * happens that the connection must be closed.
- *
- * @param [in] constantNumber the error constant
- * @returns true if its a hard error, false otherwise
- */
-AMQP_PUBLIC_FUNCTION
-amqp_boolean_t AMQP_CALL amqp_constant_is_hard_error(int constantNumber);
-
-/**
- * Get method name string from method number
- *
- * @param [in] methodNumber the method number
- * @returns method name string. String is managed by the library
- *           and should not be freed()'d by the program
- */
-AMQP_PUBLIC_FUNCTION
-char const *AMQP_CALL amqp_method_name(amqp_method_number_t methodNumber);
-
-/**
- * Check whether a method has content
- *
- * A method that has content will receive the method frame
- * a properties frame, then 1 to N body frames
- *
- * @param [in] methodNumber the method number
- * @returns true if method has content, false otherwise
- */
-AMQP_PUBLIC_FUNCTION
-amqp_boolean_t AMQP_CALL
-    amqp_method_has_content(amqp_method_number_t methodNumber);
-
-/**
- * Decodes a method from AMQP wireformat
- *
- * @param [in] methodNumber the method number for the decoded parameter
- * @param [in] pool the memory pool to allocate the decoded method from
- * @param [in] encoded the encoded byte string buffer
- * @param [out] decoded pointer to the decoded method struct
- * @returns 0 on success, an error code otherwise
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_decode_method(amqp_method_number_t methodNumber,
-                                 amqp_pool_t *pool, amqp_bytes_t encoded,
-                                 void **decoded);
-
-/**
- * Decodes a header frame properties structure from AMQP wireformat
- *
- * @param [in] class_id the class id for the decoded parameter
- * @param [in] pool the memory pool to allocate the decoded properties from
- * @param [in] encoded the encoded byte string buffer
- * @param [out] decoded pointer to the decoded properties struct
- * @returns 0 on success, an error code otherwise
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_decode_properties(uint16_t class_id, amqp_pool_t *pool,
-                                     amqp_bytes_t encoded, void **decoded);
-
-/**
- * Encodes a method structure in AMQP wireformat
- *
- * @param [in] methodNumber the method number for the decoded parameter
- * @param [in] decoded the method structure (e.g., amqp_connection_start_t)
- * @param [in] encoded an allocated byte buffer for the encoded method
- *              structure to be written to. If the buffer isn't large enough
- *              to hold the encoded method, an error code will be returned.
- * @returns 0 on success, an error code otherwise.
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_encode_method(amqp_method_number_t methodNumber,
-                                 void *decoded, amqp_bytes_t encoded);
-
-/**
- * Encodes a properties structure in AMQP wireformat
- *
- * @param [in] class_id the class id for the decoded parameter
- * @param [in] decoded the properties structure (e.g., amqp_basic_properties_t)
- * @param [in] encoded an allocated byte buffer for the encoded properties to
- * written to.
- *              If the buffer isn't large enough to hold the encoded method, an
- *              an error code will be returned
- * @returns 0 on success, an error code otherwise.
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_encode_properties(uint16_t class_id, void *decoded,
-                                     amqp_bytes_t encoded);
-
-/* Method field records. */
-
-#define AMQP_CONNECTION_START_METHOD                                 \
-  ((amqp_method_number_t)0x000A000A) /**< connection.start method id \
-                                        @internal 10, 10; 655370 */
-/** connection.start method fields */
-typedef struct amqp_connection_start_t_ {
-  uint8_t version_major;          /**< version-major */
-  uint8_t version_minor;          /**< version-minor */
-  amqp_table_t server_properties; /**< server-properties */
-  amqp_bytes_t mechanisms;        /**< mechanisms */
-  amqp_bytes_t locales;           /**< locales */
-} amqp_connection_start_t;
-
-#define AMQP_CONNECTION_START_OK_METHOD                                 \
-  ((amqp_method_number_t)0x000A000B) /**< connection.start-ok method id \
-                                        @internal 10, 11; 655371 */
-/** connection.start-ok method fields */
-typedef struct amqp_connection_start_ok_t_ {
-  amqp_table_t client_properties; /**< client-properties */
-  amqp_bytes_t mechanism;         /**< mechanism */
-  amqp_bytes_t response;          /**< response */
-  amqp_bytes_t locale;            /**< locale */
-} amqp_connection_start_ok_t;
-
-#define AMQP_CONNECTION_SECURE_METHOD                                 \
-  ((amqp_method_number_t)0x000A0014) /**< connection.secure method id \
-                                        @internal 10, 20; 655380 */
-/** connection.secure method fields */
-typedef struct amqp_connection_secure_t_ {
-  amqp_bytes_t challenge; /**< challenge */
-} amqp_connection_secure_t;
-
-#define AMQP_CONNECTION_SECURE_OK_METHOD                                 \
-  ((amqp_method_number_t)0x000A0015) /**< connection.secure-ok method id \
-                                        @internal 10, 21; 655381 */
-/** connection.secure-ok method fields */
-typedef struct amqp_connection_secure_ok_t_ {
-  amqp_bytes_t response; /**< response */
-} amqp_connection_secure_ok_t;
-
-#define AMQP_CONNECTION_TUNE_METHOD                                 \
-  ((amqp_method_number_t)0x000A001E) /**< connection.tune method id \
-                                        @internal 10, 30; 655390 */
-/** connection.tune method fields */
-typedef struct amqp_connection_tune_t_ {
-  uint16_t channel_max; /**< channel-max */
-  uint32_t frame_max;   /**< frame-max */
-  uint16_t heartbeat;   /**< heartbeat */
-} amqp_connection_tune_t;
-
-#define AMQP_CONNECTION_TUNE_OK_METHOD                                 \
-  ((amqp_method_number_t)0x000A001F) /**< connection.tune-ok method id \
-                                        @internal 10, 31; 655391 */
-/** connection.tune-ok method fields */
-typedef struct amqp_connection_tune_ok_t_ {
-  uint16_t channel_max; /**< channel-max */
-  uint32_t frame_max;   /**< frame-max */
-  uint16_t heartbeat;   /**< heartbeat */
-} amqp_connection_tune_ok_t;
-
-#define AMQP_CONNECTION_OPEN_METHOD                                 \
-  ((amqp_method_number_t)0x000A0028) /**< connection.open method id \
-                                        @internal 10, 40; 655400 */
-/** connection.open method fields */
-typedef struct amqp_connection_open_t_ {
-  amqp_bytes_t virtual_host; /**< virtual-host */
-  amqp_bytes_t capabilities; /**< capabilities */
-  amqp_boolean_t insist;     /**< insist */
-} amqp_connection_open_t;
-
-#define AMQP_CONNECTION_OPEN_OK_METHOD                                 \
-  ((amqp_method_number_t)0x000A0029) /**< connection.open-ok method id \
-                                        @internal 10, 41; 655401 */
-/** connection.open-ok method fields */
-typedef struct amqp_connection_open_ok_t_ {
-  amqp_bytes_t known_hosts; /**< known-hosts */
-} amqp_connection_open_ok_t;
-
-#define AMQP_CONNECTION_CLOSE_METHOD                                 \
-  ((amqp_method_number_t)0x000A0032) /**< connection.close method id \
-                                        @internal 10, 50; 655410 */
-/** connection.close method fields */
-typedef struct amqp_connection_close_t_ {
-  uint16_t reply_code;     /**< reply-code */
-  amqp_bytes_t reply_text; /**< reply-text */
-  uint16_t class_id;       /**< class-id */
-  uint16_t method_id;      /**< method-id */
-} amqp_connection_close_t;
-
-#define AMQP_CONNECTION_CLOSE_OK_METHOD                                 \
-  ((amqp_method_number_t)0x000A0033) /**< connection.close-ok method id \
-                                        @internal 10, 51; 655411 */
-/** connection.close-ok method fields */
-typedef struct amqp_connection_close_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_connection_close_ok_t;
-
-#define AMQP_CONNECTION_BLOCKED_METHOD                                 \
-  ((amqp_method_number_t)0x000A003C) /**< connection.blocked method id \
-                                        @internal 10, 60; 655420 */
-/** connection.blocked method fields */
-typedef struct amqp_connection_blocked_t_ {
-  amqp_bytes_t reason; /**< reason */
-} amqp_connection_blocked_t;
-
-#define AMQP_CONNECTION_UNBLOCKED_METHOD                                 \
-  ((amqp_method_number_t)0x000A003D) /**< connection.unblocked method id \
-                                        @internal 10, 61; 655421 */
-/** connection.unblocked method fields */
-typedef struct amqp_connection_unblocked_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_connection_unblocked_t;
-
-#define AMQP_CHANNEL_OPEN_METHOD                                           \
-  ((amqp_method_number_t)0x0014000A) /**< channel.open method id @internal \
-                                        20, 10; 1310730 */
-/** channel.open method fields */
-typedef struct amqp_channel_open_t_ {
-  amqp_bytes_t out_of_band; /**< out-of-band */
-} amqp_channel_open_t;
-
-#define AMQP_CHANNEL_OPEN_OK_METHOD                                 \
-  ((amqp_method_number_t)0x0014000B) /**< channel.open-ok method id \
-                                        @internal 20, 11; 1310731 */
-/** channel.open-ok method fields */
-typedef struct amqp_channel_open_ok_t_ {
-  amqp_bytes_t channel_id; /**< channel-id */
-} amqp_channel_open_ok_t;
-
-#define AMQP_CHANNEL_FLOW_METHOD                                           \
-  ((amqp_method_number_t)0x00140014) /**< channel.flow method id @internal \
-                                        20, 20; 1310740 */
-/** channel.flow method fields */
-typedef struct amqp_channel_flow_t_ {
-  amqp_boolean_t active; /**< active */
-} amqp_channel_flow_t;
-
-#define AMQP_CHANNEL_FLOW_OK_METHOD                                 \
-  ((amqp_method_number_t)0x00140015) /**< channel.flow-ok method id \
-                                        @internal 20, 21; 1310741 */
-/** channel.flow-ok method fields */
-typedef struct amqp_channel_flow_ok_t_ {
-  amqp_boolean_t active; /**< active */
-} amqp_channel_flow_ok_t;
-
-#define AMQP_CHANNEL_CLOSE_METHOD                                           \
-  ((amqp_method_number_t)0x00140028) /**< channel.close method id @internal \
-                                        20, 40; 1310760 */
-/** channel.close method fields */
-typedef struct amqp_channel_close_t_ {
-  uint16_t reply_code;     /**< reply-code */
-  amqp_bytes_t reply_text; /**< reply-text */
-  uint16_t class_id;       /**< class-id */
-  uint16_t method_id;      /**< method-id */
-} amqp_channel_close_t;
-
-#define AMQP_CHANNEL_CLOSE_OK_METHOD                                 \
-  ((amqp_method_number_t)0x00140029) /**< channel.close-ok method id \
-                                        @internal 20, 41; 1310761 */
-/** channel.close-ok method fields */
-typedef struct amqp_channel_close_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_channel_close_ok_t;
-
-#define AMQP_ACCESS_REQUEST_METHOD                                           \
-  ((amqp_method_number_t)0x001E000A) /**< access.request method id @internal \
-                                        30, 10; 1966090 */
-/** access.request method fields */
-typedef struct amqp_access_request_t_ {
-  amqp_bytes_t realm;       /**< realm */
-  amqp_boolean_t exclusive; /**< exclusive */
-  amqp_boolean_t passive;   /**< passive */
-  amqp_boolean_t active;    /**< active */
-  amqp_boolean_t write;     /**< write */
-  amqp_boolean_t read;      /**< read */
-} amqp_access_request_t;
-
-#define AMQP_ACCESS_REQUEST_OK_METHOD                                 \
-  ((amqp_method_number_t)0x001E000B) /**< access.request-ok method id \
-                                        @internal 30, 11; 1966091 */
-/** access.request-ok method fields */
-typedef struct amqp_access_request_ok_t_ {
-  uint16_t ticket; /**< ticket */
-} amqp_access_request_ok_t;
-
-#define AMQP_EXCHANGE_DECLARE_METHOD                                 \
-  ((amqp_method_number_t)0x0028000A) /**< exchange.declare method id \
-                                        @internal 40, 10; 2621450 */
-/** exchange.declare method fields */
-typedef struct amqp_exchange_declare_t_ {
-  uint16_t ticket;            /**< ticket */
-  amqp_bytes_t exchange;      /**< exchange */
-  amqp_bytes_t type;          /**< type */
-  amqp_boolean_t passive;     /**< passive */
-  amqp_boolean_t durable;     /**< durable */
-  amqp_boolean_t auto_delete; /**< auto-delete */
-  amqp_boolean_t internal;    /**< internal */
-  amqp_boolean_t nowait;      /**< nowait */
-  amqp_table_t arguments;     /**< arguments */
-} amqp_exchange_declare_t;
-
-#define AMQP_EXCHANGE_DECLARE_OK_METHOD                                 \
-  ((amqp_method_number_t)0x0028000B) /**< exchange.declare-ok method id \
-                                        @internal 40, 11; 2621451 */
-/** exchange.declare-ok method fields */
-typedef struct amqp_exchange_declare_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_exchange_declare_ok_t;
-
-#define AMQP_EXCHANGE_DELETE_METHOD                                 \
-  ((amqp_method_number_t)0x00280014) /**< exchange.delete method id \
-                                        @internal 40, 20; 2621460 */
-/** exchange.delete method fields */
-typedef struct amqp_exchange_delete_t_ {
-  uint16_t ticket;          /**< ticket */
-  amqp_bytes_t exchange;    /**< exchange */
-  amqp_boolean_t if_unused; /**< if-unused */
-  amqp_boolean_t nowait;    /**< nowait */
-} amqp_exchange_delete_t;
-
-#define AMQP_EXCHANGE_DELETE_OK_METHOD                                 \
-  ((amqp_method_number_t)0x00280015) /**< exchange.delete-ok method id \
-                                        @internal 40, 21; 2621461 */
-/** exchange.delete-ok method fields */
-typedef struct amqp_exchange_delete_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_exchange_delete_ok_t;
-
-#define AMQP_EXCHANGE_BIND_METHOD                                           \
-  ((amqp_method_number_t)0x0028001E) /**< exchange.bind method id @internal \
-                                        40, 30; 2621470 */
-/** exchange.bind method fields */
-typedef struct amqp_exchange_bind_t_ {
-  uint16_t ticket;          /**< ticket */
-  amqp_bytes_t destination; /**< destination */
-  amqp_bytes_t source;      /**< source */
-  amqp_bytes_t routing_key; /**< routing-key */
-  amqp_boolean_t nowait;    /**< nowait */
-  amqp_table_t arguments;   /**< arguments */
-} amqp_exchange_bind_t;
-
-#define AMQP_EXCHANGE_BIND_OK_METHOD                                 \
-  ((amqp_method_number_t)0x0028001F) /**< exchange.bind-ok method id \
-                                        @internal 40, 31; 2621471 */
-/** exchange.bind-ok method fields */
-typedef struct amqp_exchange_bind_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_exchange_bind_ok_t;
-
-#define AMQP_EXCHANGE_UNBIND_METHOD                                 \
-  ((amqp_method_number_t)0x00280028) /**< exchange.unbind method id \
-                                        @internal 40, 40; 2621480 */
-/** exchange.unbind method fields */
-typedef struct amqp_exchange_unbind_t_ {
-  uint16_t ticket;          /**< ticket */
-  amqp_bytes_t destination; /**< destination */
-  amqp_bytes_t source;      /**< source */
-  amqp_bytes_t routing_key; /**< routing-key */
-  amqp_boolean_t nowait;    /**< nowait */
-  amqp_table_t arguments;   /**< arguments */
-} amqp_exchange_unbind_t;
-
-#define AMQP_EXCHANGE_UNBIND_OK_METHOD                                 \
-  ((amqp_method_number_t)0x00280033) /**< exchange.unbind-ok method id \
-                                        @internal 40, 51; 2621491 */
-/** exchange.unbind-ok method fields */
-typedef struct amqp_exchange_unbind_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_exchange_unbind_ok_t;
-
-#define AMQP_QUEUE_DECLARE_METHOD                                           \
-  ((amqp_method_number_t)0x0032000A) /**< queue.declare method id @internal \
-                                        50, 10; 3276810 */
-/** queue.declare method fields */
-typedef struct amqp_queue_declare_t_ {
-  uint16_t ticket;            /**< ticket */
-  amqp_bytes_t queue;         /**< queue */
-  amqp_boolean_t passive;     /**< passive */
-  amqp_boolean_t durable;     /**< durable */
-  amqp_boolean_t exclusive;   /**< exclusive */
-  amqp_boolean_t auto_delete; /**< auto-delete */
-  amqp_boolean_t nowait;      /**< nowait */
-  amqp_table_t arguments;     /**< arguments */
-} amqp_queue_declare_t;
-
-#define AMQP_QUEUE_DECLARE_OK_METHOD                                 \
-  ((amqp_method_number_t)0x0032000B) /**< queue.declare-ok method id \
-                                        @internal 50, 11; 3276811 */
-/** queue.declare-ok method fields */
-typedef struct amqp_queue_declare_ok_t_ {
-  amqp_bytes_t queue;      /**< queue */
-  uint32_t message_count;  /**< message-count */
-  uint32_t consumer_count; /**< consumer-count */
-} amqp_queue_declare_ok_t;
-
-#define AMQP_QUEUE_BIND_METHOD                                               \
-  ((amqp_method_number_t)0x00320014) /**< queue.bind method id @internal 50, \
-                                        20; 3276820 */
-/** queue.bind method fields */
-typedef struct amqp_queue_bind_t_ {
-  uint16_t ticket;          /**< ticket */
-  amqp_bytes_t queue;       /**< queue */
-  amqp_bytes_t exchange;    /**< exchange */
-  amqp_bytes_t routing_key; /**< routing-key */
-  amqp_boolean_t nowait;    /**< nowait */
-  amqp_table_t arguments;   /**< arguments */
-} amqp_queue_bind_t;
-
-#define AMQP_QUEUE_BIND_OK_METHOD                                           \
-  ((amqp_method_number_t)0x00320015) /**< queue.bind-ok method id @internal \
-                                        50, 21; 3276821 */
-/** queue.bind-ok method fields */
-typedef struct amqp_queue_bind_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_queue_bind_ok_t;
-
-#define AMQP_QUEUE_PURGE_METHOD                                           \
-  ((amqp_method_number_t)0x0032001E) /**< queue.purge method id @internal \
-                                        50, 30; 3276830 */
-/** queue.purge method fields */
-typedef struct amqp_queue_purge_t_ {
-  uint16_t ticket;       /**< ticket */
-  amqp_bytes_t queue;    /**< queue */
-  amqp_boolean_t nowait; /**< nowait */
-} amqp_queue_purge_t;
-
-#define AMQP_QUEUE_PURGE_OK_METHOD                                           \
-  ((amqp_method_number_t)0x0032001F) /**< queue.purge-ok method id @internal \
-                                        50, 31; 3276831 */
-/** queue.purge-ok method fields */
-typedef struct amqp_queue_purge_ok_t_ {
-  uint32_t message_count; /**< message-count */
-} amqp_queue_purge_ok_t;
-
-#define AMQP_QUEUE_DELETE_METHOD                                           \
-  ((amqp_method_number_t)0x00320028) /**< queue.delete method id @internal \
-                                        50, 40; 3276840 */
-/** queue.delete method fields */
-typedef struct amqp_queue_delete_t_ {
-  uint16_t ticket;          /**< ticket */
-  amqp_bytes_t queue;       /**< queue */
-  amqp_boolean_t if_unused; /**< if-unused */
-  amqp_boolean_t if_empty;  /**< if-empty */
-  amqp_boolean_t nowait;    /**< nowait */
-} amqp_queue_delete_t;
-
-#define AMQP_QUEUE_DELETE_OK_METHOD                                 \
-  ((amqp_method_number_t)0x00320029) /**< queue.delete-ok method id \
-                                        @internal 50, 41; 3276841 */
-/** queue.delete-ok method fields */
-typedef struct amqp_queue_delete_ok_t_ {
-  uint32_t message_count; /**< message-count */
-} amqp_queue_delete_ok_t;
-
-#define AMQP_QUEUE_UNBIND_METHOD                                           \
-  ((amqp_method_number_t)0x00320032) /**< queue.unbind method id @internal \
-                                        50, 50; 3276850 */
-/** queue.unbind method fields */
-typedef struct amqp_queue_unbind_t_ {
-  uint16_t ticket;          /**< ticket */
-  amqp_bytes_t queue;       /**< queue */
-  amqp_bytes_t exchange;    /**< exchange */
-  amqp_bytes_t routing_key; /**< routing-key */
-  amqp_table_t arguments;   /**< arguments */
-} amqp_queue_unbind_t;
-
-#define AMQP_QUEUE_UNBIND_OK_METHOD                                 \
-  ((amqp_method_number_t)0x00320033) /**< queue.unbind-ok method id \
-                                        @internal 50, 51; 3276851 */
-/** queue.unbind-ok method fields */
-typedef struct amqp_queue_unbind_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_queue_unbind_ok_t;
-
-#define AMQP_BASIC_QOS_METHOD                                               \
-  ((amqp_method_number_t)0x003C000A) /**< basic.qos method id @internal 60, \
-                                        10; 3932170 */
-/** basic.qos method fields */
-typedef struct amqp_basic_qos_t_ {
-  uint32_t prefetch_size;  /**< prefetch-size */
-  uint16_t prefetch_count; /**< prefetch-count */
-  amqp_boolean_t global;   /**< global */
-} amqp_basic_qos_t;
-
-#define AMQP_BASIC_QOS_OK_METHOD                                           \
-  ((amqp_method_number_t)0x003C000B) /**< basic.qos-ok method id @internal \
-                                        60, 11; 3932171 */
-/** basic.qos-ok method fields */
-typedef struct amqp_basic_qos_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_basic_qos_ok_t;
-
-#define AMQP_BASIC_CONSUME_METHOD                                           \
-  ((amqp_method_number_t)0x003C0014) /**< basic.consume method id @internal \
-                                        60, 20; 3932180 */
-/** basic.consume method fields */
-typedef struct amqp_basic_consume_t_ {
-  uint16_t ticket;           /**< ticket */
-  amqp_bytes_t queue;        /**< queue */
-  amqp_bytes_t consumer_tag; /**< consumer-tag */
-  amqp_boolean_t no_local;   /**< no-local */
-  amqp_boolean_t no_ack;     /**< no-ack */
-  amqp_boolean_t exclusive;  /**< exclusive */
-  amqp_boolean_t nowait;     /**< nowait */
-  amqp_table_t arguments;    /**< arguments */
-} amqp_basic_consume_t;
-
-#define AMQP_BASIC_CONSUME_OK_METHOD                                 \
-  ((amqp_method_number_t)0x003C0015) /**< basic.consume-ok method id \
-                                        @internal 60, 21; 3932181 */
-/** basic.consume-ok method fields */
-typedef struct amqp_basic_consume_ok_t_ {
-  amqp_bytes_t consumer_tag; /**< consumer-tag */
-} amqp_basic_consume_ok_t;
-
-#define AMQP_BASIC_CANCEL_METHOD                                           \
-  ((amqp_method_number_t)0x003C001E) /**< basic.cancel method id @internal \
-                                        60, 30; 3932190 */
-/** basic.cancel method fields */
-typedef struct amqp_basic_cancel_t_ {
-  amqp_bytes_t consumer_tag; /**< consumer-tag */
-  amqp_boolean_t nowait;     /**< nowait */
-} amqp_basic_cancel_t;
-
-#define AMQP_BASIC_CANCEL_OK_METHOD                                 \
-  ((amqp_method_number_t)0x003C001F) /**< basic.cancel-ok method id \
-                                        @internal 60, 31; 3932191 */
-/** basic.cancel-ok method fields */
-typedef struct amqp_basic_cancel_ok_t_ {
-  amqp_bytes_t consumer_tag; /**< consumer-tag */
-} amqp_basic_cancel_ok_t;
-
-#define AMQP_BASIC_PUBLISH_METHOD                                           \
-  ((amqp_method_number_t)0x003C0028) /**< basic.publish method id @internal \
-                                        60, 40; 3932200 */
-/** basic.publish method fields */
-typedef struct amqp_basic_publish_t_ {
-  uint16_t ticket;          /**< ticket */
-  amqp_bytes_t exchange;    /**< exchange */
-  amqp_bytes_t routing_key; /**< routing-key */
-  amqp_boolean_t mandatory; /**< mandatory */
-  amqp_boolean_t immediate; /**< immediate */
-} amqp_basic_publish_t;
-
-#define AMQP_BASIC_RETURN_METHOD                                           \
-  ((amqp_method_number_t)0x003C0032) /**< basic.return method id @internal \
-                                        60, 50; 3932210 */
-/** basic.return method fields */
-typedef struct amqp_basic_return_t_ {
-  uint16_t reply_code;      /**< reply-code */
-  amqp_bytes_t reply_text;  /**< reply-text */
-  amqp_bytes_t exchange;    /**< exchange */
-  amqp_bytes_t routing_key; /**< routing-key */
-} amqp_basic_return_t;
-
-#define AMQP_BASIC_DELIVER_METHOD                                           \
-  ((amqp_method_number_t)0x003C003C) /**< basic.deliver method id @internal \
-                                        60, 60; 3932220 */
-/** basic.deliver method fields */
-typedef struct amqp_basic_deliver_t_ {
-  amqp_bytes_t consumer_tag;  /**< consumer-tag */
-  uint64_t delivery_tag;      /**< delivery-tag */
-  amqp_boolean_t redelivered; /**< redelivered */
-  amqp_bytes_t exchange;      /**< exchange */
-  amqp_bytes_t routing_key;   /**< routing-key */
-} amqp_basic_deliver_t;
-
-#define AMQP_BASIC_GET_METHOD                                               \
-  ((amqp_method_number_t)0x003C0046) /**< basic.get method id @internal 60, \
-                                        70; 3932230 */
-/** basic.get method fields */
-typedef struct amqp_basic_get_t_ {
-  uint16_t ticket;       /**< ticket */
-  amqp_bytes_t queue;    /**< queue */
-  amqp_boolean_t no_ack; /**< no-ack */
-} amqp_basic_get_t;
-
-#define AMQP_BASIC_GET_OK_METHOD                                           \
-  ((amqp_method_number_t)0x003C0047) /**< basic.get-ok method id @internal \
-                                        60, 71; 3932231 */
-/** basic.get-ok method fields */
-typedef struct amqp_basic_get_ok_t_ {
-  uint64_t delivery_tag;      /**< delivery-tag */
-  amqp_boolean_t redelivered; /**< redelivered */
-  amqp_bytes_t exchange;      /**< exchange */
-  amqp_bytes_t routing_key;   /**< routing-key */
-  uint32_t message_count;     /**< message-count */
-} amqp_basic_get_ok_t;
-
-#define AMQP_BASIC_GET_EMPTY_METHOD                                 \
-  ((amqp_method_number_t)0x003C0048) /**< basic.get-empty method id \
-                                        @internal 60, 72; 3932232 */
-/** basic.get-empty method fields */
-typedef struct amqp_basic_get_empty_t_ {
-  amqp_bytes_t cluster_id; /**< cluster-id */
-} amqp_basic_get_empty_t;
-
-#define AMQP_BASIC_ACK_METHOD                                               \
-  ((amqp_method_number_t)0x003C0050) /**< basic.ack method id @internal 60, \
-                                        80; 3932240 */
-/** basic.ack method fields */
-typedef struct amqp_basic_ack_t_ {
-  uint64_t delivery_tag;   /**< delivery-tag */
-  amqp_boolean_t multiple; /**< multiple */
-} amqp_basic_ack_t;
-
-#define AMQP_BASIC_REJECT_METHOD                                           \
-  ((amqp_method_number_t)0x003C005A) /**< basic.reject method id @internal \
-                                        60, 90; 3932250 */
-/** basic.reject method fields */
-typedef struct amqp_basic_reject_t_ {
-  uint64_t delivery_tag;  /**< delivery-tag */
-  amqp_boolean_t requeue; /**< requeue */
-} amqp_basic_reject_t;
-
-#define AMQP_BASIC_RECOVER_ASYNC_METHOD                                 \
-  ((amqp_method_number_t)0x003C0064) /**< basic.recover-async method id \
-                                        @internal 60, 100; 3932260 */
-/** basic.recover-async method fields */
-typedef struct amqp_basic_recover_async_t_ {
-  amqp_boolean_t requeue; /**< requeue */
-} amqp_basic_recover_async_t;
-
-#define AMQP_BASIC_RECOVER_METHOD                                           \
-  ((amqp_method_number_t)0x003C006E) /**< basic.recover method id @internal \
-                                        60, 110; 3932270 */
-/** basic.recover method fields */
-typedef struct amqp_basic_recover_t_ {
-  amqp_boolean_t requeue; /**< requeue */
-} amqp_basic_recover_t;
-
-#define AMQP_BASIC_RECOVER_OK_METHOD                                 \
-  ((amqp_method_number_t)0x003C006F) /**< basic.recover-ok method id \
-                                        @internal 60, 111; 3932271 */
-/** basic.recover-ok method fields */
-typedef struct amqp_basic_recover_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_basic_recover_ok_t;
-
-#define AMQP_BASIC_NACK_METHOD                                               \
-  ((amqp_method_number_t)0x003C0078) /**< basic.nack method id @internal 60, \
-                                        120; 3932280 */
-/** basic.nack method fields */
-typedef struct amqp_basic_nack_t_ {
-  uint64_t delivery_tag;   /**< delivery-tag */
-  amqp_boolean_t multiple; /**< multiple */
-  amqp_boolean_t requeue;  /**< requeue */
-} amqp_basic_nack_t;
-
-#define AMQP_TX_SELECT_METHOD                                               \
-  ((amqp_method_number_t)0x005A000A) /**< tx.select method id @internal 90, \
-                                        10; 5898250 */
-/** tx.select method fields */
-typedef struct amqp_tx_select_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_tx_select_t;
-
-#define AMQP_TX_SELECT_OK_METHOD                                           \
-  ((amqp_method_number_t)0x005A000B) /**< tx.select-ok method id @internal \
-                                        90, 11; 5898251 */
-/** tx.select-ok method fields */
-typedef struct amqp_tx_select_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_tx_select_ok_t;
-
-#define AMQP_TX_COMMIT_METHOD                                               \
-  ((amqp_method_number_t)0x005A0014) /**< tx.commit method id @internal 90, \
-                                        20; 5898260 */
-/** tx.commit method fields */
-typedef struct amqp_tx_commit_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_tx_commit_t;
-
-#define AMQP_TX_COMMIT_OK_METHOD                                           \
-  ((amqp_method_number_t)0x005A0015) /**< tx.commit-ok method id @internal \
-                                        90, 21; 5898261 */
-/** tx.commit-ok method fields */
-typedef struct amqp_tx_commit_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_tx_commit_ok_t;
-
-#define AMQP_TX_ROLLBACK_METHOD                                           \
-  ((amqp_method_number_t)0x005A001E) /**< tx.rollback method id @internal \
-                                        90, 30; 5898270 */
-/** tx.rollback method fields */
-typedef struct amqp_tx_rollback_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_tx_rollback_t;
-
-#define AMQP_TX_ROLLBACK_OK_METHOD                                           \
-  ((amqp_method_number_t)0x005A001F) /**< tx.rollback-ok method id @internal \
-                                        90, 31; 5898271 */
-/** tx.rollback-ok method fields */
-typedef struct amqp_tx_rollback_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_tx_rollback_ok_t;
-
-#define AMQP_CONFIRM_SELECT_METHOD                                           \
-  ((amqp_method_number_t)0x0055000A) /**< confirm.select method id @internal \
-                                        85, 10; 5570570 */
-/** confirm.select method fields */
-typedef struct amqp_confirm_select_t_ {
-  amqp_boolean_t nowait; /**< nowait */
-} amqp_confirm_select_t;
-
-#define AMQP_CONFIRM_SELECT_OK_METHOD                                 \
-  ((amqp_method_number_t)0x0055000B) /**< confirm.select-ok method id \
-                                        @internal 85, 11; 5570571 */
-/** confirm.select-ok method fields */
-typedef struct amqp_confirm_select_ok_t_ {
-  char dummy; /**< Dummy field to avoid empty struct */
-} amqp_confirm_select_ok_t;
-
-/* Class property records. */
-#define AMQP_CONNECTION_CLASS                    \
-  (0x000A) /**< connection class id @internal 10 \
-              */
-/** connection class properties */
-typedef struct amqp_connection_properties_t_ {
-  amqp_flags_t _flags; /**< bit-mask of set fields */
-  char dummy;          /**< Dummy field to avoid empty struct */
-} amqp_connection_properties_t;
-
-#define AMQP_CHANNEL_CLASS (0x0014) /**< channel class id @internal 20 */
-/** channel class properties */
-typedef struct amqp_channel_properties_t_ {
-  amqp_flags_t _flags; /**< bit-mask of set fields */
-  char dummy;          /**< Dummy field to avoid empty struct */
-} amqp_channel_properties_t;
-
-#define AMQP_ACCESS_CLASS (0x001E) /**< access class id @internal 30 */
-/** access class properties */
-typedef struct amqp_access_properties_t_ {
-  amqp_flags_t _flags; /**< bit-mask of set fields */
-  char dummy;          /**< Dummy field to avoid empty struct */
-} amqp_access_properties_t;
-
-#define AMQP_EXCHANGE_CLASS (0x0028) /**< exchange class id @internal 40 */
-/** exchange class properties */
-typedef struct amqp_exchange_properties_t_ {
-  amqp_flags_t _flags; /**< bit-mask of set fields */
-  char dummy;          /**< Dummy field to avoid empty struct */
-} amqp_exchange_properties_t;
-
-#define AMQP_QUEUE_CLASS (0x0032) /**< queue class id @internal 50 */
-/** queue class properties */
-typedef struct amqp_queue_properties_t_ {
-  amqp_flags_t _flags; /**< bit-mask of set fields */
-  char dummy;          /**< Dummy field to avoid empty struct */
-} amqp_queue_properties_t;
-
-#define AMQP_BASIC_CLASS (0x003C) /**< basic class id @internal 60 */
-#define AMQP_BASIC_CONTENT_TYPE_FLAG (1 << 15)
-#define AMQP_BASIC_CONTENT_ENCODING_FLAG (1 << 14)
-#define AMQP_BASIC_HEADERS_FLAG (1 << 13)
-#define AMQP_BASIC_DELIVERY_MODE_FLAG (1 << 12)
-#define AMQP_BASIC_PRIORITY_FLAG (1 << 11)
-#define AMQP_BASIC_CORRELATION_ID_FLAG (1 << 10)
-#define AMQP_BASIC_REPLY_TO_FLAG (1 << 9)
-#define AMQP_BASIC_EXPIRATION_FLAG (1 << 8)
-#define AMQP_BASIC_MESSAGE_ID_FLAG (1 << 7)
-#define AMQP_BASIC_TIMESTAMP_FLAG (1 << 6)
-#define AMQP_BASIC_TYPE_FLAG (1 << 5)
-#define AMQP_BASIC_USER_ID_FLAG (1 << 4)
-#define AMQP_BASIC_APP_ID_FLAG (1 << 3)
-#define AMQP_BASIC_CLUSTER_ID_FLAG (1 << 2)
-/** basic class properties */
-typedef struct amqp_basic_properties_t_ {
-  amqp_flags_t _flags;           /**< bit-mask of set fields */
-  amqp_bytes_t content_type;     /**< content-type */
-  amqp_bytes_t content_encoding; /**< content-encoding */
-  amqp_table_t headers;          /**< headers */
-  uint8_t delivery_mode;         /**< delivery-mode */
-  uint8_t priority;              /**< priority */
-  amqp_bytes_t correlation_id;   /**< correlation-id */
-  amqp_bytes_t reply_to;         /**< reply-to */
-  amqp_bytes_t expiration;       /**< expiration */
-  amqp_bytes_t message_id;       /**< message-id */
-  uint64_t timestamp;            /**< timestamp */
-  amqp_bytes_t type;             /**< type */
-  amqp_bytes_t user_id;          /**< user-id */
-  amqp_bytes_t app_id;           /**< app-id */
-  amqp_bytes_t cluster_id;       /**< cluster-id */
-} amqp_basic_properties_t;
-
-#define AMQP_TX_CLASS (0x005A) /**< tx class id @internal 90 */
-/** tx class properties */
-typedef struct amqp_tx_properties_t_ {
-  amqp_flags_t _flags; /**< bit-mask of set fields */
-  char dummy;          /**< Dummy field to avoid empty struct */
-} amqp_tx_properties_t;
-
-#define AMQP_CONFIRM_CLASS (0x0055) /**< confirm class id @internal 85 */
-/** confirm class properties */
-typedef struct amqp_confirm_properties_t_ {
-  amqp_flags_t _flags; /**< bit-mask of set fields */
-  char dummy;          /**< Dummy field to avoid empty struct */
-} amqp_confirm_properties_t;
-
-/* API functions for methods */
-
-/**
- * amqp_channel_open
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_channel_open_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_channel_open_ok_t *AMQP_CALL
-    amqp_channel_open(amqp_connection_state_t state, amqp_channel_t channel);
-/**
- * amqp_channel_flow
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] active active
- * @returns amqp_channel_flow_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_channel_flow_ok_t *AMQP_CALL
-    amqp_channel_flow(amqp_connection_state_t state, amqp_channel_t channel,
-                      amqp_boolean_t active);
-/**
- * amqp_exchange_declare
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] exchange exchange
- * @param [in] type type
- * @param [in] passive passive
- * @param [in] durable durable
- * @param [in] auto_delete auto_delete
- * @param [in] internal internal
- * @param [in] arguments arguments
- * @returns amqp_exchange_declare_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_exchange_declare_ok_t *AMQP_CALL amqp_exchange_declare(
-    amqp_connection_state_t state, amqp_channel_t channel,
-    amqp_bytes_t exchange, amqp_bytes_t type, amqp_boolean_t passive,
-    amqp_boolean_t durable, amqp_boolean_t auto_delete, amqp_boolean_t internal,
-    amqp_table_t arguments);
-/**
- * amqp_exchange_delete
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] exchange exchange
- * @param [in] if_unused if_unused
- * @returns amqp_exchange_delete_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_exchange_delete_ok_t *AMQP_CALL
-    amqp_exchange_delete(amqp_connection_state_t state, amqp_channel_t channel,
-                         amqp_bytes_t exchange, amqp_boolean_t if_unused);
-/**
- * amqp_exchange_bind
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] destination destination
- * @param [in] source source
- * @param [in] routing_key routing_key
- * @param [in] arguments arguments
- * @returns amqp_exchange_bind_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_exchange_bind_ok_t *AMQP_CALL
-    amqp_exchange_bind(amqp_connection_state_t state, amqp_channel_t channel,
-                       amqp_bytes_t destination, amqp_bytes_t source,
-                       amqp_bytes_t routing_key, amqp_table_t arguments);
-/**
- * amqp_exchange_unbind
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] destination destination
- * @param [in] source source
- * @param [in] routing_key routing_key
- * @param [in] arguments arguments
- * @returns amqp_exchange_unbind_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_exchange_unbind_ok_t *AMQP_CALL
-    amqp_exchange_unbind(amqp_connection_state_t state, amqp_channel_t channel,
-                         amqp_bytes_t destination, amqp_bytes_t source,
-                         amqp_bytes_t routing_key, amqp_table_t arguments);
-/**
- * amqp_queue_declare
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] passive passive
- * @param [in] durable durable
- * @param [in] exclusive exclusive
- * @param [in] auto_delete auto_delete
- * @param [in] arguments arguments
- * @returns amqp_queue_declare_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_declare_ok_t *AMQP_CALL amqp_queue_declare(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_boolean_t passive, amqp_boolean_t durable, amqp_boolean_t exclusive,
-    amqp_boolean_t auto_delete, amqp_table_t arguments);
-/**
- * amqp_queue_bind
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] exchange exchange
- * @param [in] routing_key routing_key
- * @param [in] arguments arguments
- * @returns amqp_queue_bind_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_bind_ok_t *AMQP_CALL amqp_queue_bind(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_bytes_t exchange, amqp_bytes_t routing_key, amqp_table_t arguments);
-/**
- * amqp_queue_purge
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @returns amqp_queue_purge_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_purge_ok_t *AMQP_CALL amqp_queue_purge(amqp_connection_state_t state,
-                                                  amqp_channel_t channel,
-                                                  amqp_bytes_t queue);
-/**
- * amqp_queue_delete
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] if_unused if_unused
- * @param [in] if_empty if_empty
- * @returns amqp_queue_delete_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_delete_ok_t *AMQP_CALL amqp_queue_delete(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_boolean_t if_unused, amqp_boolean_t if_empty);
-/**
- * amqp_queue_unbind
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] exchange exchange
- * @param [in] routing_key routing_key
- * @param [in] arguments arguments
- * @returns amqp_queue_unbind_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_queue_unbind_ok_t *AMQP_CALL amqp_queue_unbind(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_bytes_t exchange, amqp_bytes_t routing_key, amqp_table_t arguments);
-/**
- * amqp_basic_qos
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] prefetch_size prefetch_size
- * @param [in] prefetch_count prefetch_count
- * @param [in] global global
- * @returns amqp_basic_qos_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_basic_qos_ok_t *AMQP_CALL amqp_basic_qos(amqp_connection_state_t state,
-                                              amqp_channel_t channel,
-                                              uint32_t prefetch_size,
-                                              uint16_t prefetch_count,
-                                              amqp_boolean_t global);
-/**
- * amqp_basic_consume
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] queue queue
- * @param [in] consumer_tag consumer_tag
- * @param [in] no_local no_local
- * @param [in] no_ack no_ack
- * @param [in] exclusive exclusive
- * @param [in] arguments arguments
- * @returns amqp_basic_consume_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_basic_consume_ok_t *AMQP_CALL amqp_basic_consume(
-    amqp_connection_state_t state, amqp_channel_t channel, amqp_bytes_t queue,
-    amqp_bytes_t consumer_tag, amqp_boolean_t no_local, amqp_boolean_t no_ack,
-    amqp_boolean_t exclusive, amqp_table_t arguments);
-/**
- * amqp_basic_cancel
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] consumer_tag consumer_tag
- * @returns amqp_basic_cancel_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_basic_cancel_ok_t *AMQP_CALL
-    amqp_basic_cancel(amqp_connection_state_t state, amqp_channel_t channel,
-                      amqp_bytes_t consumer_tag);
-/**
- * amqp_basic_recover
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @param [in] requeue requeue
- * @returns amqp_basic_recover_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_basic_recover_ok_t *AMQP_CALL
-    amqp_basic_recover(amqp_connection_state_t state, amqp_channel_t channel,
-                       amqp_boolean_t requeue);
-/**
- * amqp_tx_select
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_tx_select_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_tx_select_ok_t *AMQP_CALL amqp_tx_select(amqp_connection_state_t state,
-                                              amqp_channel_t channel);
-/**
- * amqp_tx_commit
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_tx_commit_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_tx_commit_ok_t *AMQP_CALL amqp_tx_commit(amqp_connection_state_t state,
-                                              amqp_channel_t channel);
-/**
- * amqp_tx_rollback
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_tx_rollback_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_tx_rollback_ok_t *AMQP_CALL amqp_tx_rollback(amqp_connection_state_t state,
-                                                  amqp_channel_t channel);
-/**
- * amqp_confirm_select
- *
- * @param [in] state connection state
- * @param [in] channel the channel to do the RPC on
- * @returns amqp_confirm_select_ok_t
- */
-AMQP_PUBLIC_FUNCTION
-amqp_confirm_select_ok_t *AMQP_CALL
-    amqp_confirm_select(amqp_connection_state_t state, amqp_channel_t channel);
-
-AMQP_END_DECLS
-
-#endif /* AMQP_FRAMING_H */

ext/librabbitmq/librabbitmq/amqp_hostcheck.c

@@ -1,195 +0,0 @@
-/*
- * Copyright 1996-2014 Daniel Stenberg <[email protected]>.
- * Copyright 2014 Michael Steinert
- *
- * All rights reserved.
- *
- * 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", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS.
- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
- * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
- * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
- * USE OR OTHER DEALINGS IN THE SOFTWARE.
- *
- * Except as contained in this notice, the name of a copyright holder shall
- * not be used in advertising or otherwise to promote the sale, use or other
- * dealings in this Software without prior written authorization of the
- * copyright holder.
- */
-
-#include "amqp_hostcheck.h"
-
-#include <string.h>
-
-/* Portable, consistent toupper (remember EBCDIC). Do not use toupper()
- * because its behavior is altered by the current locale.
- */
-
-static char amqp_raw_toupper(char in) {
-  switch (in) {
-    case 'a':
-      return 'A';
-    case 'b':
-      return 'B';
-    case 'c':
-      return 'C';
-    case 'd':
-      return 'D';
-    case 'e':
-      return 'E';
-    case 'f':
-      return 'F';
-    case 'g':
-      return 'G';
-    case 'h':
-      return 'H';
-    case 'i':
-      return 'I';
-    case 'j':
-      return 'J';
-    case 'k':
-      return 'K';
-    case 'l':
-      return 'L';
-    case 'm':
-      return 'M';
-    case 'n':
-      return 'N';
-    case 'o':
-      return 'O';
-    case 'p':
-      return 'P';
-    case 'q':
-      return 'Q';
-    case 'r':
-      return 'R';
-    case 's':
-      return 'S';
-    case 't':
-      return 'T';
-    case 'u':
-      return 'U';
-    case 'v':
-      return 'V';
-    case 'w':
-      return 'W';
-    case 'x':
-      return 'X';
-    case 'y':
-      return 'Y';
-    case 'z':
-      return 'Z';
-  }
-  return in;
-}
-
-/*
- * amqp_raw_equal() is for doing "raw" case insensitive strings. This is meant
- * to be locale independent and only compare strings we know are safe for
- * this. See http://daniel.haxx.se/blog/2008/10/15/strcasecmp-in-turkish/ for
- * some further explanation to why this function is necessary.
- *
- * The function is capable of comparing a-z case insensitively even for
- * non-ascii.
- */
-
-static int amqp_raw_equal(const char *first, const char *second) {
-  while (*first && *second) {
-    if (amqp_raw_toupper(*first) != amqp_raw_toupper(*second)) {
-      /* get out of the loop as soon as they don't match */
-      break;
-    }
-    first++;
-    second++;
-  }
-  /* we do the comparison here (possibly again), just to make sure that if
-   * the loop above is skipped because one of the strings reached zero, we
-   * must not return this as a successful match
-   */
-  return (amqp_raw_toupper(*first) == amqp_raw_toupper(*second));
-}
-
-static int amqp_raw_nequal(const char *first, const char *second, size_t max) {
-  while (*first && *second && max) {
-    if (amqp_raw_toupper(*first) != amqp_raw_toupper(*second)) {
-      break;
-    }
-    max--;
-    first++;
-    second++;
-  }
-  if (0 == max) {
-    return 1; /* they are equal this far */
-  }
-  return amqp_raw_toupper(*first) == amqp_raw_toupper(*second);
-}
-
-/*
- * Match a hostname against a wildcard pattern.
- * E.g.
- *  "foo.host.com" matches "*.host.com".
- *
- * We use the matching rule described in RFC6125, section 6.4.3.
- * http://tools.ietf.org/html/rfc6125#section-6.4.3
- */
-
-static amqp_hostcheck_result amqp_hostmatch(const char *hostname,
-                                            const char *pattern) {
-  const char *pattern_label_end, *pattern_wildcard, *hostname_label_end;
-  int wildcard_enabled;
-  size_t prefixlen, suffixlen;
-  pattern_wildcard = strchr(pattern, '*');
-  if (pattern_wildcard == NULL) {
-    return amqp_raw_equal(pattern, hostname) ? AMQP_HCR_MATCH
-                                             : AMQP_HCR_NO_MATCH;
-  }
-  /* We require at least 2 dots in pattern to avoid too wide wildcard match. */
-  wildcard_enabled = 1;
-  pattern_label_end = strchr(pattern, '.');
-  if (pattern_label_end == NULL || strchr(pattern_label_end + 1, '.') == NULL ||
-      pattern_wildcard > pattern_label_end ||
-      amqp_raw_nequal(pattern, "xn--", 4)) {
-    wildcard_enabled = 0;
-  }
-  if (!wildcard_enabled) {
-    return amqp_raw_equal(pattern, hostname) ? AMQP_HCR_MATCH
-                                             : AMQP_HCR_NO_MATCH;
-  }
-  hostname_label_end = strchr(hostname, '.');
-  if (hostname_label_end == NULL ||
-      !amqp_raw_equal(pattern_label_end, hostname_label_end)) {
-    return AMQP_HCR_NO_MATCH;
-  }
-  /* The wildcard must match at least one character, so the left-most
-   * label of the hostname is at least as large as the left-most label
-   * of the pattern.
-   */
-  if (hostname_label_end - hostname < pattern_label_end - pattern) {
-    return AMQP_HCR_NO_MATCH;
-  }
-  prefixlen = pattern_wildcard - pattern;
-  suffixlen = pattern_label_end - (pattern_wildcard + 1);
-  return amqp_raw_nequal(pattern, hostname, prefixlen) &&
-                 amqp_raw_nequal(pattern_wildcard + 1,
-                                 hostname_label_end - suffixlen, suffixlen)
-             ? AMQP_HCR_MATCH
-             : AMQP_HCR_NO_MATCH;
-}
-
-amqp_hostcheck_result amqp_hostcheck(const char *match_pattern,
-                                     const char *hostname) {
-  /* sanity check */
-  if (!match_pattern || !*match_pattern || !hostname || !*hostname) {
-    return AMQP_HCR_NO_MATCH;
-  }
-  /* trivial case */
-  if (amqp_raw_equal(hostname, match_pattern)) {
-    return AMQP_HCR_MATCH;
-  }
-  return amqp_hostmatch(hostname, match_pattern);
-}

ext/librabbitmq/librabbitmq/amqp_hostcheck.h

@@ -1,48 +0,0 @@
-#ifndef librabbitmq_amqp_hostcheck_h
-#define librabbitmq_amqp_hostcheck_h
-
-/*
- * Copyright 1996-2014 Daniel Stenberg <[email protected]>.
- * Copyright 2014 Michael Steinert
- *
- * All rights reserved.
- *
- * 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", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS.
- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
- * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
- * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
- * USE OR OTHER DEALINGS IN THE SOFTWARE.
- *
- * Except as contained in this notice, the name of a copyright holder shall
- * not be used in advertising or otherwise to promote the sale, use or other
- * dealings in this Software without prior written authorization of the
- * copyright holder.
- */
-
-typedef enum {
-  AMQP_HCR_NO_MATCH = 0,
-  AMQP_HCR_MATCH = 1
-} amqp_hostcheck_result;
-
-/**
- * Determine whether hostname matches match_pattern.
- *
- * match_pattern may include wildcards.
- *
- * Match is performed based on the rules set forth in RFC6125 section 6.4.3.
- * http://tools.ietf.org/html/rfc6125#section-6.4.3
- *
- * \param match_pattern RFC6125 compliant pattern
- * \param hostname to match against
- * \returns AMQP_HCR_MATCH if its a match, AMQP_HCR_NO_MATCH otherwise.
- */
-amqp_hostcheck_result amqp_hostcheck(const char *match_pattern,
-                                     const char *hostname);
-
-#endif

ext/librabbitmq/librabbitmq/amqp_mem.c

@@ -1,242 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include "amqp_private.h"
-#include <assert.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-#include <sys/types.h>
-
-char const *amqp_version(void) { return AMQP_VERSION_STRING; }
-
-uint32_t amqp_version_number(void) { return AMQP_VERSION; }
-
-void init_amqp_pool(amqp_pool_t *pool, size_t pagesize) {
-  pool->pagesize = pagesize ? pagesize : 4096;
-
-  pool->pages.num_blocks = 0;
-  pool->pages.blocklist = NULL;
-
-  pool->large_blocks.num_blocks = 0;
-  pool->large_blocks.blocklist = NULL;
-
-  pool->next_page = 0;
-  pool->alloc_block = NULL;
-  pool->alloc_used = 0;
-}
-
-static void empty_blocklist(amqp_pool_blocklist_t *x) {
-  int i;
-
-  if (x->blocklist != NULL) {
-    for (i = 0; i < x->num_blocks; i++) {
-      free(x->blocklist[i]);
-    }
-    free(x->blocklist);
-  }
-  x->num_blocks = 0;
-  x->blocklist = NULL;
-}
-
-void recycle_amqp_pool(amqp_pool_t *pool) {
-  empty_blocklist(&pool->large_blocks);
-  pool->next_page = 0;
-  pool->alloc_block = NULL;
-  pool->alloc_used = 0;
-}
-
-void empty_amqp_pool(amqp_pool_t *pool) {
-  recycle_amqp_pool(pool);
-  empty_blocklist(&pool->pages);
-}
-
-/* Returns 1 on success, 0 on failure */
-static int record_pool_block(amqp_pool_blocklist_t *x, void *block) {
-  size_t blocklistlength = sizeof(void *) * (x->num_blocks + 1);
-
-  if (x->blocklist == NULL) {
-    x->blocklist = malloc(blocklistlength);
-    if (x->blocklist == NULL) {
-      return 0;
-    }
-  } else {
-    void *newbl = realloc(x->blocklist, blocklistlength);
-    if (newbl == NULL) {
-      return 0;
-    }
-    x->blocklist = newbl;
-  }
-
-  x->blocklist[x->num_blocks] = block;
-  x->num_blocks++;
-  return 1;
-}
-
-void *amqp_pool_alloc(amqp_pool_t *pool, size_t amount) {
-  if (amount == 0) {
-    return NULL;
-  }
-
-  amount = (amount + 7) & (~7); /* round up to nearest 8-byte boundary */
-
-  if (amount > pool->pagesize) {
-    void *result = calloc(1, amount);
-    if (result == NULL) {
-      return NULL;
-    }
-    if (!record_pool_block(&pool->large_blocks, result)) {
-      free(result);
-      return NULL;
-    }
-    return result;
-  }
-
-  if (pool->alloc_block != NULL) {
-    assert(pool->alloc_used <= pool->pagesize);
-
-    if (pool->alloc_used + amount <= pool->pagesize) {
-      void *result = pool->alloc_block + pool->alloc_used;
-      pool->alloc_used += amount;
-      return result;
-    }
-  }
-
-  if (pool->next_page >= pool->pages.num_blocks) {
-    pool->alloc_block = calloc(1, pool->pagesize);
-    if (pool->alloc_block == NULL) {
-      return NULL;
-    }
-    if (!record_pool_block(&pool->pages, pool->alloc_block)) {
-      return NULL;
-    }
-    pool->next_page = pool->pages.num_blocks;
-  } else {
-    pool->alloc_block = pool->pages.blocklist[pool->next_page];
-    pool->next_page++;
-  }
-
-  pool->alloc_used = amount;
-
-  return pool->alloc_block;
-}
-
-void amqp_pool_alloc_bytes(amqp_pool_t *pool, size_t amount,
-                           amqp_bytes_t *output) {
-  output->len = amount;
-  output->bytes = amqp_pool_alloc(pool, amount);
-}
-
-amqp_bytes_t amqp_cstring_bytes(char const *cstr) {
-  amqp_bytes_t result;
-  result.len = strlen(cstr);
-  result.bytes = (void *)cstr;
-  return result;
-}
-
-amqp_bytes_t amqp_bytes_malloc_dup(amqp_bytes_t src) {
-  amqp_bytes_t result;
-  result.len = src.len;
-  result.bytes = malloc(src.len);
-  if (result.bytes != NULL) {
-    memcpy(result.bytes, src.bytes, src.len);
-  }
-  return result;
-}
-
-amqp_bytes_t amqp_bytes_malloc(size_t amount) {
-  amqp_bytes_t result;
-  result.len = amount;
-  result.bytes = malloc(amount); /* will return NULL if it fails */
-  return result;
-}
-
-void amqp_bytes_free(amqp_bytes_t bytes) { free(bytes.bytes); }
-
-amqp_pool_t *amqp_get_or_create_channel_pool(amqp_connection_state_t state,
-                                             amqp_channel_t channel) {
-  amqp_pool_table_entry_t *entry;
-  size_t index = channel % POOL_TABLE_SIZE;
-
-  entry = state->pool_table[index];
-
-  for (; NULL != entry; entry = entry->next) {
-    if (channel == entry->channel) {
-      return &entry->pool;
-    }
-  }
-
-  entry = malloc(sizeof(amqp_pool_table_entry_t));
-  if (NULL == entry) {
-    return NULL;
-  }
-
-  entry->channel = channel;
-  entry->next = state->pool_table[index];
-  state->pool_table[index] = entry;
-
-  init_amqp_pool(&entry->pool, state->frame_max);
-
-  return &entry->pool;
-}
-
-amqp_pool_t *amqp_get_channel_pool(amqp_connection_state_t state,
-                                   amqp_channel_t channel) {
-  amqp_pool_table_entry_t *entry;
-  size_t index = channel % POOL_TABLE_SIZE;
-
-  entry = state->pool_table[index];
-
-  for (; NULL != entry; entry = entry->next) {
-    if (channel == entry->channel) {
-      return &entry->pool;
-    }
-  }
-
-  return NULL;
-}
-
-int amqp_bytes_equal(amqp_bytes_t r, amqp_bytes_t l) {
-  if (r.len == l.len &&
-      (r.bytes == l.bytes || 0 == memcmp(r.bytes, l.bytes, r.len))) {
-    return 1;
-  }
-  return 0;
-}

ext/librabbitmq/librabbitmq/amqp_openssl.c

@@ -1,704 +0,0 @@
-/*
- * Portions created by Alan Antonuk are Copyright (c) 2012-2014 Alan Antonuk.
- * All Rights Reserved.
- *
- * Portions created by Michael Steinert are Copyright (c) 2012-2014 Michael
- * Steinert. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include "amqp_openssl_bio.h"
-#include "amqp_openssl_hostname_validation.h"
-#include "amqp_private.h"
-#include "amqp_socket.h"
-#include "amqp_ssl_socket.h"
-#include "amqp_time.h"
-#include "threads.h"
-
-#include <ctype.h>
-#include <limits.h>
-#include <openssl/bio.h>
-#include <openssl/conf.h>
-#include <openssl/engine.h>
-#include <openssl/err.h>
-#include <openssl/ssl.h>
-#include <openssl/x509v3.h>
-#include <stdlib.h>
-#include <string.h>
-
-static int initialize_ssl_and_increment_connections(void);
-static int decrement_ssl_connections(void);
-
-static unsigned long ssl_threadid_callback(void);
-static void ssl_locking_callback(int mode, int n, const char *file, int line);
-static pthread_mutex_t *amqp_openssl_lockarray = NULL;
-
-static pthread_mutex_t openssl_init_mutex = PTHREAD_MUTEX_INITIALIZER;
-static amqp_boolean_t do_initialize_openssl = 1;
-static amqp_boolean_t openssl_initialized = 0;
-static amqp_boolean_t openssl_bio_initialized = 0;
-static int openssl_connections = 0;
-
-#define CHECK_SUCCESS(condition)                                            \
-  do {                                                                      \
-    int check_success_ret = (condition);                                    \
-    if (check_success_ret) {                                                \
-      amqp_abort("Check %s failed <%d>: %s", #condition, check_success_ret, \
-                 strerror(check_success_ret));                              \
-    }                                                                       \
-  } while (0)
-
-struct amqp_ssl_socket_t {
-  const struct amqp_socket_class_t *klass;
-  SSL_CTX *ctx;
-  int sockfd;
-  SSL *ssl;
-  amqp_boolean_t verify_peer;
-  amqp_boolean_t verify_hostname;
-  int internal_error;
-};
-
-static ssize_t amqp_ssl_socket_send(void *base, const void *buf, size_t len,
-                                    AMQP_UNUSED int flags) {
-  struct amqp_ssl_socket_t *self = (struct amqp_ssl_socket_t *)base;
-  int res;
-  if (-1 == self->sockfd) {
-    return AMQP_STATUS_SOCKET_CLOSED;
-  }
-
-  /* SSL_write takes an int for length of buffer, protect against len being
-   * larger than larger than what SSL_write can take */
-  if (len > INT_MAX) {
-    return AMQP_STATUS_INVALID_PARAMETER;
-  }
-
-  ERR_clear_error();
-  self->internal_error = 0;
-
-  /* This will only return on error, or once the whole buffer has been
-   * written to the SSL stream. See SSL_MODE_ENABLE_PARTIAL_WRITE */
-  res = SSL_write(self->ssl, buf, (int)len);
-  if (0 >= res) {
-    self->internal_error = SSL_get_error(self->ssl, res);
-    /* TODO: Close connection if it isn't already? */
-    /* TODO: Possibly be more intelligent in reporting WHAT went wrong */
-    switch (self->internal_error) {
-      case SSL_ERROR_WANT_READ:
-        res = AMQP_PRIVATE_STATUS_SOCKET_NEEDREAD;
-        break;
-      case SSL_ERROR_WANT_WRITE:
-        res = AMQP_PRIVATE_STATUS_SOCKET_NEEDWRITE;
-        break;
-      case SSL_ERROR_ZERO_RETURN:
-        res = AMQP_STATUS_CONNECTION_CLOSED;
-        break;
-      default:
-        res = AMQP_STATUS_SSL_ERROR;
-        break;
-    }
-  } else {
-    self->internal_error = 0;
-  }
-
-  return (ssize_t)res;
-}
-
-static ssize_t amqp_ssl_socket_recv(void *base, void *buf, size_t len,
-                                    AMQP_UNUSED int flags) {
-  struct amqp_ssl_socket_t *self = (struct amqp_ssl_socket_t *)base;
-  int received;
-  if (-1 == self->sockfd) {
-    return AMQP_STATUS_SOCKET_CLOSED;
-  }
-
-  /* SSL_read takes an int for length of buffer, protect against len being
-   * larger than larger than what SSL_read can take */
-  if (len > INT_MAX) {
-    return AMQP_STATUS_INVALID_PARAMETER;
-  }
-
-  ERR_clear_error();
-  self->internal_error = 0;
-
-  received = SSL_read(self->ssl, buf, (int)len);
-  if (0 >= received) {
-    self->internal_error = SSL_get_error(self->ssl, received);
-    switch (self->internal_error) {
-      case SSL_ERROR_WANT_READ:
-        received = AMQP_PRIVATE_STATUS_SOCKET_NEEDREAD;
-        break;
-      case SSL_ERROR_WANT_WRITE:
-        received = AMQP_PRIVATE_STATUS_SOCKET_NEEDWRITE;
-        break;
-      case SSL_ERROR_ZERO_RETURN:
-        received = AMQP_STATUS_CONNECTION_CLOSED;
-        break;
-      default:
-        received = AMQP_STATUS_SSL_ERROR;
-        break;
-    }
-  }
-
-  return (ssize_t)received;
-}
-
-static int amqp_ssl_socket_open(void *base, const char *host, int port,
-                                struct timeval *timeout) {
-  struct amqp_ssl_socket_t *self = (struct amqp_ssl_socket_t *)base;
-  long result;
-  int status;
-  amqp_time_t deadline;
-  X509 *cert;
-  BIO *bio;
-  if (-1 != self->sockfd) {
-    return AMQP_STATUS_SOCKET_INUSE;
-  }
-  ERR_clear_error();
-
-  self->ssl = SSL_new(self->ctx);
-  if (!self->ssl) {
-    self->internal_error = ERR_peek_error();
-    status = AMQP_STATUS_SSL_ERROR;
-    goto exit;
-  }
-
-  status = amqp_time_from_now(&deadline, timeout);
-  if (AMQP_STATUS_OK != status) {
-    return status;
-  }
-
-  self->sockfd = amqp_open_socket_inner(host, port, deadline);
-  if (0 > self->sockfd) {
-    status = self->sockfd;
-    self->internal_error = amqp_os_socket_error();
-    self->sockfd = -1;
-    goto error_out1;
-  }
-
-  bio = BIO_new(amqp_openssl_bio());
-  if (!bio) {
-    status = AMQP_STATUS_NO_MEMORY;
-    goto error_out2;
-  }
-
-  BIO_set_fd(bio, self->sockfd, BIO_NOCLOSE);
-  SSL_set_bio(self->ssl, bio, bio);
-
-  status = SSL_set_tlsext_host_name(self->ssl, host);
-  if (!status) {
-    self->internal_error = SSL_get_error(self->ssl, status);
-    status = AMQP_STATUS_SSL_ERROR;
-    goto error_out2;
-  }
-
-start_connect:
-  status = SSL_connect(self->ssl);
-  if (status != 1) {
-    self->internal_error = SSL_get_error(self->ssl, status);
-    switch (self->internal_error) {
-      case SSL_ERROR_WANT_READ:
-        status = amqp_poll(self->sockfd, AMQP_SF_POLLIN, deadline);
-        break;
-      case SSL_ERROR_WANT_WRITE:
-        status = amqp_poll(self->sockfd, AMQP_SF_POLLOUT, deadline);
-        break;
-      default:
-        status = AMQP_STATUS_SSL_CONNECTION_FAILED;
-    }
-    if (AMQP_STATUS_OK == status) {
-      goto start_connect;
-    }
-    goto error_out2;
-  }
-
-  cert = SSL_get_peer_certificate(self->ssl);
-
-  if (self->verify_peer) {
-    if (!cert) {
-      self->internal_error = 0;
-      status = AMQP_STATUS_SSL_PEER_VERIFY_FAILED;
-      goto error_out3;
-    }
-
-    result = SSL_get_verify_result(self->ssl);
-    if (X509_V_OK != result) {
-      self->internal_error = result;
-      status = AMQP_STATUS_SSL_PEER_VERIFY_FAILED;
-      goto error_out4;
-    }
-  }
-  if (self->verify_hostname) {
-    if (!cert) {
-      self->internal_error = 0;
-      status = AMQP_STATUS_SSL_HOSTNAME_VERIFY_FAILED;
-      goto error_out3;
-    }
-
-    if (AMQP_HVR_MATCH_FOUND != amqp_ssl_validate_hostname(host, cert)) {
-      self->internal_error = 0;
-      status = AMQP_STATUS_SSL_HOSTNAME_VERIFY_FAILED;
-      goto error_out4;
-    }
-  }
-
-  X509_free(cert);
-  self->internal_error = 0;
-  status = AMQP_STATUS_OK;
-
-exit:
-  return status;
-
-error_out4:
-  X509_free(cert);
-error_out3:
-  SSL_shutdown(self->ssl);
-error_out2:
-  amqp_os_socket_close(self->sockfd);
-  self->sockfd = -1;
-error_out1:
-  SSL_free(self->ssl);
-  self->ssl = NULL;
-  goto exit;
-}
-
-static int amqp_ssl_socket_close(void *base, amqp_socket_close_enum force) {
-  struct amqp_ssl_socket_t *self = (struct amqp_ssl_socket_t *)base;
-
-  if (-1 == self->sockfd) {
-    return AMQP_STATUS_SOCKET_CLOSED;
-  }
-
-  if (AMQP_SC_NONE == force) {
-    /* don't try too hard to shutdown the connection */
-    SSL_shutdown(self->ssl);
-  }
-
-  SSL_free(self->ssl);
-  self->ssl = NULL;
-
-  if (amqp_os_socket_close(self->sockfd)) {
-    return AMQP_STATUS_SOCKET_ERROR;
-  }
-  self->sockfd = -1;
-
-  return AMQP_STATUS_OK;
-}
-
-static int amqp_ssl_socket_get_sockfd(void *base) {
-  struct amqp_ssl_socket_t *self = (struct amqp_ssl_socket_t *)base;
-  return self->sockfd;
-}
-
-static void amqp_ssl_socket_delete(void *base) {
-  struct amqp_ssl_socket_t *self = (struct amqp_ssl_socket_t *)base;
-
-  if (self) {
-    amqp_ssl_socket_close(self, AMQP_SC_NONE);
-
-    SSL_CTX_free(self->ctx);
-    free(self);
-  }
-  decrement_ssl_connections();
-}
-
-static const struct amqp_socket_class_t amqp_ssl_socket_class = {
-    amqp_ssl_socket_send,       /* send */
-    amqp_ssl_socket_recv,       /* recv */
-    amqp_ssl_socket_open,       /* open */
-    amqp_ssl_socket_close,      /* close */
-    amqp_ssl_socket_get_sockfd, /* get_sockfd */
-    amqp_ssl_socket_delete      /* delete */
-};
-
-amqp_socket_t *amqp_ssl_socket_new(amqp_connection_state_t state) {
-  struct amqp_ssl_socket_t *self = calloc(1, sizeof(*self));
-  int status;
-  if (!self) {
-    return NULL;
-  }
-
-  self->sockfd = -1;
-  self->klass = &amqp_ssl_socket_class;
-  self->verify_peer = 1;
-  self->verify_hostname = 1;
-
-  status = initialize_ssl_and_increment_connections();
-  if (status) {
-    goto error;
-  }
-
-  self->ctx = SSL_CTX_new(SSLv23_client_method());
-  if (!self->ctx) {
-    goto error;
-  }
-  /* Disable SSLv2 and SSLv3 */
-  SSL_CTX_set_options(self->ctx, SSL_OP_NO_SSLv2 | SSL_OP_NO_SSLv3);
-
-  amqp_set_socket(state, (amqp_socket_t *)self);
-
-  return (amqp_socket_t *)self;
-error:
-  amqp_ssl_socket_delete((amqp_socket_t *)self);
-  return NULL;
-}
-
-int amqp_ssl_socket_set_cacert(amqp_socket_t *base, const char *cacert) {
-  int status;
-  struct amqp_ssl_socket_t *self;
-  if (base->klass != &amqp_ssl_socket_class) {
-    amqp_abort("<%p> is not of type amqp_ssl_socket_t", base);
-  }
-  self = (struct amqp_ssl_socket_t *)base;
-  status = SSL_CTX_load_verify_locations(self->ctx, cacert, NULL);
-  if (1 != status) {
-    return AMQP_STATUS_SSL_ERROR;
-  }
-  return AMQP_STATUS_OK;
-}
-
-int amqp_ssl_socket_set_key(amqp_socket_t *base, const char *cert,
-                            const char *key) {
-  int status;
-  struct amqp_ssl_socket_t *self;
-  if (base->klass != &amqp_ssl_socket_class) {
-    amqp_abort("<%p> is not of type amqp_ssl_socket_t", base);
-  }
-  self = (struct amqp_ssl_socket_t *)base;
-  status = SSL_CTX_use_certificate_chain_file(self->ctx, cert);
-  if (1 != status) {
-    return AMQP_STATUS_SSL_ERROR;
-  }
-  status = SSL_CTX_use_PrivateKey_file(self->ctx, key, SSL_FILETYPE_PEM);
-  if (1 != status) {
-    return AMQP_STATUS_SSL_ERROR;
-  }
-  return AMQP_STATUS_OK;
-}
-
-static int password_cb(AMQP_UNUSED char *buffer, AMQP_UNUSED int length,
-                       AMQP_UNUSED int rwflag, AMQP_UNUSED void *user_data) {
-  amqp_abort("rabbitmq-c does not support password protected keys");
-}
-
-int amqp_ssl_socket_set_key_buffer(amqp_socket_t *base, const char *cert,
-                                   const void *key, size_t n) {
-  int status = AMQP_STATUS_OK;
-  BIO *buf = NULL;
-  RSA *rsa = NULL;
-  struct amqp_ssl_socket_t *self;
-  if (base->klass != &amqp_ssl_socket_class) {
-    amqp_abort("<%p> is not of type amqp_ssl_socket_t", base);
-  }
-  if (n > INT_MAX) {
-    return AMQP_STATUS_INVALID_PARAMETER;
-  }
-  self = (struct amqp_ssl_socket_t *)base;
-  status = SSL_CTX_use_certificate_chain_file(self->ctx, cert);
-  if (1 != status) {
-    return AMQP_STATUS_SSL_ERROR;
-  }
-  buf = BIO_new_mem_buf((void *)key, (int)n);
-  if (!buf) {
-    goto error;
-  }
-  rsa = PEM_read_bio_RSAPrivateKey(buf, NULL, password_cb, NULL);
-  if (!rsa) {
-    goto error;
-  }
-  status = SSL_CTX_use_RSAPrivateKey(self->ctx, rsa);
-  if (1 != status) {
-    goto error;
-  }
-exit:
-  BIO_vfree(buf);
-  RSA_free(rsa);
-  return status;
-error:
-  status = AMQP_STATUS_SSL_ERROR;
-  goto exit;
-}
-
-int amqp_ssl_socket_set_cert(amqp_socket_t *base, const char *cert) {
-  int status;
-  struct amqp_ssl_socket_t *self;
-  if (base->klass != &amqp_ssl_socket_class) {
-    amqp_abort("<%p> is not of type amqp_ssl_socket_t", base);
-  }
-  self = (struct amqp_ssl_socket_t *)base;
-  status = SSL_CTX_use_certificate_chain_file(self->ctx, cert);
-  if (1 != status) {
-    return AMQP_STATUS_SSL_ERROR;
-  }
-  return AMQP_STATUS_OK;
-}
-
-void amqp_ssl_socket_set_verify(amqp_socket_t *base, amqp_boolean_t verify) {
-  amqp_ssl_socket_set_verify_peer(base, verify);
-  amqp_ssl_socket_set_verify_hostname(base, verify);
-}
-
-void amqp_ssl_socket_set_verify_peer(amqp_socket_t *base,
-                                     amqp_boolean_t verify) {
-  struct amqp_ssl_socket_t *self;
-  if (base->klass != &amqp_ssl_socket_class) {
-    amqp_abort("<%p> is not of type amqp_ssl_socket_t", base);
-  }
-  self = (struct amqp_ssl_socket_t *)base;
-  self->verify_peer = verify;
-}
-
-void amqp_ssl_socket_set_verify_hostname(amqp_socket_t *base,
-                                         amqp_boolean_t verify) {
-  struct amqp_ssl_socket_t *self;
-  if (base->klass != &amqp_ssl_socket_class) {
-    amqp_abort("<%p> is not of type amqp_ssl_socket_t", base);
-  }
-  self = (struct amqp_ssl_socket_t *)base;
-  self->verify_hostname = verify;
-}
-
-int amqp_ssl_socket_set_ssl_versions(amqp_socket_t *base,
-                                     amqp_tls_version_t min,
-                                     amqp_tls_version_t max) {
-  struct amqp_ssl_socket_t *self;
-  if (base->klass != &amqp_ssl_socket_class) {
-    amqp_abort("<%p> is not of type amqp_ssl_socket_t", base);
-  }
-  self = (struct amqp_ssl_socket_t *)base;
-
-  {
-    long clear_options;
-    long set_options = 0;
-#if defined(SSL_OP_NO_TLSv1_2)
-    amqp_tls_version_t max_supported = AMQP_TLSv1_2;
-    clear_options = SSL_OP_NO_TLSv1 | SSL_OP_NO_TLSv1_1 | SSL_OP_NO_TLSv1_2;
-#elif defined(SSL_OP_NO_TLSv1_1)
-    amqp_tls_version_t max_supported = AMQP_TLSv1_1;
-    clear_options = SSL_OP_NO_TLSv1 | SSL_OP_NO_TLSv1_1;
-#elif defined(SSL_OP_NO_TLSv1)
-    amqp_tls_version_t max_supported = AMQP_TLSv1;
-    clear_options = SSL_OP_NO_TLSv1;
-#else
-#error "Need a version of OpenSSL that can support TLSv1 or greater."
-#endif
-
-    if (AMQP_TLSvLATEST == max) {
-      max = max_supported;
-    }
-    if (AMQP_TLSvLATEST == min) {
-      min = max_supported;
-    }
-
-    if (min > max) {
-      return AMQP_STATUS_INVALID_PARAMETER;
-    }
-
-    if (max > max_supported || min > max_supported) {
-      return AMQP_STATUS_UNSUPPORTED;
-    }
-
-    if (min > AMQP_TLSv1) {
-      set_options |= SSL_OP_NO_TLSv1;
-    }
-#ifdef SSL_OP_NO_TLSv1_1
-    if (min > AMQP_TLSv1_1 || max < AMQP_TLSv1_1) {
-      set_options |= SSL_OP_NO_TLSv1_1;
-    }
-#endif
-#ifdef SSL_OP_NO_TLSv1_2
-    if (max < AMQP_TLSv1_2) {
-      set_options |= SSL_OP_NO_TLSv1_2;
-    }
-#endif
-    SSL_CTX_clear_options(self->ctx, clear_options);
-    SSL_CTX_set_options(self->ctx, set_options);
-  }
-
-  return AMQP_STATUS_OK;
-}
-
-void amqp_set_initialize_ssl_library(amqp_boolean_t do_initialize) {
-  CHECK_SUCCESS(pthread_mutex_lock(&openssl_init_mutex));
-
-  if (openssl_connections == 0 && !openssl_initialized) {
-    do_initialize_openssl = do_initialize;
-  }
-  CHECK_SUCCESS(pthread_mutex_unlock(&openssl_init_mutex));
-}
-
-static unsigned long ssl_threadid_callback(void) {
-  return (unsigned long)pthread_self();
-}
-
-static void ssl_locking_callback(int mode, int n, AMQP_UNUSED const char *file,
-                                 AMQP_UNUSED int line) {
-  if (mode & CRYPTO_LOCK) {
-    CHECK_SUCCESS(pthread_mutex_lock(&amqp_openssl_lockarray[n]));
-  } else {
-    CHECK_SUCCESS(pthread_mutex_unlock(&amqp_openssl_lockarray[n]));
-  }
-}
-
-static int setup_openssl(void) {
-  int status;
-
-  int i;
-  amqp_openssl_lockarray = calloc(CRYPTO_num_locks(), sizeof(pthread_mutex_t));
-  if (!amqp_openssl_lockarray) {
-    status = AMQP_STATUS_NO_MEMORY;
-    goto out;
-  }
-  for (i = 0; i < CRYPTO_num_locks(); i++) {
-    if (pthread_mutex_init(&amqp_openssl_lockarray[i], NULL)) {
-      int j;
-      for (j = 0; j < i; j++) {
-        pthread_mutex_destroy(&amqp_openssl_lockarray[j]);
-      }
-      free(amqp_openssl_lockarray);
-      status = AMQP_STATUS_SSL_ERROR;
-      goto out;
-    }
-  }
-  CRYPTO_set_id_callback(ssl_threadid_callback);
-  CRYPTO_set_locking_callback(ssl_locking_callback);
-
-#ifdef AMQP_OPENSSL_V110
-  if (CONF_modules_load_file(NULL, "rabbitmq-c", CONF_MFLAGS_DEFAULT_SECTION) <=
-      0) {
-    status = AMQP_STATUS_SSL_ERROR;
-    goto out;
-  }
-#else
-  OPENSSL_config(NULL);
-#endif
-  SSL_library_init();
-  SSL_load_error_strings();
-
-  status = AMQP_STATUS_OK;
-out:
-  return status;
-}
-
-int amqp_initialize_ssl_library(void) {
-  int status;
-  CHECK_SUCCESS(pthread_mutex_lock(&openssl_init_mutex));
-
-  if (!openssl_initialized) {
-    status = setup_openssl();
-    if (status) {
-      goto out;
-    }
-    openssl_initialized = 1;
-  }
-
-  status = AMQP_STATUS_OK;
-out:
-  CHECK_SUCCESS(pthread_mutex_unlock(&openssl_init_mutex));
-  return status;
-}
-
-static int initialize_ssl_and_increment_connections() {
-  int status;
-  CHECK_SUCCESS(pthread_mutex_lock(&openssl_init_mutex));
-
-  if (do_initialize_openssl && !openssl_initialized) {
-    status = setup_openssl();
-    if (status) {
-      goto exit;
-    }
-    openssl_initialized = 1;
-  }
-
-  if (!openssl_bio_initialized) {
-    status = amqp_openssl_bio_init();
-    if (status) {
-      goto exit;
-    }
-    openssl_bio_initialized = 1;
-  }
-
-  openssl_connections += 1;
-  status = AMQP_STATUS_OK;
-exit:
-  CHECK_SUCCESS(pthread_mutex_unlock(&openssl_init_mutex));
-  return status;
-}
-
-static int decrement_ssl_connections(void) {
-  CHECK_SUCCESS(pthread_mutex_lock(&openssl_init_mutex));
-
-  if (openssl_connections > 0) {
-    openssl_connections--;
-  }
-
-  CHECK_SUCCESS(pthread_mutex_unlock(&openssl_init_mutex));
-  return AMQP_STATUS_OK;
-}
-
-int amqp_uninitialize_ssl_library(void) {
-  int status;
-  CHECK_SUCCESS(pthread_mutex_lock(&openssl_init_mutex));
-
-  if (openssl_connections > 0) {
-    status = AMQP_STATUS_SOCKET_INUSE;
-    goto out;
-  }
-
-  amqp_openssl_bio_destroy();
-  openssl_bio_initialized = 0;
-
-#ifndef AMQP_OPENSSL_V110
-  ERR_remove_state(0);
-#endif
-
-#ifndef LIBRESSL_VERSION_NUMBER
-  FIPS_mode_set(0);
-#endif
-
-  CRYPTO_set_locking_callback(NULL);
-  CRYPTO_set_id_callback(NULL);
-  {
-    int i;
-    for (i = 0; i < CRYPTO_num_locks(); i++) {
-      pthread_mutex_destroy(&amqp_openssl_lockarray[i]);
-    }
-    free(amqp_openssl_lockarray);
-  }
-
-  ENGINE_cleanup();
-  CONF_modules_free();
-  EVP_cleanup();
-  CRYPTO_cleanup_all_ex_data();
-  ERR_free_strings();
-#if (OPENSSL_VERSION_NUMBER >= 0x10002003L) && !defined(LIBRESSL_VERSION_NUMBER)
-  SSL_COMP_free_compression_methods();
-#endif
-
-  openssl_initialized = 0;
-
-  status = AMQP_STATUS_OK;
-out:
-  CHECK_SUCCESS(pthread_mutex_unlock(&openssl_init_mutex));
-  return status;
-}

ext/librabbitmq/librabbitmq/amqp_openssl_bio.c

@@ -1,193 +0,0 @@
-/*
- * Portions created by Alan Antonuk are Copyright (c) 2017 Alan Antonuk.
- * All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-
-#include "amqp_openssl_bio.h"
-#include "amqp_socket.h"
-
-#include <assert.h>
-#include <errno.h>
-#if ((defined(_WIN32)) || (defined(__MINGW32__)) || (defined(__MINGW64__)))
-#ifndef WIN32_LEAN_AND_MEAN
-#define WIN32_LEAN_AND_MEAN
-#endif
-#include <winsock2.h>
-#else
-#include <sys/socket.h>
-#include <sys/types.h>
-#endif
-
-#ifdef MSG_NOSIGNAL
-#define AMQP_USE_AMQP_BIO
-#endif
-
-static int amqp_ssl_bio_initialized = 0;
-
-#ifdef AMQP_USE_AMQP_BIO
-
-static BIO_METHOD *amqp_bio_method;
-
-static int amqp_openssl_bio_should_retry(int res) {
-  if (res == -1) {
-    int err = amqp_os_socket_error();
-    if (
-#ifdef EWOULDBLOCK
-        err == EWOULDBLOCK ||
-#endif
-#ifdef WSAEWOULDBLOCK
-        err == WSAEWOULDBLOCK ||
-#endif
-#ifdef ENOTCONN
-        err == ENOTCONN ||
-#endif
-#ifdef EINTR
-        err == EINTR ||
-#endif
-#ifdef EAGAIN
-        err == EAGAIN ||
-#endif
-#ifdef EPROTO
-        err == EPROTO ||
-#endif
-#ifdef EINPROGRESS
-        err == EINPROGRESS ||
-#endif
-#ifdef EALREADY
-        err == EALREADY ||
-#endif
-        0) {
-      return 1;
-    }
-  }
-  return 0;
-}
-
-static int amqp_openssl_bio_write(BIO *b, const char *in, int inl) {
-  int flags = 0;
-  int fd;
-  int res;
-
-#ifdef MSG_NOSIGNAL
-  flags |= MSG_NOSIGNAL;
-#endif
-
-  BIO_get_fd(b, &fd);
-  res = send(fd, in, inl, flags);
-
-  BIO_clear_retry_flags(b);
-  if (res <= 0 && amqp_openssl_bio_should_retry(res)) {
-    BIO_set_retry_write(b);
-  }
-
-  return res;
-}
-
-static int amqp_openssl_bio_read(BIO *b, char *out, int outl) {
-  int flags = 0;
-  int fd;
-  int res;
-
-#ifdef MSG_NOSIGNAL
-  flags |= MSG_NOSIGNAL;
-#endif
-
-  BIO_get_fd(b, &fd);
-  res = recv(fd, out, outl, flags);
-
-  BIO_clear_retry_flags(b);
-  if (res <= 0 && amqp_openssl_bio_should_retry(res)) {
-    BIO_set_retry_read(b);
-  }
-
-  return res;
-}
-
-#ifndef AMQP_OPENSSL_V110
-static int BIO_meth_set_write(BIO_METHOD *biom,
-                              int (*wfn)(BIO *, const char *, int)) {
-  biom->bwrite = wfn;
-  return 0;
-}
-
-static int BIO_meth_set_read(BIO_METHOD *biom, int (*rfn)(BIO *, char *, int)) {
-  biom->bread = rfn;
-  return 0;
-}
-#endif /* AQP_OPENSSL_V110 */
-#endif /* AMQP_USE_AMQP_BIO */
-
-int amqp_openssl_bio_init(void) {
-  assert(!amqp_ssl_bio_initialized);
-#ifdef AMQP_USE_AMQP_BIO
-#ifdef AMQP_OPENSSL_V110
-  if (!(amqp_bio_method = BIO_meth_new(BIO_TYPE_SOCKET, "amqp_bio_method"))) {
-    return AMQP_STATUS_NO_MEMORY;
-  }
-
-  // casting away const is necessary until
-  // https://github.com/openssl/openssl/pull/2181/, which is targeted for
-  // openssl 1.1.1
-  BIO_METHOD *meth = (BIO_METHOD *)BIO_s_socket();
-  BIO_meth_set_create(amqp_bio_method, BIO_meth_get_create(meth));
-  BIO_meth_set_destroy(amqp_bio_method, BIO_meth_get_destroy(meth));
-  BIO_meth_set_ctrl(amqp_bio_method, BIO_meth_get_ctrl(meth));
-  BIO_meth_set_callback_ctrl(amqp_bio_method, BIO_meth_get_callback_ctrl(meth));
-  BIO_meth_set_read(amqp_bio_method, BIO_meth_get_read(meth));
-  BIO_meth_set_write(amqp_bio_method, BIO_meth_get_write(meth));
-  BIO_meth_set_gets(amqp_bio_method, BIO_meth_get_gets(meth));
-  BIO_meth_set_puts(amqp_bio_method, BIO_meth_get_puts(meth));
-#else
-  if (!(amqp_bio_method = OPENSSL_malloc(sizeof(BIO_METHOD)))) {
-    return AMQP_STATUS_NO_MEMORY;
-  }
-
-  memcpy(amqp_bio_method, BIO_s_socket(), sizeof(BIO_METHOD));
-#endif
-  BIO_meth_set_write(amqp_bio_method, amqp_openssl_bio_write);
-  BIO_meth_set_read(amqp_bio_method, amqp_openssl_bio_read);
-#endif
-
-  amqp_ssl_bio_initialized = 1;
-  return AMQP_STATUS_OK;
-}
-
-void amqp_openssl_bio_destroy(void) {
-  assert(amqp_ssl_bio_initialized);
-#ifdef AMQP_USE_AMQP_BIO
-#ifdef AMQP_OPENSSL_V110
-  BIO_meth_free(amqp_bio_method);
-#else
-  OPENSSL_free(amqp_bio_method);
-#endif
-  amqp_bio_method = NULL;
-#endif
-  amqp_ssl_bio_initialized = 0;
-}
-
-BIO_METHOD_PTR amqp_openssl_bio(void) {
-  assert(amqp_ssl_bio_initialized);
-#ifdef AMQP_USE_AMQP_BIO
-  return amqp_bio_method;
-#else
-  return BIO_s_socket();
-#endif
-}

ext/librabbitmq/librabbitmq/amqp_openssl_bio.h

@@ -1,44 +0,0 @@
-/*
- * Portions created by Alan Antonuk are Copyright (c) 2017 Alan Antonuk.
- * All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-#ifndef AMQP_OPENSSL_BIO
-#define AMQP_OPENSSL_BIO
-
-#include <openssl/bio.h>
-
-int amqp_openssl_bio_init(void);
-
-void amqp_openssl_bio_destroy(void);
-
-#if (OPENSSL_VERSION_NUMBER >= 0x10100000L)
-#define AMQP_OPENSSL_V110
-#endif
-
-#ifdef AMQP_OPENSSL_V110
-typedef const BIO_METHOD *BIO_METHOD_PTR;
-#else
-typedef BIO_METHOD *BIO_METHOD_PTR;
-#endif
-
-BIO_METHOD_PTR amqp_openssl_bio(void);
-
-#endif /* ifndef AMQP_OPENSSL_BIO */

ext/librabbitmq/librabbitmq/amqp_openssl_hostname_validation.c

@@ -1,179 +0,0 @@
-/*
- * Copyright (C) 2012, iSEC Partners.
- * Copyright (C) 2015 Alan Antonuk.
- *
- * All rights reserved.
- *
- * 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", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS.
- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
- * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
- * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
- * USE OR OTHER DEALINGS IN THE SOFTWARE.
- *
- * Except as contained in this notice, the name of a copyright holder shall
- * not be used in advertising or otherwise to promote the sale, use or other
- * dealings in this Software without prior written authorization of the
- * copyright holder.
- */
-
-/* Originally from:
- * https://github.com/iSECPartners/ssl-conservatory
- * https://wiki.openssl.org/index.php/Hostname_validation
- */
-
-#include <openssl/ssl.h>
-#include <openssl/x509v3.h>
-
-#include "amqp_hostcheck.h"
-#include "amqp_openssl_bio.h"
-#include "amqp_openssl_hostname_validation.h"
-
-#include <string.h>
-
-#define HOSTNAME_MAX_SIZE 255
-
-/**
- * Tries to find a match for hostname in the certificate's Common Name field.
- *
- * Returns AMQP_HVR_MATCH_FOUND if a match was found.
- * Returns AMQP_HVR_MATCH_NOT_FOUND if no matches were found.
- * Returns AMQP_HVR_MALFORMED_CERTIFICATE if the Common Name had a NUL character
- * embedded in it.
- * Returns AMQP_HVR_ERROR if the Common Name could not be extracted.
- */
-static amqp_hostname_validation_result amqp_matches_common_name(
-    const char *hostname, const X509 *server_cert) {
-  int common_name_loc = -1;
-  X509_NAME_ENTRY *common_name_entry = NULL;
-  ASN1_STRING *common_name_asn1 = NULL;
-  const char *common_name_str = NULL;
-
-  // Find the position of the CN field in the Subject field of the certificate
-  common_name_loc = X509_NAME_get_index_by_NID(
-      X509_get_subject_name((X509 *)server_cert), NID_commonName, -1);
-  if (common_name_loc < 0) {
-    return AMQP_HVR_ERROR;
-  }
-
-  // Extract the CN field
-  common_name_entry = X509_NAME_get_entry(
-      X509_get_subject_name((X509 *)server_cert), common_name_loc);
-  if (common_name_entry == NULL) {
-    return AMQP_HVR_ERROR;
-  }
-
-  // Convert the CN field to a C string
-  common_name_asn1 = X509_NAME_ENTRY_get_data(common_name_entry);
-  if (common_name_asn1 == NULL) {
-    return AMQP_HVR_ERROR;
-  }
-
-#ifdef AMQP_OPENSSL_V110
-  common_name_str = (const char *)ASN1_STRING_get0_data(common_name_asn1);
-#else
-  common_name_str = (char *)ASN1_STRING_data(common_name_asn1);
-#endif
-
-  // Make sure there isn't an embedded NUL character in the CN
-  if ((size_t)ASN1_STRING_length(common_name_asn1) != strlen(common_name_str)) {
-    return AMQP_HVR_MALFORMED_CERTIFICATE;
-  }
-
-  // Compare expected hostname with the CN
-  if (amqp_hostcheck(common_name_str, hostname) == AMQP_HCR_MATCH) {
-    return AMQP_HVR_MATCH_FOUND;
-  } else {
-    return AMQP_HVR_MATCH_NOT_FOUND;
-  }
-}
-
-/**
- * Tries to find a match for hostname in the certificate's Subject Alternative
- * Name extension.
- *
- * Returns AMQP_HVR_MATCH_FOUND if a match was found.
- * Returns AMQP_HVR_MATCH_NOT_FOUND if no matches were found.
- * Returns AMQP_HVR_MALFORMED_CERTIFICATE if any of the hostnames had a NUL
- * character embedded in it.
- * Returns AMQP_HVR_NO_SAN_PRESENT if the SAN extension was not present in the
- * certificate.
- */
-static amqp_hostname_validation_result amqp_matches_subject_alternative_name(
-    const char *hostname, const X509 *server_cert) {
-  amqp_hostname_validation_result result = AMQP_HVR_MATCH_NOT_FOUND;
-  int i;
-  int san_names_nb = -1;
-  STACK_OF(GENERAL_NAME) *san_names = NULL;
-
-  // Try to extract the names within the SAN extension from the certificate
-  san_names =
-      X509_get_ext_d2i((X509 *)server_cert, NID_subject_alt_name, NULL, NULL);
-  if (san_names == NULL) {
-    return AMQP_HVR_NO_SAN_PRESENT;
-  }
-  san_names_nb = sk_GENERAL_NAME_num(san_names);
-
-  // Check each name within the extension
-  for (i = 0; i < san_names_nb; i++) {
-    const GENERAL_NAME *current_name = sk_GENERAL_NAME_value(san_names, i);
-
-    if (current_name->type == GEN_DNS) {
-      // Current name is a DNS name, let's check it
-      const char *dns_name = (const char *)
-#ifdef AMQP_OPENSSL_V110
-          ASN1_STRING_get0_data(current_name->d.dNSName);
-#else
-          ASN1_STRING_data(current_name->d.dNSName);
-#endif
-
-      // Make sure there isn't an embedded NUL character in the DNS name
-      if ((size_t)ASN1_STRING_length(current_name->d.dNSName) !=
-          strlen(dns_name)) {
-        result = AMQP_HVR_MALFORMED_CERTIFICATE;
-        break;
-      } else {  // Compare expected hostname with the DNS name
-        if (amqp_hostcheck(dns_name, hostname) == AMQP_HCR_MATCH) {
-          result = AMQP_HVR_MATCH_FOUND;
-          break;
-        }
-      }
-    }
-  }
-  sk_GENERAL_NAME_pop_free(san_names, GENERAL_NAME_free);
-
-  return result;
-}
-
-/**
- * Validates the server's identity by looking for the expected hostname in the
- * server's certificate. As described in RFC 6125, it first tries to find a
- * match in the Subject Alternative Name extension. If the extension is not
- * present in the certificate, it checks the Common Name instead.
- *
- * Returns AMQP_HVR_MATCH_FOUND if a match was found.
- * Returns AMQP_HVR_MATCH_NOT_FOUND if no matches were found.
- * Returns AMQP_HVR_MALFORMED_CERTIFICATE if any of the hostnames had a NUL
- * character embedded in it.
- * Returns AMQP_HVR_ERROR if there was an error.
- */
-amqp_hostname_validation_result amqp_ssl_validate_hostname(
-    const char *hostname, const X509 *server_cert) {
-  amqp_hostname_validation_result result;
-
-  if ((hostname == NULL) || (server_cert == NULL)) return AMQP_HVR_ERROR;
-
-  // First try the Subject Alternative Names extension
-  result = amqp_matches_subject_alternative_name(hostname, server_cert);
-  if (result == AMQP_HVR_NO_SAN_PRESENT) {
-    // Extension was not found: try the Common Name
-    result = amqp_matches_common_name(hostname, server_cert);
-  }
-
-  return result;
-}

ext/librabbitmq/librabbitmq/amqp_openssl_hostname_validation.h

@@ -1,58 +0,0 @@
-#ifndef librabbitmq_amqp_openssl_hostname_validation_h
-#define librabbitmq_amqp_openssl_hostname_validation_h
-
-/*
- * Copyright (C) 2012, iSEC Partners.
- * Copyright (C) 2015 Alan Antonuk.
- *
- * All rights reserved.
- *
- * 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", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS.
- * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
- * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
- * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
- * USE OR OTHER DEALINGS IN THE SOFTWARE.
- *
- * Except as contained in this notice, the name of a copyright holder shall
- * not be used in advertising or otherwise to promote the sale, use or other
- * dealings in this Software without prior written authorization of the
- * copyright holder.
- */
-
-/* Originally from:
- * https://github.com/iSECPartners/ssl-conservatory
- * https://wiki.openssl.org/index.php/Hostname_validation
- */
-
-#include <openssl/x509v3.h>
-
-typedef enum {
-  AMQP_HVR_MATCH_FOUND,
-  AMQP_HVR_MATCH_NOT_FOUND,
-  AMQP_HVR_NO_SAN_PRESENT,
-  AMQP_HVR_MALFORMED_CERTIFICATE,
-  AMQP_HVR_ERROR
-} amqp_hostname_validation_result;
-
-/**
-* Validates the server's identity by looking for the expected hostname in the
-* server's certificate. As described in RFC 6125, it first tries to find a match
-* in the Subject Alternative Name extension. If the extension is not present in
-* the certificate, it checks the Common Name instead.
-*
-* Returns AMQP_HVR_MATCH_FOUND if a match was found.
-* Returns AMQP_HVR_MATCH_NOT_FOUND if no matches were found.
-* Returns AMQP_HVR_MALFORMED_CERTIFICATE if any of the hostnames had a NUL
-* character embedded in it.
-* Returns AMQP_HVR_ERROR if there was an error.
-*/
-amqp_hostname_validation_result amqp_ssl_validate_hostname(
-    const char *hostname, const X509 *server_cert);
-
-#endif

ext/librabbitmq/librabbitmq/amqp_private.h

@@ -1,374 +0,0 @@
-#ifndef librabbitmq_amqp_private_h
-#define librabbitmq_amqp_private_h
-
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2014
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#define AMQ_COPYRIGHT                                       \
-  "Copyright (c) 2007-2014 VMWare Inc, Tony Garnock-Jones," \
-  " and Alan Antonuk."
-
-#include "amqp.h"
-#include "amqp_framing.h"
-#include <string.h>
-
-#if ((defined(_WIN32)) || (defined(__MINGW32__)) || (defined(__MINGW64__)))
-#ifndef WINVER
-/* WINVER 0x0502 is WinXP SP2+, Windows Server 2003 SP1+
- * See:
- * http://msdn.microsoft.com/en-us/library/windows/desktop/aa383745(v=vs.85).aspx#macros_for_conditional_declarations
- */
-#define WINVER 0x0502
-#endif
-#ifndef WIN32_LEAN_AND_MEAN
-#define WIN32_LEAN_AND_MEAN
-#endif
-#include <winsock2.h>
-#else
-#include <arpa/inet.h>
-#include <sys/uio.h>
-#endif
-
-/* GCC attributes */
-#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ > 4)
-#define AMQP_NORETURN __attribute__((__noreturn__))
-#define AMQP_UNUSED __attribute__((__unused__))
-#elif defined(_MSC_VER)
-#define AMQP_NORETURN __declspec(noreturn)
-#define AMQP_UNUSED
-#else
-#define AMQP_NORETURN
-#define AMQP_UNUSED
-#endif
-
-#if __GNUC__ >= 4
-#define AMQP_PRIVATE __attribute__((visibility("hidden")))
-#else
-#define AMQP_PRIVATE
-#endif
-
-char *amqp_os_error_string(int err);
-
-#ifdef WITH_SSL
-char *amqp_ssl_error_string(int err);
-#endif
-
-#include "amqp_socket.h"
-#include "amqp_time.h"
-
-/*
- * Connection states: XXX FIX THIS
- *
- * - CONNECTION_STATE_INITIAL: The initial state, when we cannot be
- *   sure if the next thing we will get is the first AMQP frame, or a
- *   protocol header from the server.
- *
- * - CONNECTION_STATE_IDLE: The normal state between
- *   frames. Connections may only be reconfigured, and the
- *   connection's pools recycled, when in this state. Whenever we're
- *   in this state, the inbound_buffer's bytes pointer must be NULL;
- *   any other state, and it must point to a block of memory allocated
- *   from the frame_pool.
- *
- * - CONNECTION_STATE_HEADER: Some bytes of an incoming frame have
- *   been seen, but not a complete frame header's worth.
- *
- * - CONNECTION_STATE_BODY: A complete frame header has been seen, but
- *   the frame is not yet complete. When it is completed, it will be
- *   returned, and the connection will return to IDLE state.
- *
- */
-typedef enum amqp_connection_state_enum_ {
-  CONNECTION_STATE_IDLE = 0,
-  CONNECTION_STATE_INITIAL,
-  CONNECTION_STATE_HEADER,
-  CONNECTION_STATE_BODY
-} amqp_connection_state_enum;
-
-typedef enum amqp_status_private_enum_ {
-  /* 0x00xx -> AMQP_STATUS_*/
-  /* 0x01xx -> AMQP_STATUS_TCP_* */
-  /* 0x02xx -> AMQP_STATUS_SSL_* */
-  AMQP_PRIVATE_STATUS_SOCKET_NEEDREAD = -0x1301,
-  AMQP_PRIVATE_STATUS_SOCKET_NEEDWRITE = -0x1302
-} amqp_status_private_enum;
-
-/* 7 bytes up front, then payload, then 1 byte footer */
-#define HEADER_SIZE 7
-#define FOOTER_SIZE 1
-
-#define AMQP_PSEUDOFRAME_PROTOCOL_HEADER 'A'
-
-typedef struct amqp_link_t_ {
-  struct amqp_link_t_ *next;
-  void *data;
-} amqp_link_t;
-
-#define POOL_TABLE_SIZE 16
-
-typedef struct amqp_pool_table_entry_t_ {
-  struct amqp_pool_table_entry_t_ *next;
-  amqp_pool_t pool;
-  amqp_channel_t channel;
-} amqp_pool_table_entry_t;
-
-struct amqp_connection_state_t_ {
-  amqp_pool_table_entry_t *pool_table[POOL_TABLE_SIZE];
-
-  amqp_connection_state_enum state;
-
-  int channel_max;
-  int frame_max;
-
-  /* Heartbeat interval in seconds. If this is <= 0, then heartbeats are not
-   * enabled, and next_recv_heartbeat and next_send_heartbeat are set to
-   * infinite */
-  int heartbeat;
-  amqp_time_t next_recv_heartbeat;
-  amqp_time_t next_send_heartbeat;
-
-  /* buffer for holding frame headers.  Allows us to delay allocating
-   * the raw frame buffer until the type, channel, and size are all known
-   */
-  char header_buffer[HEADER_SIZE + 1];
-  amqp_bytes_t inbound_buffer;
-
-  size_t inbound_offset;
-  size_t target_size;
-
-  amqp_bytes_t outbound_buffer;
-
-  amqp_socket_t *socket;
-
-  amqp_bytes_t sock_inbound_buffer;
-  size_t sock_inbound_offset;
-  size_t sock_inbound_limit;
-
-  amqp_link_t *first_queued_frame;
-  amqp_link_t *last_queued_frame;
-
-  amqp_rpc_reply_t most_recent_api_result;
-
-  amqp_table_t server_properties;
-  amqp_table_t client_properties;
-  amqp_pool_t properties_pool;
-
-  struct timeval *handshake_timeout;
-  struct timeval internal_handshake_timeout;
-  struct timeval *rpc_timeout;
-  struct timeval internal_rpc_timeout;
-};
-
-amqp_pool_t *amqp_get_or_create_channel_pool(amqp_connection_state_t connection,
-                                             amqp_channel_t channel);
-amqp_pool_t *amqp_get_channel_pool(amqp_connection_state_t state,
-                                   amqp_channel_t channel);
-
-static inline int amqp_heartbeat_send(amqp_connection_state_t state) {
-  return state->heartbeat;
-}
-
-static inline int amqp_heartbeat_recv(amqp_connection_state_t state) {
-  return 2 * state->heartbeat;
-}
-
-int amqp_try_recv(amqp_connection_state_t state);
-
-static inline void *amqp_offset(void *data, size_t offset) {
-  return (char *)data + offset;
-}
-
-/* This macro defines the encoding and decoding functions associated with a
-   simple type. */
-
-#define DECLARE_CODEC_BASE_TYPE(bits)                                        \
-                                                                             \
-  static inline int amqp_encode_##bits(amqp_bytes_t encoded, size_t *offset, \
-                                       uint##bits##_t input) {               \
-    size_t o = *offset;                                                      \
-    if ((*offset = o + bits / 8) <= encoded.len) {                           \
-      amqp_e##bits(input, amqp_offset(encoded.bytes, o));                    \
-      return 1;                                                              \
-    }                                                                        \
-    return 0;                                                                \
-  }                                                                          \
-                                                                             \
-  static inline int amqp_decode_##bits(amqp_bytes_t encoded, size_t *offset, \
-                                       uint##bits##_t *output) {             \
-    size_t o = *offset;                                                      \
-    if ((*offset = o + bits / 8) <= encoded.len) {                           \
-      *output = amqp_d##bits(amqp_offset(encoded.bytes, o));                 \
-      return 1;                                                              \
-    }                                                                        \
-    return 0;                                                                \
-  }
-
-static inline int is_bigendian(void) {
-  union {
-    uint32_t i;
-    char c[4];
-  } bint = {0x01020304};
-  return bint.c[0] == 1;
-}
-
-static inline void amqp_e8(uint8_t val, void *data) {
-  memcpy(data, &val, sizeof(val));
-}
-
-static inline uint8_t amqp_d8(void *data) {
-  uint8_t val;
-  memcpy(&val, data, sizeof(val));
-  return val;
-}
-
-static inline void amqp_e16(uint16_t val, void *data) {
-  if (!is_bigendian()) {
-    val = ((val & 0xFF00u) >> 8u) | ((val & 0x00FFu) << 8u);
-  }
-  memcpy(data, &val, sizeof(val));
-}
-
-static inline uint16_t amqp_d16(void *data) {
-  uint16_t val;
-  memcpy(&val, data, sizeof(val));
-  if (!is_bigendian()) {
-    val = ((val & 0xFF00u) >> 8u) | ((val & 0x00FFu) << 8u);
-  }
-  return val;
-}
-
-static inline void amqp_e32(uint32_t val, void *data) {
-  if (!is_bigendian()) {
-    val = ((val & 0xFF000000u) >> 24u) | ((val & 0x00FF0000u) >> 8u) |
-          ((val & 0x0000FF00u) << 8u) | ((val & 0x000000FFu) << 24u);
-  }
-  memcpy(data, &val, sizeof(val));
-}
-
-static inline uint32_t amqp_d32(void *data) {
-  uint32_t val;
-  memcpy(&val, data, sizeof(val));
-  if (!is_bigendian()) {
-    val = ((val & 0xFF000000u) >> 24u) | ((val & 0x00FF0000u) >> 8u) |
-          ((val & 0x0000FF00u) << 8u) | ((val & 0x000000FFu) << 24u);
-  }
-  return val;
-}
-
-static inline void amqp_e64(uint64_t val, void *data) {
-  if (!is_bigendian()) {
-    val = ((val & 0xFF00000000000000u) >> 56u) |
-          ((val & 0x00FF000000000000u) >> 40u) |
-          ((val & 0x0000FF0000000000u) >> 24u) |
-          ((val & 0x000000FF00000000u) >> 8u) |
-          ((val & 0x00000000FF000000u) << 8u) |
-          ((val & 0x0000000000FF0000u) << 24u) |
-          ((val & 0x000000000000FF00u) << 40u) |
-          ((val & 0x00000000000000FFu) << 56u);
-  }
-  memcpy(data, &val, sizeof(val));
-}
-
-static inline uint64_t amqp_d64(void *data) {
-  uint64_t val;
-  memcpy(&val, data, sizeof(val));
-  if (!is_bigendian()) {
-    val = ((val & 0xFF00000000000000u) >> 56u) |
-          ((val & 0x00FF000000000000u) >> 40u) |
-          ((val & 0x0000FF0000000000u) >> 24u) |
-          ((val & 0x000000FF00000000u) >> 8u) |
-          ((val & 0x00000000FF000000u) << 8u) |
-          ((val & 0x0000000000FF0000u) << 24u) |
-          ((val & 0x000000000000FF00u) << 40u) |
-          ((val & 0x00000000000000FFu) << 56u);
-  }
-  return val;
-}
-
-DECLARE_CODEC_BASE_TYPE(8)
-DECLARE_CODEC_BASE_TYPE(16)
-DECLARE_CODEC_BASE_TYPE(32)
-DECLARE_CODEC_BASE_TYPE(64)
-
-static inline int amqp_encode_bytes(amqp_bytes_t encoded, size_t *offset,
-                                    amqp_bytes_t input) {
-  size_t o = *offset;
-  /* The memcpy below has undefined behavior if the input is NULL. It is valid
-   * for a 0-length amqp_bytes_t to have .bytes == NULL. Thus we should check
-   * before encoding.
-   */
-  if (input.len == 0) {
-    return 1;
-  }
-  if ((*offset = o + input.len) <= encoded.len) {
-    memcpy(amqp_offset(encoded.bytes, o), input.bytes, input.len);
-    return 1;
-  } else {
-    return 0;
-  }
-}
-
-static inline int amqp_decode_bytes(amqp_bytes_t encoded, size_t *offset,
-                                    amqp_bytes_t *output, size_t len) {
-  size_t o = *offset;
-  if ((*offset = o + len) <= encoded.len) {
-    output->bytes = amqp_offset(encoded.bytes, o);
-    output->len = len;
-    return 1;
-  } else {
-    return 0;
-  }
-}
-
-AMQP_NORETURN
-void amqp_abort(const char *fmt, ...);
-
-int amqp_bytes_equal(amqp_bytes_t r, amqp_bytes_t l);
-
-static inline amqp_rpc_reply_t amqp_rpc_reply_error(amqp_status_enum status) {
-  amqp_rpc_reply_t reply;
-  reply.reply_type = AMQP_RESPONSE_LIBRARY_EXCEPTION;
-  reply.library_error = status;
-  return reply;
-}
-
-int amqp_send_frame_inner(amqp_connection_state_t state,
-                          const amqp_frame_t *frame, int flags,
-                          amqp_time_t deadline);
-#endif

ext/librabbitmq/librabbitmq/amqp_socket.c

@@ -1,1492 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2014
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#ifdef _MSC_VER
-#define _CRT_SECURE_NO_WARNINGS
-#endif
-
-#include "amqp_private.h"
-#include "amqp_socket.h"
-#include "amqp_table.h"
-#include "amqp_time.h"
-
-#include <assert.h>
-#include <limits.h>
-#include <stdarg.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <errno.h>
-
-#if ((defined(_WIN32)) || (defined(__MINGW32__)) || (defined(__MINGW64__)))
-#ifndef WIN32_LEAN_AND_MEAN
-#define WIN32_LEAN_AND_MEAN
-#endif
-#include <winsock2.h>
-#include <ws2tcpip.h>
-#else
-#include <sys/types.h>
-/* On older BSD types.h must come before net includes */
-#include <netinet/in.h>
-#include <netinet/tcp.h>
-#ifdef HAVE_SELECT
-#include <sys/select.h>
-#endif
-#include <fcntl.h>
-#include <netdb.h>
-#include <sys/socket.h>
-#include <sys/uio.h>
-#ifdef HAVE_POLL
-#include <poll.h>
-#endif
-#include <unistd.h>
-#endif
-
-static int amqp_id_in_reply_list(amqp_method_number_t expected,
-                                 amqp_method_number_t *list);
-
-static int amqp_os_socket_init(void) {
-#ifdef _WIN32
-  static int called_wsastartup = 0;
-  if (!called_wsastartup) {
-    WSADATA data;
-    int res = WSAStartup(0x0202, &data);
-    if (res) {
-      return AMQP_STATUS_TCP_SOCKETLIB_INIT_ERROR;
-    }
-
-    called_wsastartup = 1;
-  }
-  return AMQP_STATUS_OK;
-
-#else
-  return AMQP_STATUS_OK;
-#endif
-}
-
-int amqp_os_socket_error(void) {
-#ifdef _WIN32
-  return WSAGetLastError();
-#else
-  return errno;
-#endif
-}
-
-int amqp_os_socket_close(int sockfd) {
-#ifdef _WIN32
-  return closesocket(sockfd);
-#else
-  return close(sockfd);
-#endif
-}
-
-ssize_t amqp_socket_send(amqp_socket_t *self, const void *buf, size_t len,
-                         int flags) {
-  assert(self);
-  assert(self->klass->send);
-  return self->klass->send(self, buf, len, flags);
-}
-
-ssize_t amqp_socket_recv(amqp_socket_t *self, void *buf, size_t len,
-                         int flags) {
-  assert(self);
-  assert(self->klass->recv);
-  return self->klass->recv(self, buf, len, flags);
-}
-
-int amqp_socket_open(amqp_socket_t *self, const char *host, int port) {
-  assert(self);
-  assert(self->klass->open);
-  return self->klass->open(self, host, port, NULL);
-}
-
-int amqp_socket_open_noblock(amqp_socket_t *self, const char *host, int port,
-                             struct timeval *timeout) {
-  assert(self);
-  assert(self->klass->open);
-  return self->klass->open(self, host, port, timeout);
-}
-
-int amqp_socket_close(amqp_socket_t *self, amqp_socket_close_enum force) {
-  assert(self);
-  assert(self->klass->close);
-  return self->klass->close(self, force);
-}
-
-void amqp_socket_delete(amqp_socket_t *self) {
-  if (self) {
-    assert(self->klass->delete);
-    self->klass->delete (self);
-  }
-}
-
-int amqp_socket_get_sockfd(amqp_socket_t *self) {
-  assert(self);
-  assert(self->klass->get_sockfd);
-  return self->klass->get_sockfd(self);
-}
-
-int amqp_poll(int fd, int event, amqp_time_t deadline) {
-#ifdef HAVE_POLL
-  struct pollfd pfd;
-  int res;
-  int timeout_ms;
-
-  /* Function should only ever be called with one of these two */
-  assert(event == AMQP_SF_POLLIN || event == AMQP_SF_POLLOUT);
-
-start_poll:
-  pfd.fd = fd;
-  switch (event) {
-    case AMQP_SF_POLLIN:
-      pfd.events = POLLIN;
-      break;
-    case AMQP_SF_POLLOUT:
-      pfd.events = POLLOUT;
-      break;
-  }
-
-  timeout_ms = amqp_time_ms_until(deadline);
-  if (-1 > timeout_ms) {
-    return timeout_ms;
-  }
-
-  res = poll(&pfd, 1, timeout_ms);
-
-  if (0 < res) {
-    /* TODO: optimize this a bit by returning the AMQP_STATUS_SOCKET_ERROR or
-     * equivalent when pdf.revent is POLLHUP or POLLERR, so an extra syscall
-     * doesn't need to be made. */
-    return AMQP_STATUS_OK;
-  } else if (0 == res) {
-    return AMQP_STATUS_TIMEOUT;
-  } else {
-    switch (amqp_os_socket_error()) {
-      case EINTR:
-        goto start_poll;
-      default:
-        return AMQP_STATUS_SOCKET_ERROR;
-    }
-  }
-  return AMQP_STATUS_OK;
-#elif defined(HAVE_SELECT)
-  fd_set fds;
-  fd_set exceptfds;
-  fd_set *exceptfdsp;
-  int res;
-  struct timeval tv;
-  struct timeval *tvp;
-
-  assert((0 != (event & AMQP_SF_POLLIN)) || (0 != (event & AMQP_SF_POLLOUT)));
-#ifndef _WIN32
-  /* On Win32 connect() failure is indicated through the exceptfds, it does not
-   * make any sense to allow POLLERR on any other platform or condition */
-  assert(0 == (event & AMQP_SF_POLLERR));
-#endif
-
-start_select:
-  FD_ZERO(&fds);
-  FD_SET(fd, &fds);
-
-  if (event & AMQP_SF_POLLERR) {
-    FD_ZERO(&exceptfds);
-    FD_SET(fd, &exceptfds);
-    exceptfdsp = &exceptfds;
-  } else {
-    exceptfdsp = NULL;
-  }
-
-  res = amqp_time_tv_until(deadline, &tv, &tvp);
-  if (res != AMQP_STATUS_OK) {
-    return res;
-  }
-
-  if (event & AMQP_SF_POLLIN) {
-    res = select(fd + 1, &fds, NULL, exceptfdsp, tvp);
-  } else if (event & AMQP_SF_POLLOUT) {
-    res = select(fd + 1, NULL, &fds, exceptfdsp, tvp);
-  }
-
-  if (0 < res) {
-    return AMQP_STATUS_OK;
-  } else if (0 == res) {
-    return AMQP_STATUS_TIMEOUT;
-  } else {
-    switch (amqp_os_socket_error()) {
-      case EINTR:
-        goto start_select;
-      default:
-        return AMQP_STATUS_SOCKET_ERROR;
-    }
-  }
-#else
-#error "poll() or select() is needed to compile rabbitmq-c"
-#endif
-}
-
-static ssize_t do_poll(amqp_connection_state_t state, ssize_t res,
-                       amqp_time_t deadline) {
-  int fd = amqp_get_sockfd(state);
-  if (-1 == fd) {
-    return AMQP_STATUS_SOCKET_CLOSED;
-  }
-  switch (res) {
-    case AMQP_PRIVATE_STATUS_SOCKET_NEEDREAD:
-      res = amqp_poll(fd, AMQP_SF_POLLIN, deadline);
-      break;
-    case AMQP_PRIVATE_STATUS_SOCKET_NEEDWRITE:
-      res = amqp_poll(fd, AMQP_SF_POLLOUT, deadline);
-      break;
-  }
-  return res;
-}
-
-ssize_t amqp_try_send(amqp_connection_state_t state, const void *buf,
-                      size_t len, amqp_time_t deadline, int flags) {
-  ssize_t res;
-  void *buf_left = (void *)buf;
-  /* Assume that len is not going to be larger than ssize_t can hold. */
-  ssize_t len_left = (size_t)len;
-
-start_send:
-  res = amqp_socket_send(state->socket, buf_left, len_left, flags);
-
-  if (res > 0) {
-    len_left -= res;
-    buf_left = (char *)buf_left + res;
-    if (0 == len_left) {
-      return (ssize_t)len;
-    }
-    goto start_send;
-  }
-  res = do_poll(state, res, deadline);
-  if (AMQP_STATUS_OK == res) {
-    goto start_send;
-  }
-  if (AMQP_STATUS_TIMEOUT == res) {
-    return (ssize_t)len - len_left;
-  }
-  return res;
-}
-
-int amqp_open_socket(char const *hostname, int portnumber) {
-  return amqp_open_socket_inner(hostname, portnumber, amqp_time_infinite());
-}
-
-int amqp_open_socket_noblock(char const *hostname, int portnumber,
-                             struct timeval *timeout) {
-  amqp_time_t deadline;
-  int res = amqp_time_from_now(&deadline, timeout);
-  if (AMQP_STATUS_OK != res) {
-    return res;
-  }
-  return amqp_open_socket_inner(hostname, portnumber, deadline);
-}
-
-#ifdef _WIN32
-static int connect_socket(struct addrinfo *addr, amqp_time_t deadline) {
-  int one = 1;
-  SOCKET sockfd;
-  int last_error;
-
-  /*
-   * This cast is to squash warnings on Win64, see:
-   * http://stackoverflow.com/questions/1953639/is-it-safe-to-cast-socket-to-int-under-win64
-   */
-
-  sockfd = (int)socket(addr->ai_family, addr->ai_socktype, addr->ai_protocol);
-  if (INVALID_SOCKET == sockfd) {
-    return AMQP_STATUS_SOCKET_ERROR;
-  }
-
-  /* Set the socket to be non-blocking */
-  if (SOCKET_ERROR == ioctlsocket(sockfd, FIONBIO, &one)) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-
-  /* Disable nagle */
-  if (SOCKET_ERROR == setsockopt(sockfd, IPPROTO_TCP, TCP_NODELAY,
-                                 (const char *)&one, sizeof(one))) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-
-  /* Enable TCP keepalives */
-  if (SOCKET_ERROR == setsockopt(sockfd, SOL_SOCKET, SO_KEEPALIVE,
-                                 (const char *)&one, sizeof(one))) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-
-  if (SOCKET_ERROR != connect(sockfd, addr->ai_addr, (int)addr->ai_addrlen)) {
-    return (int)sockfd;
-  }
-
-  if (WSAEWOULDBLOCK != WSAGetLastError()) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-
-  last_error =
-      amqp_poll((int)sockfd, AMQP_SF_POLLOUT | AMQP_SF_POLLERR, deadline);
-  if (AMQP_STATUS_OK != last_error) {
-    goto err;
-  }
-
-  {
-    int result;
-    int result_len = sizeof(result);
-
-    if (SOCKET_ERROR == getsockopt(sockfd, SOL_SOCKET, SO_ERROR,
-                                   (char *)&result, &result_len) ||
-        result != 0) {
-      last_error = AMQP_STATUS_SOCKET_ERROR;
-      goto err;
-    }
-  }
-
-  return (int)sockfd;
-
-err:
-  closesocket(sockfd);
-  return last_error;
-}
-#else
-static int connect_socket(struct addrinfo *addr, amqp_time_t deadline) {
-  int one = 1;
-  int sockfd;
-  int flags;
-  int last_error;
-
-  sockfd = socket(addr->ai_family, addr->ai_socktype, addr->ai_protocol);
-  if (-1 == sockfd) {
-    return AMQP_STATUS_SOCKET_ERROR;
-  }
-
-  /* Enable CLOEXEC on socket */
-  flags = fcntl(sockfd, F_GETFD);
-  if (flags == -1 || fcntl(sockfd, F_SETFD, (long)(flags | FD_CLOEXEC)) == -1) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-
-  /* Set the socket as non-blocking */
-  flags = fcntl(sockfd, F_GETFL);
-  if (flags == -1 || fcntl(sockfd, F_SETFL, (long)(flags | O_NONBLOCK)) == -1) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-
-#ifdef SO_NOSIGPIPE
-  /* Turn off SIGPIPE on platforms that support it, BSD, MacOSX */
-  if (0 != setsockopt(sockfd, SOL_SOCKET, SO_NOSIGPIPE, &one, sizeof(one))) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-#endif /* SO_NOSIGPIPE */
-
-  /* Disable nagle */
-  if (0 != setsockopt(sockfd, IPPROTO_TCP, TCP_NODELAY, &one, sizeof(one))) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-
-  /* Enable TCP keepalives */
-  if (0 != setsockopt(sockfd, SOL_SOCKET, SO_KEEPALIVE, &one, sizeof(one))) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-
-  if (0 == connect(sockfd, addr->ai_addr, addr->ai_addrlen)) {
-    return sockfd;
-  }
-
-  if (EINPROGRESS != errno) {
-    last_error = AMQP_STATUS_SOCKET_ERROR;
-    goto err;
-  }
-
-  last_error = amqp_poll(sockfd, AMQP_SF_POLLOUT, deadline);
-  if (AMQP_STATUS_OK != last_error) {
-    goto err;
-  }
-
-  {
-    int result;
-    socklen_t result_len = sizeof(result);
-
-    if (-1 == getsockopt(sockfd, SOL_SOCKET, SO_ERROR, &result, &result_len) ||
-        result != 0) {
-      last_error = AMQP_STATUS_SOCKET_ERROR;
-      goto err;
-    }
-  }
-
-  return sockfd;
-
-err:
-  close(sockfd);
-  return last_error;
-}
-#endif
-
-int amqp_open_socket_inner(char const *hostname, int portnumber,
-                           amqp_time_t deadline) {
-  struct addrinfo hint;
-  struct addrinfo *address_list;
-  struct addrinfo *addr;
-  char portnumber_string[33];
-  int sockfd = -1;
-  int last_error;
-
-  last_error = amqp_os_socket_init();
-  if (AMQP_STATUS_OK != last_error) {
-    return last_error;
-  }
-
-  memset(&hint, 0, sizeof(hint));
-  hint.ai_family = PF_UNSPEC; /* PF_INET or PF_INET6 */
-  hint.ai_socktype = SOCK_STREAM;
-  hint.ai_protocol = IPPROTO_TCP;
-
-  (void)sprintf(portnumber_string, "%d", portnumber);
-
-  last_error = getaddrinfo(hostname, portnumber_string, &hint, &address_list);
-  if (0 != last_error) {
-    return AMQP_STATUS_HOSTNAME_RESOLUTION_FAILED;
-  }
-
-  for (addr = address_list; addr; addr = addr->ai_next) {
-    sockfd = connect_socket(addr, deadline);
-
-    if (sockfd >= 0) {
-      last_error = AMQP_STATUS_OK;
-      break;
-    } else if (sockfd == AMQP_STATUS_TIMEOUT) {
-      last_error = sockfd;
-      break;
-    }
-  }
-
-  freeaddrinfo(address_list);
-  if (last_error != AMQP_STATUS_OK || sockfd == -1) {
-    return last_error;
-  }
-  return sockfd;
-}
-
-static int send_header_inner(amqp_connection_state_t state,
-                             amqp_time_t deadline) {
-  ssize_t res;
-  static const uint8_t header[8] = {'A',
-                                    'M',
-                                    'Q',
-                                    'P',
-                                    0,
-                                    AMQP_PROTOCOL_VERSION_MAJOR,
-                                    AMQP_PROTOCOL_VERSION_MINOR,
-                                    AMQP_PROTOCOL_VERSION_REVISION};
-  res = amqp_try_send(state, header, sizeof(header), deadline, AMQP_SF_NONE);
-  if (sizeof(header) == res) {
-    return AMQP_STATUS_OK;
-  }
-  return (int)res;
-}
-
-int amqp_send_header(amqp_connection_state_t state) {
-  return send_header_inner(state, amqp_time_infinite());
-}
-
-static amqp_bytes_t sasl_method_name(amqp_sasl_method_enum method) {
-  amqp_bytes_t res;
-
-  switch (method) {
-    case AMQP_SASL_METHOD_PLAIN:
-      res = amqp_cstring_bytes("PLAIN");
-      break;
-    case AMQP_SASL_METHOD_EXTERNAL:
-      res = amqp_cstring_bytes("EXTERNAL");
-      break;
-
-    default:
-      amqp_abort("Invalid SASL method: %d", (int)method);
-  }
-
-  return res;
-}
-
-static int bytes_equal(amqp_bytes_t l, amqp_bytes_t r) {
-  if (l.len == r.len) {
-    if (l.bytes && r.bytes) {
-      if (0 == memcmp(l.bytes, r.bytes, l.len)) {
-        return 1;
-      }
-    }
-  }
-  return 0;
-}
-
-int sasl_mechanism_in_list(amqp_bytes_t mechanisms,
-                           amqp_sasl_method_enum method) {
-  amqp_bytes_t mechanism;
-  amqp_bytes_t supported_mechanism;
-  uint8_t *start;
-  uint8_t *end;
-  uint8_t *current;
-
-  assert(NULL != mechanisms.bytes);
-
-  mechanism = sasl_method_name(method);
-
-  start = (uint8_t *)mechanisms.bytes;
-  current = start;
-  end = start + mechanisms.len;
-
-  for (; current != end; start = current + 1) {
-    /* HACK: SASL states that we should be parsing this string as a UTF-8
-     * string, which we're plainly not doing here. At this point its not worth
-     * dragging an entire UTF-8 parser for this one case, and this should work
-     * most of the time */
-    current = memchr(start, ' ', end - start);
-    if (NULL == current) {
-      current = end;
-    }
-    supported_mechanism.bytes = start;
-    supported_mechanism.len = current - start;
-    if (bytes_equal(mechanism, supported_mechanism)) {
-      return 1;
-    }
-  }
-
-  return 0;
-}
-
-static amqp_bytes_t sasl_response(amqp_pool_t *pool,
-                                  amqp_sasl_method_enum method, va_list args) {
-  amqp_bytes_t response;
-
-  switch (method) {
-    case AMQP_SASL_METHOD_PLAIN: {
-      char *username = va_arg(args, char *);
-      size_t username_len = strlen(username);
-      char *password = va_arg(args, char *);
-      size_t password_len = strlen(password);
-      char *response_buf;
-
-      amqp_pool_alloc_bytes(pool, strlen(username) + strlen(password) + 2,
-                            &response);
-      if (response.bytes == NULL)
-      /* We never request a zero-length block, because of the +2
-         above, so a NULL here really is ENOMEM. */
-      {
-        return response;
-      }
-
-      response_buf = response.bytes;
-      response_buf[0] = 0;
-      memcpy(response_buf + 1, username, username_len);
-      response_buf[username_len + 1] = 0;
-      memcpy(response_buf + username_len + 2, password, password_len);
-      break;
-    }
-    case AMQP_SASL_METHOD_EXTERNAL: {
-      char *identity = va_arg(args, char *);
-      size_t identity_len = strlen(identity);
-
-      amqp_pool_alloc_bytes(pool, identity_len, &response);
-      if (response.bytes == NULL) {
-        return response;
-      }
-
-      memcpy(response.bytes, identity, identity_len);
-      break;
-    }
-    default:
-      amqp_abort("Invalid SASL method: %d", (int)method);
-  }
-
-  return response;
-}
-
-amqp_boolean_t amqp_frames_enqueued(amqp_connection_state_t state) {
-  return (state->first_queued_frame != NULL);
-}
-
-/*
- * Check to see if we have data in our buffer. If this returns 1, we
- * will avoid an immediate blocking read in amqp_simple_wait_frame.
- */
-amqp_boolean_t amqp_data_in_buffer(amqp_connection_state_t state) {
-  return (state->sock_inbound_offset < state->sock_inbound_limit);
-}
-
-static int consume_one_frame(amqp_connection_state_t state,
-                             amqp_frame_t *decoded_frame) {
-  int res;
-
-  amqp_bytes_t buffer;
-  buffer.len = state->sock_inbound_limit - state->sock_inbound_offset;
-  buffer.bytes =
-      ((char *)state->sock_inbound_buffer.bytes) + state->sock_inbound_offset;
-
-  res = amqp_handle_input(state, buffer, decoded_frame);
-  if (res < 0) {
-    return res;
-  }
-
-  state->sock_inbound_offset += res;
-
-  return AMQP_STATUS_OK;
-}
-
-static int recv_with_timeout(amqp_connection_state_t state,
-                             amqp_time_t timeout) {
-  ssize_t res;
-  int fd;
-
-start_recv:
-  res = amqp_socket_recv(state->socket, state->sock_inbound_buffer.bytes,
-                         state->sock_inbound_buffer.len, 0);
-
-  if (res < 0) {
-    fd = amqp_get_sockfd(state);
-    if (-1 == fd) {
-      return AMQP_STATUS_CONNECTION_CLOSED;
-    }
-    switch (res) {
-      default:
-        return (int)res;
-      case AMQP_PRIVATE_STATUS_SOCKET_NEEDREAD:
-        res = amqp_poll(fd, AMQP_SF_POLLIN, timeout);
-        break;
-      case AMQP_PRIVATE_STATUS_SOCKET_NEEDWRITE:
-        res = amqp_poll(fd, AMQP_SF_POLLOUT, timeout);
-        break;
-    }
-    if (AMQP_STATUS_OK == res) {
-      goto start_recv;
-    }
-    return (int)res;
-  }
-
-  state->sock_inbound_limit = res;
-  state->sock_inbound_offset = 0;
-
-  res = amqp_time_s_from_now(&state->next_recv_heartbeat,
-                             amqp_heartbeat_recv(state));
-  if (AMQP_STATUS_OK != res) {
-    return (int)res;
-  }
-  return AMQP_STATUS_OK;
-}
-
-int amqp_try_recv(amqp_connection_state_t state) {
-  amqp_time_t timeout;
-
-  while (amqp_data_in_buffer(state)) {
-    amqp_frame_t frame;
-    int res = consume_one_frame(state, &frame);
-
-    if (AMQP_STATUS_OK != res) {
-      return res;
-    }
-
-    if (frame.frame_type != 0) {
-      amqp_pool_t *channel_pool;
-      amqp_frame_t *frame_copy;
-      amqp_link_t *link;
-
-      channel_pool = amqp_get_or_create_channel_pool(state, frame.channel);
-      if (NULL == channel_pool) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-
-      frame_copy = amqp_pool_alloc(channel_pool, sizeof(amqp_frame_t));
-      link = amqp_pool_alloc(channel_pool, sizeof(amqp_link_t));
-
-      if (frame_copy == NULL || link == NULL) {
-        return AMQP_STATUS_NO_MEMORY;
-      }
-
-      *frame_copy = frame;
-
-      link->next = NULL;
-      link->data = frame_copy;
-
-      if (state->last_queued_frame == NULL) {
-        state->first_queued_frame = link;
-      } else {
-        state->last_queued_frame->next = link;
-      }
-      state->last_queued_frame = link;
-    }
-  }
-  timeout = amqp_time_immediate();
-
-  return recv_with_timeout(state, timeout);
-}
-
-static int wait_frame_inner(amqp_connection_state_t state,
-                            amqp_frame_t *decoded_frame,
-                            amqp_time_t timeout_deadline) {
-  amqp_time_t deadline;
-  int res;
-
-  for (;;) {
-    while (amqp_data_in_buffer(state)) {
-      res = consume_one_frame(state, decoded_frame);
-
-      if (AMQP_STATUS_OK != res) {
-        return res;
-      }
-
-      if (AMQP_FRAME_HEARTBEAT == decoded_frame->frame_type) {
-        amqp_maybe_release_buffers_on_channel(state, 0);
-        continue;
-      }
-
-      if (decoded_frame->frame_type != 0) {
-        /* Complete frame was read. Return it. */
-        return AMQP_STATUS_OK;
-      }
-    }
-
-  beginrecv:
-    res = amqp_time_has_past(state->next_send_heartbeat);
-    if (AMQP_STATUS_TIMER_FAILURE == res) {
-      return res;
-    } else if (AMQP_STATUS_TIMEOUT == res) {
-      amqp_frame_t heartbeat;
-      heartbeat.channel = 0;
-      heartbeat.frame_type = AMQP_FRAME_HEARTBEAT;
-
-      res = amqp_send_frame(state, &heartbeat);
-      if (AMQP_STATUS_OK != res) {
-        return res;
-      }
-    }
-    deadline = amqp_time_first(timeout_deadline,
-                               amqp_time_first(state->next_recv_heartbeat,
-                                               state->next_send_heartbeat));
-
-    /* TODO this needs to wait for a _frame_ and not anything written from the
-     * socket */
-    res = recv_with_timeout(state, deadline);
-
-    if (AMQP_STATUS_TIMEOUT == res) {
-      if (amqp_time_equal(deadline, state->next_recv_heartbeat)) {
-        amqp_socket_close(state->socket, AMQP_SC_FORCE);
-        return AMQP_STATUS_HEARTBEAT_TIMEOUT;
-      } else if (amqp_time_equal(deadline, timeout_deadline)) {
-        return AMQP_STATUS_TIMEOUT;
-      } else if (amqp_time_equal(deadline, state->next_send_heartbeat)) {
-        /* send heartbeat happens before we do recv_with_timeout */
-        goto beginrecv;
-      } else {
-        amqp_abort("Internal error: unable to determine timeout reason");
-      }
-    } else if (AMQP_STATUS_OK != res) {
-      return res;
-    }
-  }
-}
-
-static amqp_link_t *amqp_create_link_for_frame(amqp_connection_state_t state,
-                                               amqp_frame_t *frame) {
-  amqp_link_t *link;
-  amqp_frame_t *frame_copy;
-
-  amqp_pool_t *channel_pool =
-      amqp_get_or_create_channel_pool(state, frame->channel);
-
-  if (NULL == channel_pool) {
-    return NULL;
-  }
-
-  link = amqp_pool_alloc(channel_pool, sizeof(amqp_link_t));
-  frame_copy = amqp_pool_alloc(channel_pool, sizeof(amqp_frame_t));
-
-  if (NULL == link || NULL == frame_copy) {
-    return NULL;
-  }
-
-  *frame_copy = *frame;
-  link->data = frame_copy;
-
-  return link;
-}
-
-int amqp_queue_frame(amqp_connection_state_t state, amqp_frame_t *frame) {
-  amqp_link_t *link = amqp_create_link_for_frame(state, frame);
-  if (NULL == link) {
-    return AMQP_STATUS_NO_MEMORY;
-  }
-
-  if (NULL == state->first_queued_frame) {
-    state->first_queued_frame = link;
-  } else {
-    state->last_queued_frame->next = link;
-  }
-
-  link->next = NULL;
-  state->last_queued_frame = link;
-
-  return AMQP_STATUS_OK;
-}
-
-int amqp_put_back_frame(amqp_connection_state_t state, amqp_frame_t *frame) {
-  amqp_link_t *link = amqp_create_link_for_frame(state, frame);
-  if (NULL == link) {
-    return AMQP_STATUS_NO_MEMORY;
-  }
-
-  if (NULL == state->first_queued_frame) {
-    state->first_queued_frame = link;
-    state->last_queued_frame = link;
-    link->next = NULL;
-  } else {
-    link->next = state->first_queued_frame;
-    state->first_queued_frame = link;
-  }
-
-  return AMQP_STATUS_OK;
-}
-
-int amqp_simple_wait_frame_on_channel(amqp_connection_state_t state,
-                                      amqp_channel_t channel,
-                                      amqp_frame_t *decoded_frame) {
-  amqp_frame_t *frame_ptr;
-  amqp_link_t *cur;
-  int res;
-
-  for (cur = state->first_queued_frame; NULL != cur; cur = cur->next) {
-    frame_ptr = cur->data;
-
-    if (channel == frame_ptr->channel) {
-      state->first_queued_frame = cur->next;
-      if (NULL == state->first_queued_frame) {
-        state->last_queued_frame = NULL;
-      }
-
-      *decoded_frame = *frame_ptr;
-
-      return AMQP_STATUS_OK;
-    }
-  }
-
-  for (;;) {
-    res = wait_frame_inner(state, decoded_frame, amqp_time_infinite());
-
-    if (AMQP_STATUS_OK != res) {
-      return res;
-    }
-
-    if (channel == decoded_frame->channel) {
-      return AMQP_STATUS_OK;
-    } else {
-      res = amqp_queue_frame(state, decoded_frame);
-      if (res != AMQP_STATUS_OK) {
-        return res;
-      }
-    }
-  }
-}
-
-int amqp_simple_wait_frame(amqp_connection_state_t state,
-                           amqp_frame_t *decoded_frame) {
-  return amqp_simple_wait_frame_noblock(state, decoded_frame, NULL);
-}
-
-int amqp_simple_wait_frame_noblock(amqp_connection_state_t state,
-                                   amqp_frame_t *decoded_frame,
-                                   struct timeval *timeout) {
-  amqp_time_t deadline;
-
-  int res = amqp_time_from_now(&deadline, timeout);
-  if (AMQP_STATUS_OK != res) {
-    return res;
-  }
-
-  if (state->first_queued_frame != NULL) {
-    amqp_frame_t *f = (amqp_frame_t *)state->first_queued_frame->data;
-    state->first_queued_frame = state->first_queued_frame->next;
-    if (state->first_queued_frame == NULL) {
-      state->last_queued_frame = NULL;
-    }
-    *decoded_frame = *f;
-    return AMQP_STATUS_OK;
-  } else {
-    return wait_frame_inner(state, decoded_frame, deadline);
-  }
-}
-
-static int amqp_simple_wait_method_list(amqp_connection_state_t state,
-                                        amqp_channel_t expected_channel,
-                                        amqp_method_number_t *expected_methods,
-                                        amqp_time_t deadline,
-                                        amqp_method_t *output) {
-  amqp_frame_t frame;
-  struct timeval tv;
-  struct timeval *tvp;
-
-  int res = amqp_time_tv_until(deadline, &tv, &tvp);
-  if (res != AMQP_STATUS_OK) {
-    return res;
-  }
-
-  res = amqp_simple_wait_frame_noblock(state, &frame, tvp);
-  if (AMQP_STATUS_OK != res) {
-    return res;
-  }
-
-  if (AMQP_FRAME_METHOD != frame.frame_type ||
-      expected_channel != frame.channel ||
-      !amqp_id_in_reply_list(frame.payload.method.id, expected_methods)) {
-    return AMQP_STATUS_WRONG_METHOD;
-  }
-  *output = frame.payload.method;
-  return AMQP_STATUS_OK;
-}
-
-static int simple_wait_method_inner(amqp_connection_state_t state,
-                                    amqp_channel_t expected_channel,
-                                    amqp_method_number_t expected_method,
-                                    amqp_time_t deadline,
-                                    amqp_method_t *output) {
-  amqp_method_number_t expected_methods[] = {expected_method, 0};
-  return amqp_simple_wait_method_list(state, expected_channel, expected_methods,
-                                      deadline, output);
-}
-
-int amqp_simple_wait_method(amqp_connection_state_t state,
-                            amqp_channel_t expected_channel,
-                            amqp_method_number_t expected_method,
-                            amqp_method_t *output) {
-  return simple_wait_method_inner(state, expected_channel, expected_method,
-                                  amqp_time_infinite(), output);
-}
-
-int amqp_send_method(amqp_connection_state_t state, amqp_channel_t channel,
-                     amqp_method_number_t id, void *decoded) {
-  return amqp_send_method_inner(state, channel, id, decoded, AMQP_SF_NONE,
-                                amqp_time_infinite());
-}
-
-int amqp_send_method_inner(amqp_connection_state_t state,
-                           amqp_channel_t channel, amqp_method_number_t id,
-                           void *decoded, int flags, amqp_time_t deadline) {
-  amqp_frame_t frame;
-
-  frame.frame_type = AMQP_FRAME_METHOD;
-  frame.channel = channel;
-  frame.payload.method.id = id;
-  frame.payload.method.decoded = decoded;
-  return amqp_send_frame_inner(state, &frame, flags, deadline);
-}
-
-static int amqp_id_in_reply_list(amqp_method_number_t expected,
-                                 amqp_method_number_t *list) {
-  while (*list != 0) {
-    if (*list == expected) {
-      return 1;
-    }
-    list++;
-  }
-  return 0;
-}
-
-static amqp_rpc_reply_t simple_rpc_inner(
-    amqp_connection_state_t state, amqp_channel_t channel,
-    amqp_method_number_t request_id, amqp_method_number_t *expected_reply_ids,
-    void *decoded_request_method, amqp_time_t deadline) {
-  int status;
-  amqp_rpc_reply_t result;
-
-  memset(&result, 0, sizeof(result));
-
-  status = amqp_send_method(state, channel, request_id, decoded_request_method);
-  if (status < 0) {
-    return amqp_rpc_reply_error(status);
-  }
-
-  {
-    amqp_frame_t frame;
-
-  retry:
-    status = wait_frame_inner(state, &frame, deadline);
-    if (status < 0) {
-      if (status == AMQP_STATUS_TIMEOUT) {
-        amqp_socket_close(state->socket, AMQP_SC_FORCE);
-      }
-      return amqp_rpc_reply_error(status);
-    }
-
-    /*
-     * We store the frame for later processing unless it's something
-     * that directly affects us here, namely a method frame that is
-     * either
-     *  - on the channel we want, and of the expected type, or
-     *  - on the channel we want, and a channel.close frame, or
-     *  - on channel zero, and a connection.close frame.
-     */
-    if (!((frame.frame_type == AMQP_FRAME_METHOD) &&
-          (((frame.channel == channel) &&
-            (amqp_id_in_reply_list(frame.payload.method.id,
-                                   expected_reply_ids) ||
-             (frame.payload.method.id == AMQP_CHANNEL_CLOSE_METHOD))) ||
-           ((frame.channel == 0) &&
-            (frame.payload.method.id == AMQP_CONNECTION_CLOSE_METHOD))))) {
-      amqp_pool_t *channel_pool;
-      amqp_frame_t *frame_copy;
-      amqp_link_t *link;
-
-      channel_pool = amqp_get_or_create_channel_pool(state, frame.channel);
-      if (NULL == channel_pool) {
-        return amqp_rpc_reply_error(AMQP_STATUS_NO_MEMORY);
-      }
-
-      frame_copy = amqp_pool_alloc(channel_pool, sizeof(amqp_frame_t));
-      link = amqp_pool_alloc(channel_pool, sizeof(amqp_link_t));
-
-      if (frame_copy == NULL || link == NULL) {
-        return amqp_rpc_reply_error(AMQP_STATUS_NO_MEMORY);
-      }
-
-      *frame_copy = frame;
-
-      link->next = NULL;
-      link->data = frame_copy;
-
-      if (state->last_queued_frame == NULL) {
-        state->first_queued_frame = link;
-      } else {
-        state->last_queued_frame->next = link;
-      }
-      state->last_queued_frame = link;
-
-      goto retry;
-    }
-
-    result.reply_type =
-        (amqp_id_in_reply_list(frame.payload.method.id, expected_reply_ids))
-            ? AMQP_RESPONSE_NORMAL
-            : AMQP_RESPONSE_SERVER_EXCEPTION;
-
-    result.reply = frame.payload.method;
-    return result;
-  }
-}
-
-amqp_rpc_reply_t amqp_simple_rpc(amqp_connection_state_t state,
-                                 amqp_channel_t channel,
-                                 amqp_method_number_t request_id,
-                                 amqp_method_number_t *expected_reply_ids,
-                                 void *decoded_request_method) {
-  amqp_time_t deadline;
-  int res;
-
-  res = amqp_time_from_now(&deadline, state->rpc_timeout);
-  if (res != AMQP_STATUS_OK) {
-    return amqp_rpc_reply_error(res);
-  }
-
-  return simple_rpc_inner(state, channel, request_id, expected_reply_ids,
-                          decoded_request_method, deadline);
-}
-
-void *amqp_simple_rpc_decoded(amqp_connection_state_t state,
-                              amqp_channel_t channel,
-                              amqp_method_number_t request_id,
-                              amqp_method_number_t reply_id,
-                              void *decoded_request_method) {
-  amqp_time_t deadline;
-  int res;
-  amqp_method_number_t replies[2];
-
-  res = amqp_time_from_now(&deadline, state->rpc_timeout);
-  if (res != AMQP_STATUS_OK) {
-    state->most_recent_api_result = amqp_rpc_reply_error(res);
-    return NULL;
-  }
-
-  replies[0] = reply_id;
-  replies[1] = 0;
-
-  state->most_recent_api_result = simple_rpc_inner(
-      state, channel, request_id, replies, decoded_request_method, deadline);
-
-  if (state->most_recent_api_result.reply_type == AMQP_RESPONSE_NORMAL) {
-    return state->most_recent_api_result.reply.decoded;
-  } else {
-    return NULL;
-  }
-}
-
-amqp_rpc_reply_t amqp_get_rpc_reply(amqp_connection_state_t state) {
-  return state->most_recent_api_result;
-}
-
-/*
- * Merge base and add tables. If the two tables contain an entry with the same
- * key, the entry from the add table takes precedence. For entries that are both
- * tables with the same key, the table is recursively merged.
- */
-int amqp_merge_capabilities(const amqp_table_t *base, const amqp_table_t *add,
-                            amqp_table_t *result, amqp_pool_t *pool) {
-  int i;
-  int res;
-  amqp_pool_t temp_pool;
-  amqp_table_t temp_result;
-  assert(base != NULL);
-  assert(result != NULL);
-  assert(pool != NULL);
-
-  if (NULL == add) {
-    return amqp_table_clone(base, result, pool);
-  }
-
-  init_amqp_pool(&temp_pool, 4096);
-  temp_result.num_entries = 0;
-  temp_result.entries =
-      amqp_pool_alloc(&temp_pool, sizeof(amqp_table_entry_t) *
-                                      (base->num_entries + add->num_entries));
-  if (NULL == temp_result.entries) {
-    res = AMQP_STATUS_NO_MEMORY;
-    goto error_out;
-  }
-  for (i = 0; i < base->num_entries; ++i) {
-    temp_result.entries[temp_result.num_entries] = base->entries[i];
-    temp_result.num_entries++;
-  }
-  for (i = 0; i < add->num_entries; ++i) {
-    amqp_table_entry_t *e =
-        amqp_table_get_entry_by_key(&temp_result, add->entries[i].key);
-    if (NULL != e) {
-      if (AMQP_FIELD_KIND_TABLE == add->entries[i].value.kind &&
-          AMQP_FIELD_KIND_TABLE == e->value.kind) {
-        amqp_table_entry_t *be =
-            amqp_table_get_entry_by_key(base, add->entries[i].key);
-
-        res = amqp_merge_capabilities(&be->value.value.table,
-                                      &add->entries[i].value.value.table,
-                                      &e->value.value.table, &temp_pool);
-        if (AMQP_STATUS_OK != res) {
-          goto error_out;
-        }
-      } else {
-        e->value = add->entries[i].value;
-      }
-    } else {
-      temp_result.entries[temp_result.num_entries] = add->entries[i];
-      temp_result.num_entries++;
-    }
-  }
-  res = amqp_table_clone(&temp_result, result, pool);
-error_out:
-  empty_amqp_pool(&temp_pool);
-  return res;
-}
-
-static amqp_rpc_reply_t amqp_login_inner(
-    amqp_connection_state_t state, char const *vhost, int channel_max,
-    int frame_max, int heartbeat, const amqp_table_t *client_properties,
-    struct timeval *timeout, amqp_sasl_method_enum sasl_method, va_list vl) {
-  int res;
-  amqp_method_t method;
-
-  uint16_t client_channel_max;
-  uint32_t client_frame_max;
-  uint16_t client_heartbeat;
-
-  uint16_t server_channel_max;
-  uint32_t server_frame_max;
-  uint16_t server_heartbeat;
-
-  amqp_rpc_reply_t result;
-  amqp_time_t deadline;
-
-  if (channel_max < 0 || channel_max > UINT16_MAX) {
-    return amqp_rpc_reply_error(AMQP_STATUS_INVALID_PARAMETER);
-  }
-  client_channel_max = (uint16_t)channel_max;
-
-  if (frame_max < 0) {
-    return amqp_rpc_reply_error(AMQP_STATUS_INVALID_PARAMETER);
-  }
-  client_frame_max = (uint32_t)frame_max;
-
-  if (heartbeat < 0 || heartbeat > UINT16_MAX) {
-    return amqp_rpc_reply_error(AMQP_STATUS_INVALID_PARAMETER);
-  }
-  client_heartbeat = (uint16_t)heartbeat;
-
-  res = amqp_time_from_now(&deadline, timeout);
-  if (AMQP_STATUS_OK != res) {
-    goto error_res;
-  }
-
-  res = send_header_inner(state, deadline);
-  if (AMQP_STATUS_OK != res) {
-    goto error_res;
-  }
-
-  res = simple_wait_method_inner(state, 0, AMQP_CONNECTION_START_METHOD,
-                                 deadline, &method);
-  if (AMQP_STATUS_OK != res) {
-    goto error_res;
-  }
-
-  {
-    amqp_connection_start_t *s = (amqp_connection_start_t *)method.decoded;
-    if ((s->version_major != AMQP_PROTOCOL_VERSION_MAJOR) ||
-        (s->version_minor != AMQP_PROTOCOL_VERSION_MINOR)) {
-      res = AMQP_STATUS_INCOMPATIBLE_AMQP_VERSION;
-      goto error_res;
-    }
-
-    res = amqp_table_clone(&s->server_properties, &state->server_properties,
-                           &state->properties_pool);
-
-    if (AMQP_STATUS_OK != res) {
-      goto error_res;
-    }
-
-    /* TODO: check that our chosen SASL mechanism is in the list of
-       acceptable mechanisms. Or even let the application choose from
-       the list! */
-    if (!sasl_mechanism_in_list(s->mechanisms, sasl_method)) {
-      res = AMQP_STATUS_BROKER_UNSUPPORTED_SASL_METHOD;
-      goto error_res;
-    }
-  }
-
-  {
-    amqp_table_entry_t default_properties[6];
-    amqp_table_t default_table;
-    amqp_table_entry_t client_capabilities[2];
-    amqp_table_t client_capabilities_table;
-    amqp_connection_start_ok_t s;
-    amqp_pool_t *channel_pool;
-    amqp_bytes_t response_bytes;
-
-    channel_pool = amqp_get_or_create_channel_pool(state, 0);
-    if (NULL == channel_pool) {
-      res = AMQP_STATUS_NO_MEMORY;
-      goto error_res;
-    }
-
-    response_bytes = sasl_response(channel_pool, sasl_method, vl);
-    if (response_bytes.bytes == NULL) {
-      res = AMQP_STATUS_NO_MEMORY;
-      goto error_res;
-    }
-
-    client_capabilities[0] =
-        amqp_table_construct_bool_entry("authentication_failure_close", 1);
-    client_capabilities[1] =
-        amqp_table_construct_bool_entry("exchange_exchange_bindings", 1);
-
-    client_capabilities_table.entries = client_capabilities;
-    client_capabilities_table.num_entries =
-        sizeof(client_capabilities) / sizeof(amqp_table_entry_t);
-
-    default_properties[0] =
-        amqp_table_construct_utf8_entry("product", "rabbitmq-c");
-    default_properties[1] =
-        amqp_table_construct_utf8_entry("version", AMQP_VERSION_STRING);
-    default_properties[2] =
-        amqp_table_construct_utf8_entry("platform", AMQ_PLATFORM);
-    default_properties[3] =
-        amqp_table_construct_utf8_entry("copyright", AMQ_COPYRIGHT);
-    default_properties[4] = amqp_table_construct_utf8_entry(
-        "information", "See https://github.com/alanxz/rabbitmq-c");
-    default_properties[5] = amqp_table_construct_table_entry(
-        "capabilities", &client_capabilities_table);
-
-    default_table.entries = default_properties;
-    default_table.num_entries =
-        sizeof(default_properties) / sizeof(amqp_table_entry_t);
-
-    res = amqp_merge_capabilities(&default_table, client_properties,
-                                  &state->client_properties, channel_pool);
-    if (AMQP_STATUS_OK != res) {
-      goto error_res;
-    }
-
-    s.client_properties = state->client_properties;
-    s.mechanism = sasl_method_name(sasl_method);
-    s.response = response_bytes;
-    s.locale = amqp_cstring_bytes("en_US");
-
-    res = amqp_send_method_inner(state, 0, AMQP_CONNECTION_START_OK_METHOD, &s,
-                                 AMQP_SF_NONE, deadline);
-    if (res < 0) {
-      goto error_res;
-    }
-  }
-
-  amqp_release_buffers(state);
-
-  {
-    amqp_method_number_t expected[] = {AMQP_CONNECTION_TUNE_METHOD,
-                                       AMQP_CONNECTION_CLOSE_METHOD, 0};
-
-    res = amqp_simple_wait_method_list(state, 0, expected, deadline, &method);
-    if (AMQP_STATUS_OK != res) {
-      goto error_res;
-    }
-  }
-
-  if (AMQP_CONNECTION_CLOSE_METHOD == method.id) {
-    result.reply_type = AMQP_RESPONSE_SERVER_EXCEPTION;
-    result.reply = method;
-    result.library_error = 0;
-    goto out;
-  }
-
-  {
-    amqp_connection_tune_t *s = (amqp_connection_tune_t *)method.decoded;
-    server_channel_max = s->channel_max;
-    server_frame_max = s->frame_max;
-    server_heartbeat = s->heartbeat;
-  }
-
-  if (server_channel_max != 0 &&
-      (server_channel_max < client_channel_max || client_channel_max == 0)) {
-    client_channel_max = server_channel_max;
-  } else if (server_channel_max == 0 && client_channel_max == 0) {
-    client_channel_max = UINT16_MAX;
-  }
-
-  if (server_frame_max != 0 && server_frame_max < client_frame_max) {
-    client_frame_max = server_frame_max;
-  }
-
-  if (server_heartbeat != 0 && server_heartbeat < client_heartbeat) {
-    client_heartbeat = server_heartbeat;
-  }
-
-  res = amqp_tune_connection(state, client_channel_max, client_frame_max,
-                             client_heartbeat);
-  if (res < 0) {
-    goto error_res;
-  }
-
-  {
-    amqp_connection_tune_ok_t s;
-    s.frame_max = client_frame_max;
-    s.channel_max = client_channel_max;
-    s.heartbeat = client_heartbeat;
-
-    res = amqp_send_method_inner(state, 0, AMQP_CONNECTION_TUNE_OK_METHOD, &s,
-                                 AMQP_SF_NONE, deadline);
-    if (res < 0) {
-      goto error_res;
-    }
-  }
-
-  amqp_release_buffers(state);
-
-  {
-    amqp_method_number_t replies[] = {AMQP_CONNECTION_OPEN_OK_METHOD, 0};
-    amqp_connection_open_t s;
-    s.virtual_host = amqp_cstring_bytes(vhost);
-    s.capabilities = amqp_empty_bytes;
-    s.insist = 1;
-
-    result = simple_rpc_inner(state, 0, AMQP_CONNECTION_OPEN_METHOD, replies,
-                              &s, deadline);
-    if (result.reply_type != AMQP_RESPONSE_NORMAL) {
-      goto out;
-    }
-  }
-
-  result.reply_type = AMQP_RESPONSE_NORMAL;
-  result.reply.id = 0;
-  result.reply.decoded = NULL;
-  result.library_error = 0;
-  amqp_maybe_release_buffers(state);
-
-out:
-  return result;
-
-error_res:
-  amqp_socket_close(state->socket, AMQP_SC_FORCE);
-  result = amqp_rpc_reply_error(res);
-
-  goto out;
-}
-
-amqp_rpc_reply_t amqp_login(amqp_connection_state_t state, char const *vhost,
-                            int channel_max, int frame_max, int heartbeat,
-                            int sasl_method, ...) {
-  va_list vl;
-  amqp_rpc_reply_t ret;
-
-  va_start(vl, sasl_method);
-
-  ret = amqp_login_inner(state, vhost, channel_max, frame_max, heartbeat,
-                         &amqp_empty_table, state->handshake_timeout,
-                         sasl_method, vl);
-
-  va_end(vl);
-
-  return ret;
-}
-
-amqp_rpc_reply_t amqp_login_with_properties(
-    amqp_connection_state_t state, char const *vhost, int channel_max,
-    int frame_max, int heartbeat, const amqp_table_t *client_properties,
-    int sasl_method, ...) {
-  va_list vl;
-  amqp_rpc_reply_t ret;
-
-  va_start(vl, sasl_method);
-
-  ret = amqp_login_inner(state, vhost, channel_max, frame_max, heartbeat,
-                         client_properties, state->handshake_timeout,
-                         sasl_method, vl);
-
-  va_end(vl);
-
-  return ret;
-}

ext/librabbitmq/librabbitmq/amqp_socket.h

@@ -1,188 +0,0 @@
-/*
- * Portions created by Alan Antonuk are Copyright (c) 2013-2014 Alan Antonuk.
- * All Rights Reserved.
- *
- * Portions created by Michael Steinert are Copyright (c) 2012-2013 Michael
- * Steinert. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-
-/**
- * An abstract socket interface.
- */
-
-#ifndef AMQP_SOCKET_H
-#define AMQP_SOCKET_H
-
-#include "amqp_private.h"
-#include "amqp_time.h"
-
-AMQP_BEGIN_DECLS
-
-typedef enum {
-  AMQP_SF_NONE = 0,
-  AMQP_SF_MORE = 1,
-  AMQP_SF_POLLIN = 2,
-  AMQP_SF_POLLOUT = 4,
-  AMQP_SF_POLLERR = 8
-} amqp_socket_flag_enum;
-
-typedef enum { AMQP_SC_NONE = 0, AMQP_SC_FORCE = 1 } amqp_socket_close_enum;
-
-int amqp_os_socket_error(void);
-
-int amqp_os_socket_close(int sockfd);
-
-/* Socket callbacks. */
-typedef ssize_t (*amqp_socket_send_fn)(void *, const void *, size_t, int);
-typedef ssize_t (*amqp_socket_recv_fn)(void *, void *, size_t, int);
-typedef int (*amqp_socket_open_fn)(void *, const char *, int, struct timeval *);
-typedef int (*amqp_socket_close_fn)(void *, amqp_socket_close_enum);
-typedef int (*amqp_socket_get_sockfd_fn)(void *);
-typedef void (*amqp_socket_delete_fn)(void *);
-
-/** V-table for amqp_socket_t */
-struct amqp_socket_class_t {
-  amqp_socket_send_fn send;
-  amqp_socket_recv_fn recv;
-  amqp_socket_open_fn open;
-  amqp_socket_close_fn close;
-  amqp_socket_get_sockfd_fn get_sockfd;
-  amqp_socket_delete_fn delete;
-};
-
-/** Abstract base class for amqp_socket_t */
-struct amqp_socket_t_ {
-  const struct amqp_socket_class_t *klass;
-};
-
-/**
- * Set set the socket object for a connection
- *
- * This assigns a socket object to the connection, closing and deleting any
- * existing socket
- *
- * \param [in] state The connection object to add the socket to
- * \param [in] socket The socket object to assign to the connection
- */
-void amqp_set_socket(amqp_connection_state_t state, amqp_socket_t *socket);
-
-/**
- * Send a message from a socket.
- *
- * This function wraps send(2) functionality.
- *
- * This function will only return on error, or when all of the bytes in buf
- * have been sent, or when an error occurs.
- *
- * \param [in,out] self A socket object.
- * \param [in] buf A buffer to read from.
- * \param [in] len The number of bytes in \e buf.
- * \param [in]
- *
- * \return AMQP_STATUS_OK on success. amqp_status_enum value otherwise
- */
-ssize_t amqp_socket_send(amqp_socket_t *self, const void *buf, size_t len,
-                         int flags);
-
-ssize_t amqp_try_send(amqp_connection_state_t state, const void *buf,
-                      size_t len, amqp_time_t deadline, int flags);
-
-/**
- * Receive a message from a socket.
- *
- * This function wraps recv(2) functionality.
- *
- * \param [in,out] self A socket object.
- * \param [out] buf A buffer to write to.
- * \param [in] len The number of bytes at \e buf.
- * \param [in] flags Receive flags, implementation specific.
- *
- * \return The number of bytes received, or < 0 on error (\ref amqp_status_enum)
- */
-ssize_t amqp_socket_recv(amqp_socket_t *self, void *buf, size_t len, int flags);
-
-/**
- * Close a socket connection and free resources.
- *
- * This function closes a socket connection and releases any resources used by
- * the object. After calling this function the specified socket should no
- * longer be referenced.
- *
- * \param [in,out] self A socket object.
- * \param [in] force, if set, just close the socket, don't attempt a TLS
- * shutdown.
- *
- * \return Zero upon success, non-zero otherwise.
- */
-int amqp_socket_close(amqp_socket_t *self, amqp_socket_close_enum force);
-
-/**
- * Destroy a socket object
- *
- * \param [in] self the socket object to delete
- */
-void amqp_socket_delete(amqp_socket_t *self);
-
-/**
- * Open a socket connection.
- *
- * This function opens a socket connection returned from amqp_tcp_socket_new()
- * or amqp_ssl_socket_new(). This function should be called after setting
- * socket options and prior to assigning the socket to an AMQP connection with
- * amqp_set_socket().
- *
- * \param [in] host Connect to this host.
- * \param [in] port Connect on this remote port.
- * \param [in] timeout Max allowed time to spent on opening. If NULL - run in
- * blocking mode
- *
- * \return File descriptor upon success, non-zero negative error code otherwise.
- */
-int amqp_open_socket_noblock(char const *hostname, int portnumber,
-                             struct timeval *timeout);
-
-int amqp_open_socket_inner(char const *hostname, int portnumber,
-                           amqp_time_t deadline);
-
-/* Wait up to dealline for fd to become readable or writeable depending on
- * event (AMQP_SF_POLLIN, AMQP_SF_POLLOUT) */
-int amqp_poll(int fd, int event, amqp_time_t deadline);
-
-int amqp_send_method_inner(amqp_connection_state_t state,
-                           amqp_channel_t channel, amqp_method_number_t id,
-                           void *decoded, int flags, amqp_time_t deadline);
-
-int amqp_queue_frame(amqp_connection_state_t state, amqp_frame_t *frame);
-
-int amqp_put_back_frame(amqp_connection_state_t state, amqp_frame_t *frame);
-
-int amqp_simple_wait_frame_on_channel(amqp_connection_state_t state,
-                                      amqp_channel_t channel,
-                                      amqp_frame_t *decoded_frame);
-
-int sasl_mechanism_in_list(amqp_bytes_t mechanisms,
-                           amqp_sasl_method_enum method);
-
-int amqp_merge_capabilities(const amqp_table_t *base, const amqp_table_t *add,
-                            amqp_table_t *result, amqp_pool_t *pool);
-AMQP_END_DECLS
-
-#endif /* AMQP_SOCKET_H */

ext/librabbitmq/librabbitmq/amqp_ssl_socket.h

@@ -1,239 +0,0 @@
-/** \file */
-/*
- * Portions created by Alan Antonuk are Copyright (c) 2013-2014 Alan Antonuk.
- * All Rights Reserved.
- *
- * Portions created by Michael Steinert are Copyright (c) 2012-2013 Michael
- * Steinert. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-
-#ifndef AMQP_SSL_H
-#define AMQP_SSL_H
-
-#include <amqp.h>
-
-AMQP_BEGIN_DECLS
-
-/**
- * Create a new SSL/TLS socket object.
- *
- * The returned socket object is owned by the \ref amqp_connection_state_t
- * object and will be destroyed when the state object is destroyed or a new
- * socket object is created.
- *
- * If the socket object creation fails, the \ref amqp_connection_state_t object
- * will not be changed.
- *
- * The object returned by this function can be retrieved from the
- * amqp_connection_state_t object later using the amqp_get_socket() function.
- *
- * Calling this function may result in the underlying SSL library being
- * initialized.
- * \sa amqp_set_initialize_ssl_library()
- *
- * \param [in,out] state The connection object that owns the SSL/TLS socket
- * \return A new socket object or NULL if an error occurred.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-amqp_socket_t *AMQP_CALL amqp_ssl_socket_new(amqp_connection_state_t state);
-
-/**
- * Set the CA certificate.
- *
- * \param [in,out] self An SSL/TLS socket object.
- * \param [in] cacert Path to the CA cert file in PEM format.
- *
- * \return \ref AMQP_STATUS_OK on success an \ref amqp_status_enum value on
- *  failure.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_ssl_socket_set_cacert(amqp_socket_t *self,
-                                         const char *cacert);
-
-/**
- * Set the client key.
- *
- * \param [in,out] self An SSL/TLS socket object.
- * \param [in] cert Path to the client certificate in PEM foramt.
- * \param [in] key Path to the client key in PEM format.
- *
- * \return \ref AMQP_STATUS_OK on success an \ref amqp_status_enum value on
- *  failure.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_ssl_socket_set_key(amqp_socket_t *self, const char *cert,
-                                      const char *key);
-
-/**
- * Set the client key from a buffer.
- *
- * \param [in,out] self An SSL/TLS socket object.
- * \param [in] cert Path to the client certificate in PEM foramt.
- * \param [in] key A buffer containing client key in PEM format.
- * \param [in] n The length of the buffer.
- *
- * \return \ref AMQP_STATUS_OK on success an \ref amqp_status_enum value on
- *  failure.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_ssl_socket_set_key_buffer(amqp_socket_t *self,
-                                             const char *cert, const void *key,
-                                             size_t n);
-
-/**
- * Enable or disable peer verification.
- *
- * \deprecated use \amqp_ssl_socket_set_verify_peer and
- * \amqp_ssl_socket_set_verify_hostname instead.
- *
- * If peer verification is enabled then the common name in the server
- * certificate must match the server name. Peer verification is enabled by
- * default.
- *
- * \param [in,out] self An SSL/TLS socket object.
- * \param [in] verify Enable or disable peer verification.
- *
- * \since v0.4.0
- */
-AMQP_DEPRECATED(AMQP_PUBLIC_FUNCTION void AMQP_CALL amqp_ssl_socket_set_verify(
-    amqp_socket_t *self, amqp_boolean_t verify));
-
-/**
- * Enable or disable peer verification.
- *
- * Peer verification validates the certificate chain that is sent by the broker.
- * Hostname validation is controlled by \amqp_ssl_socket_set_verify_peer.
- *
- * \param [in,out] self An SSL/TLS socket object.
- * \param [in] verify enable or disable peer validation
- *
- * \since v0.8.0
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_ssl_socket_set_verify_peer(amqp_socket_t *self,
-                                               amqp_boolean_t verify);
-
-/**
- * Enable or disable hostname verification.
- *
- * Hostname verification checks the broker cert for a CN or SAN that matches the
- * hostname that amqp_socket_open() is presented. Peer verification is
- * controlled by \amqp_ssl_socket_set_verify_peer
- *
- * \since v0.8.0
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_ssl_socket_set_verify_hostname(amqp_socket_t *self,
-                                                   amqp_boolean_t verify);
-
-typedef enum {
-  AMQP_TLSv1 = 1,
-  AMQP_TLSv1_1 = 2,
-  AMQP_TLSv1_2 = 3,
-  AMQP_TLSvLATEST = 0xFFFF
-} amqp_tls_version_t;
-
-/**
- * Set min and max TLS versions.
- *
- * Set the oldest and newest acceptable TLS versions that are acceptable when
- * connecting to the broker. Set min == max to restrict to just that
- * version.
- *
- * \param [in,out] self An SSL/TLS socket object.
- * \param [in] min the minimum acceptable TLS version
- * \param [in] max the maxmium acceptable TLS version
- * \returns AMQP_STATUS_OK on success, AMQP_STATUS_UNSUPPORTED if OpenSSL does
- * not support the requested TLS version, AMQP_STATUS_INVALID_PARAMETER if an
- * invalid combination of parameters is passed.
- *
- * \since v0.8.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_ssl_socket_set_ssl_versions(amqp_socket_t *self,
-                                               amqp_tls_version_t min,
-                                               amqp_tls_version_t max);
-
-/**
- * Sets whether rabbitmq-c will initialize OpenSSL.
- *
- * OpenSSL requires a one-time initialization across a whole program, this sets
- * whether or not rabbitmq-c will initialize the SSL library when the first call
- * to amqp_ssl_socket_new() is made. You should call this function with
- * do_init = 0 if the underlying SSL library is initialized somewhere else
- * the program.
- *
- * Failing to initialize or double initialization of the SSL library will
- * result in undefined behavior
- *
- * By default rabbitmq-c will initialize the underlying SSL library.
- *
- * NOTE: calling this function after the first socket has been opened with
- * amqp_open_socket() will not have any effect.
- *
- * \param [in] do_initialize If 0 rabbitmq-c will not initialize the SSL
- *                           library, otherwise rabbitmq-c will initialize the
- *                           SSL library
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_set_initialize_ssl_library(amqp_boolean_t do_initialize);
-
-/**
- * Initialize the underlying SSL/TLS library.
- *
- * The OpenSSL library requires a one-time initialization across the whole
- * program.
- *
- * This function unconditionally initializes OpenSSL so that rabbitmq-c may
- * use it.
- *
- * This function is thread-safe, and may be called more than once.
- *
- * \return AMQP_STATUS_OK on success.
- *
- * \since v0.9.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_initialize_ssl_library(void);
-
-/**
- * Uninitialize the underlying SSL/TLS library.
- *
- * \return AMQP_STATUS_OK on success.
- *
- * \since v0.9.0
- */
-AMQP_PUBLIC_FUNCTION
-int AMQP_CALL amqp_uninitialize_ssl_library(void);
-
-AMQP_END_DECLS
-
-#endif /* AMQP_SSL_H */

ext/librabbitmq/librabbitmq/amqp_table.c

@@ -1,668 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include "amqp_private.h"
-#include "amqp_table.h"
-#include <assert.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define INITIAL_ARRAY_SIZE 16
-#define INITIAL_TABLE_SIZE 16
-
-static int amqp_decode_field_value(amqp_bytes_t encoded, amqp_pool_t *pool,
-                                   amqp_field_value_t *entry, size_t *offset);
-
-static int amqp_encode_field_value(amqp_bytes_t encoded,
-                                   amqp_field_value_t *entry, size_t *offset);
-
-/*---------------------------------------------------------------------------*/
-
-static int amqp_decode_array(amqp_bytes_t encoded, amqp_pool_t *pool,
-                             amqp_array_t *output, size_t *offset) {
-  uint32_t arraysize;
-  int num_entries = 0;
-  int allocated_entries = INITIAL_ARRAY_SIZE;
-  amqp_field_value_t *entries;
-  size_t limit;
-  int res;
-
-  if (!amqp_decode_32(encoded, offset, &arraysize)) {
-    return AMQP_STATUS_BAD_AMQP_DATA;
-  }
-
-  if (arraysize + *offset > encoded.len) {
-    return AMQP_STATUS_BAD_AMQP_DATA;
-  }
-
-  entries = malloc(allocated_entries * sizeof(amqp_field_value_t));
-  if (entries == NULL) {
-    return AMQP_STATUS_NO_MEMORY;
-  }
-
-  limit = *offset + arraysize;
-  while (*offset < limit) {
-    if (num_entries >= allocated_entries) {
-      void *newentries;
-      allocated_entries = allocated_entries * 2;
-      newentries =
-          realloc(entries, allocated_entries * sizeof(amqp_field_value_t));
-      res = AMQP_STATUS_NO_MEMORY;
-      if (newentries == NULL) {
-        goto out;
-      }
-
-      entries = newentries;
-    }
-
-    res = amqp_decode_field_value(encoded, pool, &entries[num_entries], offset);
-    if (res < 0) {
-      goto out;
-    }
-
-    num_entries++;
-  }
-
-  output->num_entries = num_entries;
-  output->entries =
-      amqp_pool_alloc(pool, num_entries * sizeof(amqp_field_value_t));
-  /* NULL is legitimate if we requested a zero-length block. */
-  if (output->entries == NULL) {
-    if (num_entries == 0) {
-      res = AMQP_STATUS_OK;
-    } else {
-      res = AMQP_STATUS_NO_MEMORY;
-    }
-    goto out;
-  }
-
-  memcpy(output->entries, entries, num_entries * sizeof(amqp_field_value_t));
-  res = AMQP_STATUS_OK;
-
-out:
-  free(entries);
-  return res;
-}
-
-int amqp_decode_table(amqp_bytes_t encoded, amqp_pool_t *pool,
-                      amqp_table_t *output, size_t *offset) {
-  uint32_t tablesize;
-  int num_entries = 0;
-  amqp_table_entry_t *entries;
-  int allocated_entries = INITIAL_TABLE_SIZE;
-  size_t limit;
-  int res;
-
-  if (!amqp_decode_32(encoded, offset, &tablesize)) {
-    return AMQP_STATUS_BAD_AMQP_DATA;
-  }
-
-  if (tablesize + *offset > encoded.len) {
-    return AMQP_STATUS_BAD_AMQP_DATA;
-  }
-
-  entries = malloc(allocated_entries * sizeof(amqp_table_entry_t));
-  if (entries == NULL) {
-    return AMQP_STATUS_NO_MEMORY;
-  }
-
-  limit = *offset + tablesize;
-  while (*offset < limit) {
-    uint8_t keylen;
-
-    res = AMQP_STATUS_BAD_AMQP_DATA;
-    if (!amqp_decode_8(encoded, offset, &keylen)) {
-      goto out;
-    }
-
-    if (num_entries >= allocated_entries) {
-      void *newentries;
-      allocated_entries = allocated_entries * 2;
-      newentries =
-          realloc(entries, allocated_entries * sizeof(amqp_table_entry_t));
-      res = AMQP_STATUS_NO_MEMORY;
-      if (newentries == NULL) {
-        goto out;
-      }
-
-      entries = newentries;
-    }
-
-    res = AMQP_STATUS_BAD_AMQP_DATA;
-    if (!amqp_decode_bytes(encoded, offset, &entries[num_entries].key,
-                           keylen)) {
-      goto out;
-    }
-
-    res = amqp_decode_field_value(encoded, pool, &entries[num_entries].value,
-                                  offset);
-    if (res < 0) {
-      goto out;
-    }
-
-    num_entries++;
-  }
-
-  output->num_entries = num_entries;
-  output->entries =
-      amqp_pool_alloc(pool, num_entries * sizeof(amqp_table_entry_t));
-  /* NULL is legitimate if we requested a zero-length block. */
-  if (output->entries == NULL) {
-    if (num_entries == 0) {
-      res = AMQP_STATUS_OK;
-    } else {
-      res = AMQP_STATUS_NO_MEMORY;
-    }
-    goto out;
-  }
-
-  memcpy(output->entries, entries, num_entries * sizeof(amqp_table_entry_t));
-  res = AMQP_STATUS_OK;
-
-out:
-  free(entries);
-  return res;
-}
-
-static int amqp_decode_field_value(amqp_bytes_t encoded, amqp_pool_t *pool,
-                                   amqp_field_value_t *entry, size_t *offset) {
-  int res = AMQP_STATUS_BAD_AMQP_DATA;
-
-  if (!amqp_decode_8(encoded, offset, &entry->kind)) {
-    goto out;
-  }
-
-#define TRIVIAL_FIELD_DECODER(bits)                                          \
-  if (!amqp_decode_##bits(encoded, offset, &entry->value.u##bits)) goto out; \
-  break
-#define SIMPLE_FIELD_DECODER(bits, dest, how)                 \
-  {                                                           \
-    uint##bits##_t val;                                       \
-    if (!amqp_decode_##bits(encoded, offset, &val)) goto out; \
-    entry->value.dest = how;                                  \
-  }                                                           \
-  break
-
-  switch (entry->kind) {
-    case AMQP_FIELD_KIND_BOOLEAN:
-      SIMPLE_FIELD_DECODER(8, boolean, val ? 1 : 0);
-
-    case AMQP_FIELD_KIND_I8:
-      SIMPLE_FIELD_DECODER(8, i8, (int8_t)val);
-    case AMQP_FIELD_KIND_U8:
-      TRIVIAL_FIELD_DECODER(8);
-
-    case AMQP_FIELD_KIND_I16:
-      SIMPLE_FIELD_DECODER(16, i16, (int16_t)val);
-    case AMQP_FIELD_KIND_U16:
-      TRIVIAL_FIELD_DECODER(16);
-
-    case AMQP_FIELD_KIND_I32:
-      SIMPLE_FIELD_DECODER(32, i32, (int32_t)val);
-    case AMQP_FIELD_KIND_U32:
-      TRIVIAL_FIELD_DECODER(32);
-
-    case AMQP_FIELD_KIND_I64:
-      SIMPLE_FIELD_DECODER(64, i64, (int64_t)val);
-    case AMQP_FIELD_KIND_U64:
-      TRIVIAL_FIELD_DECODER(64);
-
-    case AMQP_FIELD_KIND_F32:
-      TRIVIAL_FIELD_DECODER(32);
-    /* and by punning, f32 magically gets the right value...! */
-
-    case AMQP_FIELD_KIND_F64:
-      TRIVIAL_FIELD_DECODER(64);
-    /* and by punning, f64 magically gets the right value...! */
-
-    case AMQP_FIELD_KIND_DECIMAL:
-      if (!amqp_decode_8(encoded, offset, &entry->value.decimal.decimals) ||
-          !amqp_decode_32(encoded, offset, &entry->value.decimal.value)) {
-        goto out;
-      }
-      break;
-
-    case AMQP_FIELD_KIND_UTF8:
-    /* AMQP_FIELD_KIND_UTF8 and AMQP_FIELD_KIND_BYTES have the
-       same implementation, but different interpretations. */
-    /* fall through */
-    case AMQP_FIELD_KIND_BYTES: {
-      uint32_t len;
-      if (!amqp_decode_32(encoded, offset, &len) ||
-          !amqp_decode_bytes(encoded, offset, &entry->value.bytes, len)) {
-        goto out;
-      }
-      break;
-    }
-
-    case AMQP_FIELD_KIND_ARRAY:
-      res = amqp_decode_array(encoded, pool, &(entry->value.array), offset);
-      goto out;
-
-    case AMQP_FIELD_KIND_TIMESTAMP:
-      TRIVIAL_FIELD_DECODER(64);
-
-    case AMQP_FIELD_KIND_TABLE:
-      res = amqp_decode_table(encoded, pool, &(entry->value.table), offset);
-      goto out;
-
-    case AMQP_FIELD_KIND_VOID:
-      break;
-
-    default:
-      goto out;
-  }
-
-  res = AMQP_STATUS_OK;
-
-out:
-  return res;
-}
-
-/*---------------------------------------------------------------------------*/
-
-static int amqp_encode_array(amqp_bytes_t encoded, amqp_array_t *input,
-                             size_t *offset) {
-  size_t start = *offset;
-  int i, res;
-
-  *offset += 4; /* size of the array gets filled in later on */
-
-  for (i = 0; i < input->num_entries; i++) {
-    res = amqp_encode_field_value(encoded, &input->entries[i], offset);
-    if (res < 0) {
-      goto out;
-    }
-  }
-
-  if (!amqp_encode_32(encoded, &start, (uint32_t)(*offset - start - 4))) {
-    res = AMQP_STATUS_TABLE_TOO_BIG;
-    goto out;
-  }
-
-  res = AMQP_STATUS_OK;
-
-out:
-  return res;
-}
-
-int amqp_encode_table(amqp_bytes_t encoded, amqp_table_t *input,
-                      size_t *offset) {
-  size_t start = *offset;
-  int i, res;
-
-  *offset += 4; /* size of the table gets filled in later on */
-
-  for (i = 0; i < input->num_entries; i++) {
-    if (!amqp_encode_8(encoded, offset, (uint8_t)input->entries[i].key.len)) {
-      res = AMQP_STATUS_TABLE_TOO_BIG;
-      goto out;
-    }
-
-    if (!amqp_encode_bytes(encoded, offset, input->entries[i].key)) {
-      res = AMQP_STATUS_TABLE_TOO_BIG;
-      goto out;
-    }
-
-    res = amqp_encode_field_value(encoded, &input->entries[i].value, offset);
-    if (res < 0) {
-      goto out;
-    }
-  }
-
-  if (!amqp_encode_32(encoded, &start, (uint32_t)(*offset - start - 4))) {
-    res = AMQP_STATUS_TABLE_TOO_BIG;
-    goto out;
-  }
-
-  res = AMQP_STATUS_OK;
-
-out:
-  return res;
-}
-
-static int amqp_encode_field_value(amqp_bytes_t encoded,
-                                   amqp_field_value_t *entry, size_t *offset) {
-  int res = AMQP_STATUS_BAD_AMQP_DATA;
-
-  if (!amqp_encode_8(encoded, offset, entry->kind)) {
-    goto out;
-  }
-
-#define FIELD_ENCODER(bits, val)                   \
-  if (!amqp_encode_##bits(encoded, offset, val)) { \
-    res = AMQP_STATUS_TABLE_TOO_BIG;               \
-    goto out;                                      \
-  }                                                \
-  break
-
-  switch (entry->kind) {
-    case AMQP_FIELD_KIND_BOOLEAN:
-      FIELD_ENCODER(8, entry->value.boolean ? 1 : 0);
-
-    case AMQP_FIELD_KIND_I8:
-      FIELD_ENCODER(8, entry->value.i8);
-    case AMQP_FIELD_KIND_U8:
-      FIELD_ENCODER(8, entry->value.u8);
-
-    case AMQP_FIELD_KIND_I16:
-      FIELD_ENCODER(16, entry->value.i16);
-    case AMQP_FIELD_KIND_U16:
-      FIELD_ENCODER(16, entry->value.u16);
-
-    case AMQP_FIELD_KIND_I32:
-      FIELD_ENCODER(32, entry->value.i32);
-    case AMQP_FIELD_KIND_U32:
-      FIELD_ENCODER(32, entry->value.u32);
-
-    case AMQP_FIELD_KIND_I64:
-      FIELD_ENCODER(64, entry->value.i64);
-    case AMQP_FIELD_KIND_U64:
-      FIELD_ENCODER(64, entry->value.u64);
-
-    case AMQP_FIELD_KIND_F32:
-      /* by punning, u32 magically gets the right value...! */
-      FIELD_ENCODER(32, entry->value.u32);
-
-    case AMQP_FIELD_KIND_F64:
-      /* by punning, u64 magically gets the right value...! */
-      FIELD_ENCODER(64, entry->value.u64);
-
-    case AMQP_FIELD_KIND_DECIMAL:
-      if (!amqp_encode_8(encoded, offset, entry->value.decimal.decimals) ||
-          !amqp_encode_32(encoded, offset, entry->value.decimal.value)) {
-        res = AMQP_STATUS_TABLE_TOO_BIG;
-        goto out;
-      }
-      break;
-
-    case AMQP_FIELD_KIND_UTF8:
-    /* AMQP_FIELD_KIND_UTF8 and AMQP_FIELD_KIND_BYTES have the
-       same implementation, but different interpretations. */
-    /* fall through */
-    case AMQP_FIELD_KIND_BYTES:
-      if (!amqp_encode_32(encoded, offset, (uint32_t)entry->value.bytes.len) ||
-          !amqp_encode_bytes(encoded, offset, entry->value.bytes)) {
-        res = AMQP_STATUS_TABLE_TOO_BIG;
-        goto out;
-      }
-      break;
-
-    case AMQP_FIELD_KIND_ARRAY:
-      res = amqp_encode_array(encoded, &entry->value.array, offset);
-      goto out;
-
-    case AMQP_FIELD_KIND_TIMESTAMP:
-      FIELD_ENCODER(64, entry->value.u64);
-
-    case AMQP_FIELD_KIND_TABLE:
-      res = amqp_encode_table(encoded, &entry->value.table, offset);
-      goto out;
-
-    case AMQP_FIELD_KIND_VOID:
-      break;
-
-    default:
-      res = AMQP_STATUS_INVALID_PARAMETER;
-      goto out;
-  }
-
-  res = AMQP_STATUS_OK;
-
-out:
-  return res;
-}
-
-/*---------------------------------------------------------------------------*/
-
-int amqp_table_entry_cmp(void const *entry1, void const *entry2) {
-  amqp_table_entry_t const *p1 = (amqp_table_entry_t const *)entry1;
-  amqp_table_entry_t const *p2 = (amqp_table_entry_t const *)entry2;
-
-  int d;
-  size_t minlen;
-
-  minlen = p1->key.len;
-  if (p2->key.len < minlen) {
-    minlen = p2->key.len;
-  }
-
-  d = memcmp(p1->key.bytes, p2->key.bytes, minlen);
-  if (d != 0) {
-    return d;
-  }
-
-  return (int)p1->key.len - (int)p2->key.len;
-}
-
-static int amqp_field_value_clone(const amqp_field_value_t *original,
-                                  amqp_field_value_t *clone,
-                                  amqp_pool_t *pool) {
-  int i;
-  int res;
-  clone->kind = original->kind;
-
-  switch (clone->kind) {
-    case AMQP_FIELD_KIND_BOOLEAN:
-      clone->value.boolean = original->value.boolean;
-      break;
-
-    case AMQP_FIELD_KIND_I8:
-      clone->value.i8 = original->value.i8;
-      break;
-
-    case AMQP_FIELD_KIND_U8:
-      clone->value.u8 = original->value.u8;
-      break;
-
-    case AMQP_FIELD_KIND_I16:
-      clone->value.i16 = original->value.i16;
-      break;
-
-    case AMQP_FIELD_KIND_U16:
-      clone->value.u16 = original->value.u16;
-      break;
-
-    case AMQP_FIELD_KIND_I32:
-      clone->value.i32 = original->value.i32;
-      break;
-
-    case AMQP_FIELD_KIND_U32:
-      clone->value.u32 = original->value.u32;
-      break;
-
-    case AMQP_FIELD_KIND_I64:
-      clone->value.i64 = original->value.i64;
-      break;
-
-    case AMQP_FIELD_KIND_U64:
-    case AMQP_FIELD_KIND_TIMESTAMP:
-      clone->value.u64 = original->value.u64;
-      break;
-
-    case AMQP_FIELD_KIND_F32:
-      clone->value.f32 = original->value.f32;
-      break;
-
-    case AMQP_FIELD_KIND_F64:
-      clone->value.f64 = original->value.f64;
-      break;
-
-    case AMQP_FIELD_KIND_DECIMAL:
-      clone->value.decimal = original->value.decimal;
-      break;
-
-    case AMQP_FIELD_KIND_UTF8:
-    case AMQP_FIELD_KIND_BYTES:
-      if (0 == original->value.bytes.len) {
-        clone->value.bytes = amqp_empty_bytes;
-      } else {
-        amqp_pool_alloc_bytes(pool, original->value.bytes.len,
-                              &clone->value.bytes);
-        if (NULL == clone->value.bytes.bytes) {
-          return AMQP_STATUS_NO_MEMORY;
-        }
-        memcpy(clone->value.bytes.bytes, original->value.bytes.bytes,
-               clone->value.bytes.len);
-      }
-      break;
-
-    case AMQP_FIELD_KIND_ARRAY:
-      if (0 == original->value.array.entries) {
-        clone->value.array = amqp_empty_array;
-      } else {
-        clone->value.array.num_entries = original->value.array.num_entries;
-        clone->value.array.entries = amqp_pool_alloc(
-            pool, clone->value.array.num_entries * sizeof(amqp_field_value_t));
-        if (NULL == clone->value.array.entries) {
-          return AMQP_STATUS_NO_MEMORY;
-        }
-
-        for (i = 0; i < clone->value.array.num_entries; ++i) {
-          res = amqp_field_value_clone(&original->value.array.entries[i],
-                                       &clone->value.array.entries[i], pool);
-          if (AMQP_STATUS_OK != res) {
-            return res;
-          }
-        }
-      }
-      break;
-
-    case AMQP_FIELD_KIND_TABLE:
-      return amqp_table_clone(&original->value.table, &clone->value.table,
-                              pool);
-
-    case AMQP_FIELD_KIND_VOID:
-      break;
-
-    default:
-      return AMQP_STATUS_INVALID_PARAMETER;
-  }
-
-  return AMQP_STATUS_OK;
-}
-
-static int amqp_table_entry_clone(const amqp_table_entry_t *original,
-                                  amqp_table_entry_t *clone,
-                                  amqp_pool_t *pool) {
-  if (0 == original->key.len) {
-    return AMQP_STATUS_INVALID_PARAMETER;
-  }
-
-  amqp_pool_alloc_bytes(pool, original->key.len, &clone->key);
-  if (NULL == clone->key.bytes) {
-    return AMQP_STATUS_NO_MEMORY;
-  }
-
-  memcpy(clone->key.bytes, original->key.bytes, clone->key.len);
-
-  return amqp_field_value_clone(&original->value, &clone->value, pool);
-}
-
-int amqp_table_clone(const amqp_table_t *original, amqp_table_t *clone,
-                     amqp_pool_t *pool) {
-  int i;
-  int res;
-  clone->num_entries = original->num_entries;
-  if (0 == clone->num_entries) {
-    *clone = amqp_empty_table;
-    return AMQP_STATUS_OK;
-  }
-
-  clone->entries =
-      amqp_pool_alloc(pool, clone->num_entries * sizeof(amqp_table_entry_t));
-
-  if (NULL == clone->entries) {
-    return AMQP_STATUS_NO_MEMORY;
-  }
-
-  for (i = 0; i < clone->num_entries; ++i) {
-    res =
-        amqp_table_entry_clone(&original->entries[i], &clone->entries[i], pool);
-    if (AMQP_STATUS_OK != res) {
-      goto error_out1;
-    }
-  }
-
-  return AMQP_STATUS_OK;
-
-error_out1:
-  return res;
-}
-
-amqp_table_entry_t amqp_table_construct_utf8_entry(const char *key,
-                                                   const char *value) {
-  amqp_table_entry_t ret;
-  ret.key = amqp_cstring_bytes(key);
-  ret.value.kind = AMQP_FIELD_KIND_UTF8;
-  ret.value.value.bytes = amqp_cstring_bytes(value);
-  return ret;
-}
-
-amqp_table_entry_t amqp_table_construct_table_entry(const char *key,
-                                                    const amqp_table_t *value) {
-  amqp_table_entry_t ret;
-  ret.key = amqp_cstring_bytes(key);
-  ret.value.kind = AMQP_FIELD_KIND_TABLE;
-  ret.value.value.table = *value;
-  return ret;
-}
-
-amqp_table_entry_t amqp_table_construct_bool_entry(const char *key,
-                                                   const int value) {
-  amqp_table_entry_t ret;
-  ret.key = amqp_cstring_bytes(key);
-  ret.value.kind = AMQP_FIELD_KIND_BOOLEAN;
-  ret.value.value.boolean = value;
-  return ret;
-}
-
-amqp_table_entry_t *amqp_table_get_entry_by_key(const amqp_table_t *table,
-                                                const amqp_bytes_t key) {
-  int i;
-  assert(table != NULL);
-  for (i = 0; i < table->num_entries; ++i) {
-    if (amqp_bytes_equal(table->entries[i].key, key)) {
-      return &table->entries[i];
-    }
-  }
-  return NULL;
-}

ext/librabbitmq/librabbitmq/amqp_table.h

@@ -1,81 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2014 Alan Antonuk.
- * All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-#ifndef AMQP_TABLE_H
-#define AMQP_TABLE_H
-
-#include "amqp.h"
-#include "amqp_private.h"
-
-/**
- * Initializes a table entry with utf-8 string type value.
- *
- * \param [in] key the table entry key. The string must remain valid for the
- * life of the resulting amqp_table_entry_t.
- * \param [in] value the string value. The string must remain valid for the life
- * of the resulting amqp_table_entry_t.
- * \returns An initialized table entry.
- */
-amqp_table_entry_t amqp_table_construct_utf8_entry(const char *key,
-                                                   const char *value);
-
-/**
- * Initializes a table entry with table type value.
- *
- * \param [in] key the table entry key. The string must remain value for the
- * life of the resulting amqp_table_entry_t.
- * \param [in] value the amqp_table_t value. The table must remain valid for the
- * life of the resulting amqp_table_entry_t.
- * \returns An initialized table entry.
- */
-amqp_table_entry_t amqp_table_construct_table_entry(const char *key,
-                                                    const amqp_table_t *value);
-
-/**
- * Initializes a table entry with boolean type value.
- *
- * \param [in] key the table entry key. The string must remain value for the
- * life of the resulting amqp_table_entry_t.
- * \param [in] value the boolean value. 0 means false, any other value is true.
- * \returns An initialized table entry.
- */
-amqp_table_entry_t amqp_table_construct_bool_entry(const char *key,
-                                                   const int value);
-
-/**
- * Searches a table for an entry with a matching key.
- *
- * \param [in] table the table to search.
- * \param [in] key the string to search with.
- * \returns a pointer to the table entry in the table if a matching key can be
- * found, NULL otherwise.
- */
-amqp_table_entry_t *amqp_table_get_entry_by_key(const amqp_table_t *table,
-                                                const amqp_bytes_t key);
-
-#endif /* AMQP_TABLE_H */

ext/librabbitmq/librabbitmq/amqp_tcp_socket.c

@@ -1,238 +0,0 @@
-/*
- * Copyright 2012-2013 Michael Steinert
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include "amqp_private.h"
-#include "amqp_tcp_socket.h"
-
-#include <errno.h>
-#if ((defined(_WIN32)) || (defined(__MINGW32__)) || (defined(__MINGW64__)))
-#ifndef WIN32_LEAN_AND_MEAN
-#define WIN32_LEAN_AND_MEAN
-#endif
-#include <winsock2.h>
-#else
-#include <netinet/in.h>
-#include <netinet/tcp.h>
-#include <sys/socket.h>
-#endif
-#include <stdio.h>
-#include <stdlib.h>
-
-struct amqp_tcp_socket_t {
-  const struct amqp_socket_class_t *klass;
-  int sockfd;
-  int internal_error;
-  int state;
-};
-
-static ssize_t amqp_tcp_socket_send(void *base, const void *buf, size_t len,
-                                    int flags) {
-  struct amqp_tcp_socket_t *self = (struct amqp_tcp_socket_t *)base;
-  ssize_t res;
-  int flagz = 0;
-
-  if (-1 == self->sockfd) {
-    return AMQP_STATUS_SOCKET_CLOSED;
-  }
-
-#ifdef MSG_NOSIGNAL
-  flagz |= MSG_NOSIGNAL;
-#endif
-
-#if defined(MSG_MORE)
-  if (flags & AMQP_SF_MORE) {
-    flagz |= MSG_MORE;
-  }
-/* Cygwin defines TCP_NOPUSH, but trying to use it will return not
- * implemented. Disable it here. */
-#elif defined(TCP_NOPUSH) && !defined(__CYGWIN__)
-  if (flags & AMQP_SF_MORE && !(self->state & AMQP_SF_MORE)) {
-    int one = 1;
-    res = setsockopt(self->sockfd, IPPROTO_TCP, TCP_NOPUSH, &one, sizeof(one));
-    if (0 != res) {
-      self->internal_error = res;
-      return AMQP_STATUS_SOCKET_ERROR;
-    }
-    self->state |= AMQP_SF_MORE;
-  } else if (!(flags & AMQP_SF_MORE) && self->state & AMQP_SF_MORE) {
-    int zero = 0;
-    res =
-        setsockopt(self->sockfd, IPPROTO_TCP, TCP_NOPUSH, &zero, sizeof(&zero));
-    if (0 != res) {
-      self->internal_error = res;
-      res = AMQP_STATUS_SOCKET_ERROR;
-    } else {
-      self->state &= ~AMQP_SF_MORE;
-    }
-  }
-#endif
-
-start:
-#ifdef _WIN32
-  res = send(self->sockfd, buf, (int)len, flagz);
-#else
-  res = send(self->sockfd, buf, len, flagz);
-#endif
-
-  if (res < 0) {
-    self->internal_error = amqp_os_socket_error();
-    switch (self->internal_error) {
-      case EINTR:
-        goto start;
-#ifdef _WIN32
-      case WSAEWOULDBLOCK:
-#else
-      case EWOULDBLOCK:
-#endif
-#if defined(EAGAIN) && EAGAIN != EWOULDBLOCK
-      case EAGAIN:
-#endif
-        res = AMQP_PRIVATE_STATUS_SOCKET_NEEDWRITE;
-        break;
-      default:
-        res = AMQP_STATUS_SOCKET_ERROR;
-    }
-  } else {
-    self->internal_error = 0;
-  }
-
-  return res;
-}
-
-static ssize_t amqp_tcp_socket_recv(void *base, void *buf, size_t len,
-                                    int flags) {
-  struct amqp_tcp_socket_t *self = (struct amqp_tcp_socket_t *)base;
-  ssize_t ret;
-  if (-1 == self->sockfd) {
-    return AMQP_STATUS_SOCKET_CLOSED;
-  }
-
-start:
-#ifdef _WIN32
-  ret = recv(self->sockfd, buf, (int)len, flags);
-#else
-  ret = recv(self->sockfd, buf, len, flags);
-#endif
-
-  if (0 > ret) {
-    self->internal_error = amqp_os_socket_error();
-    switch (self->internal_error) {
-      case EINTR:
-        goto start;
-#ifdef _WIN32
-      case WSAEWOULDBLOCK:
-#else
-      case EWOULDBLOCK:
-#endif
-#if defined(EAGAIN) && EAGAIN != EWOULDBLOCK
-      case EAGAIN:
-#endif
-        ret = AMQP_PRIVATE_STATUS_SOCKET_NEEDREAD;
-        break;
-      default:
-        ret = AMQP_STATUS_SOCKET_ERROR;
-    }
-  } else if (0 == ret) {
-    ret = AMQP_STATUS_CONNECTION_CLOSED;
-  }
-
-  return ret;
-}
-
-static int amqp_tcp_socket_open(void *base, const char *host, int port,
-                                struct timeval *timeout) {
-  struct amqp_tcp_socket_t *self = (struct amqp_tcp_socket_t *)base;
-  if (-1 != self->sockfd) {
-    return AMQP_STATUS_SOCKET_INUSE;
-  }
-  self->sockfd = amqp_open_socket_noblock(host, port, timeout);
-  if (0 > self->sockfd) {
-    int err = self->sockfd;
-    self->sockfd = -1;
-    return err;
-  }
-  return AMQP_STATUS_OK;
-}
-
-static int amqp_tcp_socket_close(void *base,
-                                 AMQP_UNUSED amqp_socket_close_enum force) {
-  struct amqp_tcp_socket_t *self = (struct amqp_tcp_socket_t *)base;
-  if (-1 == self->sockfd) {
-    return AMQP_STATUS_SOCKET_CLOSED;
-  }
-
-  if (amqp_os_socket_close(self->sockfd)) {
-    return AMQP_STATUS_SOCKET_ERROR;
-  }
-  self->sockfd = -1;
-
-  return AMQP_STATUS_OK;
-}
-
-static int amqp_tcp_socket_get_sockfd(void *base) {
-  struct amqp_tcp_socket_t *self = (struct amqp_tcp_socket_t *)base;
-  return self->sockfd;
-}
-
-static void amqp_tcp_socket_delete(void *base) {
-  struct amqp_tcp_socket_t *self = (struct amqp_tcp_socket_t *)base;
-
-  if (self) {
-    amqp_tcp_socket_close(self, AMQP_SC_NONE);
-    free(self);
-  }
-}
-
-static const struct amqp_socket_class_t amqp_tcp_socket_class = {
-    amqp_tcp_socket_send,       /* send */
-    amqp_tcp_socket_recv,       /* recv */
-    amqp_tcp_socket_open,       /* open */
-    amqp_tcp_socket_close,      /* close */
-    amqp_tcp_socket_get_sockfd, /* get_sockfd */
-    amqp_tcp_socket_delete      /* delete */
-};
-
-amqp_socket_t *amqp_tcp_socket_new(amqp_connection_state_t state) {
-  struct amqp_tcp_socket_t *self = calloc(1, sizeof(*self));
-  if (!self) {
-    return NULL;
-  }
-  self->klass = &amqp_tcp_socket_class;
-  self->sockfd = -1;
-
-  amqp_set_socket(state, (amqp_socket_t *)self);
-
-  return (amqp_socket_t *)self;
-}
-
-void amqp_tcp_socket_set_sockfd(amqp_socket_t *base, int sockfd) {
-  struct amqp_tcp_socket_t *self;
-  if (base->klass != &amqp_tcp_socket_class) {
-    amqp_abort("<%p> is not of type amqp_tcp_socket_t", base);
-  }
-  self = (struct amqp_tcp_socket_t *)base;
-  self->sockfd = sockfd;
-}

ext/librabbitmq/librabbitmq/amqp_tcp_socket.h

@@ -1,68 +0,0 @@
-/** \file */
-/*
- * Portions created by Alan Antonuk are Copyright (c) 2013-2014 Alan Antonuk.
- * All Rights Reserved.
- *
- * Portions created by Michael Steinert are Copyright (c) 2012-2013 Michael
- * Steinert. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-
-/**
- * A TCP socket connection.
- */
-
-#ifndef AMQP_TCP_SOCKET_H
-#define AMQP_TCP_SOCKET_H
-
-#include <amqp.h>
-
-AMQP_BEGIN_DECLS
-
-/**
- * Create a new TCP socket.
- *
- * Call amqp_connection_close() to release socket resources.
- *
- * \return A new socket object or NULL if an error occurred.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-amqp_socket_t *AMQP_CALL amqp_tcp_socket_new(amqp_connection_state_t state);
-
-/**
- * Assign an open file descriptor to a socket object.
- *
- * This function must not be used in conjunction with amqp_socket_open(), i.e.
- * the socket connection should already be open(2) when this function is
- * called.
- *
- * \param [in,out] self A TCP socket object.
- * \param [in] sockfd An open socket descriptor.
- *
- * \since v0.4.0
- */
-AMQP_PUBLIC_FUNCTION
-void AMQP_CALL amqp_tcp_socket_set_sockfd(amqp_socket_t *self, int sockfd);
-
-AMQP_END_DECLS
-
-#endif /* AMQP_TCP_SOCKET_H */

ext/librabbitmq/librabbitmq/amqp_time.c

@@ -1,265 +0,0 @@
-/*
- * Portions created by Alan Antonuk are Copyright (c) 2013-2014 Alan Antonuk.
- * All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-#include "amqp_time.h"
-#include "amqp.h"
-#include <assert.h>
-#include <limits.h>
-#include <string.h>
-
-#if (defined(_WIN32) || defined(__WIN32__) || defined(WIN32) || \
-     defined(__MINGW32__) || defined(__MINGW64__))
-#define AMQP_WIN_TIMER_API
-#elif (defined(machintosh) || defined(__APPLE__) || defined(__APPLE_CC__))
-#define AMQP_MAC_TIMER_API
-#else
-#define AMQP_POSIX_TIMER_API
-#endif
-
-#ifdef AMQP_WIN_TIMER_API
-#ifndef WIN32_LEAN_AND_MEAN
-#define WIN32_LEAN_AND_MEAN
-#endif
-#include <windows.h>
-
-uint64_t amqp_get_monotonic_timestamp(void) {
-  static double NS_PER_COUNT = 0;
-  LARGE_INTEGER perf_count;
-
-  if (0 == NS_PER_COUNT) {
-    LARGE_INTEGER perf_frequency;
-    if (!QueryPerformanceFrequency(&perf_frequency)) {
-      return 0;
-    }
-    NS_PER_COUNT = (double)AMQP_NS_PER_S / perf_frequency.QuadPart;
-  }
-
-  if (!QueryPerformanceCounter(&perf_count)) {
-    return 0;
-  }
-
-  return (uint64_t)(perf_count.QuadPart * NS_PER_COUNT);
-}
-#endif /* AMQP_WIN_TIMER_API */
-
-#ifdef AMQP_MAC_TIMER_API
-#include <mach/mach_time.h>
-
-uint64_t amqp_get_monotonic_timestamp(void) {
-  static mach_timebase_info_data_t s_timebase = {0, 0};
-  uint64_t timestamp;
-
-  timestamp = mach_absolute_time();
-
-  if (s_timebase.denom == 0) {
-    mach_timebase_info(&s_timebase);
-    if (0 == s_timebase.denom) {
-      return 0;
-    }
-  }
-
-  timestamp *= (uint64_t)s_timebase.numer;
-  timestamp /= (uint64_t)s_timebase.denom;
-
-  return timestamp;
-}
-#endif /* AMQP_MAC_TIMER_API */
-
-#ifdef AMQP_POSIX_TIMER_API
-#include <time.h>
-
-uint64_t amqp_get_monotonic_timestamp(void) {
-#ifdef __hpux
-  return (uint64_t)gethrtime();
-#else
-  struct timespec tp;
-  if (-1 == clock_gettime(CLOCK_MONOTONIC, &tp)) {
-    return 0;
-  }
-
-  return ((uint64_t)tp.tv_sec * AMQP_NS_PER_S + (uint64_t)tp.tv_nsec);
-#endif
-}
-#endif /* AMQP_POSIX_TIMER_API */
-
-int amqp_time_from_now(amqp_time_t *time, struct timeval *timeout) {
-  uint64_t now_ns;
-  uint64_t delta_ns;
-
-  assert(NULL != time);
-
-  if (NULL == timeout) {
-    *time = amqp_time_infinite();
-    return AMQP_STATUS_OK;
-  }
-  if (0 == timeout->tv_sec && 0 == timeout->tv_usec) {
-    *time = amqp_time_immediate();
-    return AMQP_STATUS_OK;
-  }
-
-  if (timeout->tv_sec < 0 || timeout->tv_usec < 0) {
-    return AMQP_STATUS_INVALID_PARAMETER;
-  }
-
-  delta_ns = (uint64_t)timeout->tv_sec * AMQP_NS_PER_S +
-             (uint64_t)timeout->tv_usec * AMQP_NS_PER_US;
-
-  now_ns = amqp_get_monotonic_timestamp();
-  if (0 == now_ns) {
-    return AMQP_STATUS_TIMER_FAILURE;
-  }
-
-  time->time_point_ns = now_ns + delta_ns;
-  if (now_ns > time->time_point_ns || delta_ns > time->time_point_ns) {
-    return AMQP_STATUS_INVALID_PARAMETER;
-  }
-
-  return AMQP_STATUS_OK;
-}
-
-int amqp_time_s_from_now(amqp_time_t *time, int seconds) {
-  uint64_t now_ns;
-  uint64_t delta_ns;
-  assert(NULL != time);
-
-  if (0 >= seconds) {
-    *time = amqp_time_infinite();
-    return AMQP_STATUS_OK;
-  }
-
-  now_ns = amqp_get_monotonic_timestamp();
-  if (0 == now_ns) {
-    return AMQP_STATUS_TIMER_FAILURE;
-  }
-
-  delta_ns = (uint64_t)seconds * AMQP_NS_PER_S;
-  time->time_point_ns = now_ns + delta_ns;
-  if (now_ns > time->time_point_ns || delta_ns > time->time_point_ns) {
-    return AMQP_STATUS_INVALID_PARAMETER;
-  }
-
-  return AMQP_STATUS_OK;
-}
-
-amqp_time_t amqp_time_immediate(void) {
-  amqp_time_t time;
-  time.time_point_ns = 0;
-  return time;
-}
-
-amqp_time_t amqp_time_infinite(void) {
-  amqp_time_t time;
-  time.time_point_ns = UINT64_MAX;
-  return time;
-}
-
-int amqp_time_ms_until(amqp_time_t time) {
-  uint64_t now_ns;
-  uint64_t delta_ns;
-  int left_ms;
-
-  if (UINT64_MAX == time.time_point_ns) {
-    return -1;
-  }
-  if (0 == time.time_point_ns) {
-    return 0;
-  }
-
-  now_ns = amqp_get_monotonic_timestamp();
-  if (0 == now_ns) {
-    return AMQP_STATUS_TIMER_FAILURE;
-  }
-
-  if (now_ns >= time.time_point_ns) {
-    return 0;
-  }
-
-  delta_ns = time.time_point_ns - now_ns;
-  left_ms = (int)(delta_ns / AMQP_NS_PER_MS);
-
-  return left_ms;
-}
-
-int amqp_time_tv_until(amqp_time_t time, struct timeval *in,
-                       struct timeval **out) {
-  uint64_t now_ns;
-  uint64_t delta_ns;
-
-  assert(in != NULL);
-  if (UINT64_MAX == time.time_point_ns) {
-    *out = NULL;
-    return AMQP_STATUS_OK;
-  }
-  if (0 == time.time_point_ns) {
-    in->tv_sec = 0;
-    in->tv_usec = 0;
-    *out = in;
-    return AMQP_STATUS_OK;
-  }
-
-  now_ns = amqp_get_monotonic_timestamp();
-  if (0 == now_ns) {
-    return AMQP_STATUS_TIMER_FAILURE;
-  }
-
-  if (now_ns >= time.time_point_ns) {
-    in->tv_sec = 0;
-    in->tv_usec = 0;
-    *out = in;
-    return AMQP_STATUS_OK;
-  }
-
-  delta_ns = time.time_point_ns - now_ns;
-  in->tv_sec = (int)(delta_ns / AMQP_NS_PER_S);
-  in->tv_usec = (int)((delta_ns % AMQP_NS_PER_S) / AMQP_NS_PER_US);
-  *out = in;
-
-  return AMQP_STATUS_OK;
-}
-
-int amqp_time_has_past(amqp_time_t time) {
-  uint64_t now_ns;
-  if (UINT64_MAX == time.time_point_ns) {
-    return AMQP_STATUS_OK;
-  }
-
-  now_ns = amqp_get_monotonic_timestamp();
-  if (0 == now_ns) {
-    return AMQP_STATUS_TIMER_FAILURE;
-  }
-
-  if (now_ns > time.time_point_ns) {
-    return AMQP_STATUS_TIMEOUT;
-  }
-  return AMQP_STATUS_OK;
-}
-
-amqp_time_t amqp_time_first(amqp_time_t l, amqp_time_t r) {
-  if (l.time_point_ns < r.time_point_ns) {
-    return l;
-  }
-  return r;
-}
-
-int amqp_time_equal(amqp_time_t l, amqp_time_t r) {
-  return l.time_point_ns == r.time_point_ns;
-}

ext/librabbitmq/librabbitmq/amqp_time.h

@@ -1,130 +0,0 @@
-/*
- * Portions created by Alan Antonuk are Copyright (c) 2013-2014 Alan Antonuk.
- * All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-#ifndef AMQP_TIMER_H
-#define AMQP_TIMER_H
-
-#include <stdint.h>
-
-#if ((defined(_WIN32)) || (defined(__MINGW32__)) || (defined(__MINGW64__)))
-#ifndef WINVER
-#define WINVER 0x0502
-#endif
-#ifndef WIN32_LEAN_AND_MEAN
-#define WIN32_LEAN_AND_MEAN
-#endif
-#include <winsock2.h>
-#else
-#include <sys/time.h>
-#endif
-
-#define AMQP_MS_PER_S 1000
-#define AMQP_US_PER_MS 1000
-#define AMQP_NS_PER_S 1000000000
-#define AMQP_NS_PER_MS 1000000
-#define AMQP_NS_PER_US 1000
-
-/* This represents a point in time in reference to a monotonic clock.
- *
- * The internal representation is ns, relative to the monotonic clock.
- *
- * There are two 'special' values:
- * - 0: means 'this instant', its meant for polls with a 0-timeout, or
- *   non-blocking option
- * - UINT64_MAX: means 'at infinity', its mean for polls with an infinite
- *   timeout
- */
-typedef struct amqp_time_t_ { uint64_t time_point_ns; } amqp_time_t;
-
-/* Gets a monotonic timestamp. This will return 0 if the underlying call to the
- * system fails.
- */
-uint64_t amqp_get_monotonic_timestamp(void);
-
-/* Get a amqp_time_t that is timeout from now.
- * If timeout is NULL, an amqp_time_infinite() is created.
- * If timeout = {0, 0}, an amqp_time_immediate() is created.
- *
- * Returns AMQP_STATUS_OK on success.
- * AMQP_STATUS_INVALID_PARAMETER if timeout is invalid
- * AMQP_STATUS_TIMER_FAILURE if the underlying call to get the current timestamp
- * fails.
- */
-int amqp_time_from_now(amqp_time_t *time, struct timeval *timeout);
-
-/* Get a amqp_time_t that is seconds from now.
- * If seconds <= 0, then amqp_time_infinite() is created.
- *
- * Returns AMQP_STATUS_OK on success.
- * AMQP_STATUS_TIMER_FAILURE if the underlying call to get the current timestamp
- * fails.
- */
-int amqp_time_s_from_now(amqp_time_t *time, int seconds);
-
-/* Create an immediate amqp_time_t */
-amqp_time_t amqp_time_immediate(void);
-
-/* Create an infinite amqp_time_t */
-amqp_time_t amqp_time_infinite(void);
-
-/* Gets the number of ms until the amqp_time_t, suitable for the timeout
- * parameter in poll().
- *
- * -1 will be returned for amqp_time_infinite values.
- * 0 will be returned for amqp_time_immediate values.
- * AMQP_STATUS_TIMEOUT will be returned if time was in the past.
- * AMQP_STATUS_TIMER_FAILURE will be returned if the underlying call to get the
- * current timestamp fails.
- */
-int amqp_time_ms_until(amqp_time_t time);
-
-/* Gets a timeval filled in with the time until amqp_time_t. Suitable for the
- * parameter in select().
- *
- * The in parameter specifies a storage location for *out.
- * If time is an inf timeout, then *out = NULL.
- * If time is a 0-timeout or the timer has expired, then *out = {0, 0}
- * Otherwise *out is set to the time left on the time.
- *
- * AMQP_STATUS_OK will be returned if successfully filled.
- * AMQP_STATUS_TIMER_FAILURE is returned when the underlying call to get the
- * current timestamp fails.
- */
-int amqp_time_tv_until(amqp_time_t time, struct timeval *in,
-                       struct timeval **out);
-
-/* Test whether current time is past the provided time.
- *
- * TODO: this isn't a great interface to use. Fix this.
- *
- * Return AMQP_STATUS_OK if time has not past
- * Return AMQP_STATUS_TIMEOUT if time has past
- * Return AMQP_STATUS_TIMER_FAILURE if the underlying call to get the current
- * timestamp fails.
- */
-int amqp_time_has_past(amqp_time_t time);
-
-/* Return the time value that happens first */
-amqp_time_t amqp_time_first(amqp_time_t l, amqp_time_t r);
-
-int amqp_time_equal(amqp_time_t l, amqp_time_t r);
-#endif /* AMQP_TIMER_H */

ext/librabbitmq/librabbitmq/amqp_url.c

@@ -1,220 +0,0 @@
-/*
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#ifdef _MSC_VER
-#define _CRT_SECURE_NO_WARNINGS
-#endif
-
-#include "amqp_private.h"
-#include <limits.h>
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-
-void amqp_default_connection_info(struct amqp_connection_info *ci) {
-  /* Apply defaults */
-  ci->user = "guest";
-  ci->password = "guest";
-  ci->host = "localhost";
-  ci->port = 5672;
-  ci->vhost = "/";
-  ci->ssl = 0;
-}
-
-/* Scan for the next delimiter, handling percent-encodings on the way. */
-static char find_delim(char **pp, int colon_and_at_sign_are_delims) {
-  char *from = *pp;
-  char *to = from;
-
-  for (;;) {
-    char ch = *from++;
-
-    switch (ch) {
-      case ':':
-      case '@':
-        if (!colon_and_at_sign_are_delims) {
-          *to++ = ch;
-          break;
-        }
-
-      /* fall through */
-      case 0:
-      case '/':
-      case '?':
-      case '#':
-      case '[':
-      case ']':
-        *to = 0;
-        *pp = from;
-        return ch;
-
-      case '%': {
-        unsigned int val;
-        int chars;
-        int res = sscanf(from, "%2x%n", &val, &chars);
-
-        if (res == EOF || res < 1 || chars != 2 || val > CHAR_MAX)
-        /* Return a surprising delimiter to
-           force an error. */
-        {
-          return '%';
-        }
-
-        *to++ = (char)val;
-        from += 2;
-        break;
-      }
-
-      default:
-        *to++ = ch;
-        break;
-    }
-  }
-}
-
-/* Parse an AMQP URL into its component parts. */
-int amqp_parse_url(char *url, struct amqp_connection_info *parsed) {
-  int res = AMQP_STATUS_BAD_URL;
-  char delim;
-  char *start;
-  char *host;
-  char *port = NULL;
-
-  amqp_default_connection_info(parsed);
-
-  /* check the prefix */
-  if (!strncmp(url, "amqp://", 7)) {
-    /* do nothing */
-  } else if (!strncmp(url, "amqps://", 8)) {
-    parsed->port = 5671;
-    parsed->ssl = 1;
-  } else {
-    goto out;
-  }
-
-  host = start = url += (parsed->ssl ? 8 : 7);
-  delim = find_delim(&url, 1);
-
-  if (delim == ':') {
-    /* The colon could be introducing the port or the
-       password part of the userinfo.  We don't know yet,
-       so stash the preceding component. */
-    port = start = url;
-    delim = find_delim(&url, 1);
-  }
-
-  if (delim == '@') {
-    /* What might have been the host and port were in fact
-       the username and password */
-    parsed->user = host;
-    if (port) {
-      parsed->password = port;
-    }
-
-    port = NULL;
-    host = start = url;
-    delim = find_delim(&url, 1);
-  }
-
-  if (delim == '[') {
-    /* IPv6 address.  The bracket should be the first
-       character in the host. */
-    if (host != start || *host != 0) {
-      goto out;
-    }
-
-    start = url;
-    delim = find_delim(&url, 0);
-
-    if (delim != ']') {
-      goto out;
-    }
-
-    parsed->host = start;
-    start = url;
-    delim = find_delim(&url, 1);
-
-    /* Closing bracket should be the last character in the
-       host. */
-    if (*start != 0) {
-      goto out;
-    }
-  } else {
-    /* If we haven't seen the host yet, this is it. */
-    if (*host != 0) {
-      parsed->host = host;
-    }
-  }
-
-  if (delim == ':') {
-    port = start = url;
-    delim = find_delim(&url, 1);
-  }
-
-  if (port) {
-    char *end;
-    long portnum = strtol(port, &end, 10);
-
-    if (port == end || *end != 0 || portnum < 0 || portnum > 65535) {
-      goto out;
-    }
-
-    parsed->port = portnum;
-  }
-
-  if (delim == '/') {
-    start = url;
-    delim = find_delim(&url, 1);
-
-    if (delim != 0) {
-      goto out;
-    }
-
-    parsed->vhost = start;
-    res = AMQP_STATUS_OK;
-  } else if (delim == 0) {
-    res = AMQP_STATUS_OK;
-  }
-
-/* Any other delimiter is bad, and we will return AMQP_STATUS_BAD_AMQP_URL. */
-
-out:
-  return res;
-}

ext/librabbitmq/librabbitmq/codegen.py

@@ -1,785 +0,0 @@
-# ***** BEGIN LICENSE BLOCK *****
-# Version: MIT
-#
-# Portions created by Alan Antonuk are Copyright (c) 2012-2013
-# Alan Antonuk. All Rights Reserved.
-#
-# Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
-# All Rights Reserved.
-#
-# Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
-# VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
-#
-# Permission is hereby granted, free of charge, to any person
-# obtaining a copy of this software and associated documentation
-# files (the "Software"), to deal in the Software without
-# restriction, including without limitation the rights to use, copy,
-# modify, merge, publish, distribute, sublicense, and/or sell copies
-# of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-#
-# The above copyright notice and this permission notice shall be
-# included in all copies or substantial portions of the Software.
-#
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
-# BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
-# ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
-# CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-# SOFTWARE.
-# ***** END LICENSE BLOCK *****
-
-from __future__ import nested_scopes
-from __future__ import division
-
-from amqp_codegen import *
-import string
-import re
-
-
-class Emitter(object):
-    """An object the trivially emits generated code lines.
-
-    This largely exists to be wrapped by more sophisticated emitter
-    classes.
-    """
-
-    def __init__(self, prefix):
-        self.prefix = prefix
-
-    def emit(self, line):
-        """Emit a line of generated code."""
-        print self.prefix + line
-
-
-class BitDecoder(object):
-    """An emitter object that keeps track of the state involved in
-    decoding the AMQP bit type."""
-
-    def __init__(self, emitter):
-        self.emitter = emitter
-        self.bit = 0
-
-    def emit(self, line):
-        self.bit = 0
-        self.emitter.emit(line)
-
-    def decode_bit(self, lvalue):
-        """Generate code to decode a value of the AMQP bit type into
-        the given lvalue."""
-        if self.bit == 0:
-            self.emitter.emit("if (!amqp_decode_8(encoded, &offset, &bit_buffer)) return AMQP_STATUS_BAD_AMQP_DATA;")
-
-        self.emitter.emit("%s = (bit_buffer & (1 << %d)) ? 1 : 0;"
-                                                        % (lvalue, self.bit))
-        self.bit += 1
-        if self.bit == 8:
-            self.bit = 0
-
-
-class BitEncoder(object):
-    """An emitter object that keeps track of the state involved in
-    encoding the AMQP bit type."""
-
-    def __init__(self, emitter):
-        self.emitter = emitter
-        self.bit = 0
-
-    def flush(self):
-        """Flush the state associated with AMQP bit types."""
-        if self.bit:
-            self.emitter.emit("if (!amqp_encode_8(encoded, &offset, bit_buffer)) return AMQP_STATUS_BAD_AMQP_DATA;")
-            self.bit = 0
-
-    def emit(self, line):
-        self.flush()
-        self.emitter.emit(line)
-
-    def encode_bit(self, value):
-        """Generate code to encode a value of the AMQP bit type from
-        the given value."""
-        if self.bit == 0:
-            self.emitter.emit("bit_buffer = 0;")
-
-        self.emitter.emit("if (%s) bit_buffer |= (1 << %d);"
-                                                       % (value, self.bit))
-        self.bit += 1
-        if self.bit == 8:
-            self.flush()
-
-
-class SimpleType(object):
-    """A AMQP type that corresponds to a simple scalar C value of a
-    certain width."""
-
-    def __init__(self, bits):
-        self.bits = bits
-        self.ctype = "uint%d_t" % (bits,)
-
-    def decode(self, emitter, lvalue):
-        emitter.emit("if (!amqp_decode_%d(encoded, &offset, &%s)) return AMQP_STATUS_BAD_AMQP_DATA;" % (self.bits, lvalue))
-
-    def encode(self, emitter, value):
-        emitter.emit("if (!amqp_encode_%d(encoded, &offset, %s)) return AMQP_STATUS_BAD_AMQP_DATA;" % (self.bits, value))
-
-    def literal(self, value):
-        return value
-
-class StrType(object):
-    """The AMQP shortstr or longstr types."""
-
-    def __init__(self, lenbits):
-        self.lenbits = lenbits
-        self.ctype = "amqp_bytes_t"
-
-    def decode(self, emitter, lvalue):
-        emitter.emit("{")
-        emitter.emit("  uint%d_t len;" % (self.lenbits,))
-        emitter.emit("  if (!amqp_decode_%d(encoded, &offset, &len)" % (self.lenbits,))
-        emitter.emit("      || !amqp_decode_bytes(encoded, &offset, &%s, len))" % (lvalue,))
-        emitter.emit("    return AMQP_STATUS_BAD_AMQP_DATA;")
-        emitter.emit("}")
-
-    def encode(self, emitter, value):
-        emitter.emit("if (UINT%d_MAX < %s.len" % (self.lenbits, value))
-        emitter.emit("    || !amqp_encode_%d(encoded, &offset, (uint%d_t)%s.len)" %
-                (self.lenbits, self.lenbits, value))
-        emitter.emit("    || !amqp_encode_bytes(encoded, &offset, %s))" % (value,))
-        emitter.emit("  return AMQP_STATUS_BAD_AMQP_DATA;")
-
-    def literal(self, value):
-        if value != '':
-            raise NotImplementedError()
-
-        return "amqp_empty_bytes"
-
-class BitType(object):
-    """The AMQP bit type."""
-
-    def __init__(self):
-        self.ctype = "amqp_boolean_t"
-
-    def decode(self, emitter, lvalue):
-        emitter.decode_bit(lvalue)
-
-    def encode(self, emitter, value):
-        emitter.encode_bit(value)
-
-    def literal(self, value):
-        return {True: 1, False: 0}[value]
-
-class TableType(object):
-    """The AMQP table type."""
-
-    def __init__(self):
-        self.ctype = "amqp_table_t"
-
-    def decode(self, emitter, lvalue):
-        emitter.emit("{")
-        emitter.emit("  int res = amqp_decode_table(encoded, pool, &(%s), &offset);" % (lvalue,))
-        emitter.emit("  if (res < 0) return res;")
-        emitter.emit("}")
-
-    def encode(self, emitter, value):
-        emitter.emit("{")
-        emitter.emit("  int res = amqp_encode_table(encoded, &(%s), &offset);" % (value,))
-        emitter.emit("  if (res < 0) return res;")
-        emitter.emit("}")
-
-    def literal(self, value):
-        raise NotImplementedError()
-
-types = {
-    'octet': SimpleType(8),
-    'short': SimpleType(16),
-    'long': SimpleType(32),
-    'longlong': SimpleType(64),
-    'shortstr': StrType(8),
-    'longstr': StrType(32),
-    'bit': BitType(),
-    'table': TableType(),
-    'timestamp': SimpleType(64),
-}
-
-def typeFor(spec, f):
-    """Get a representation of the AMQP type of a field."""
-    return types[spec.resolveDomain(f.domain)]
-
-def c_ize(s):
-    s = s.replace('-', '_')
-    s = s.replace(' ', '_')
-    return s
-
-# When generating API functions corresponding to synchronous methods,
-# we need some information that isn't in the protocol def: Some
-# methods should not be exposed, indicated here by a False value.
-# Some methods should be exposed but certain fields should not be
-# exposed as parameters.
-apiMethodInfo  = {
-    "amqp_connection_start": False, # application code should not use this
-    "amqp_connection_secure": False, # application code should not use this
-    "amqp_connection_tune": False, # application code should not use this
-    "amqp_connection_open": False, # application code should not use this
-    "amqp_connection_close": False, # needs special handling
-    "amqp_channel_open": ["out_of_band"],
-    "amqp_channel_close": False, # needs special handling
-    "amqp_access_request": False, # huh?
-    "amqp_basic_get": False, # get-ok has content
-}
-
-# When generating API functions corresponding to synchronous methods,
-# some fields should be suppressed everywhere.  This dict names those
-# fields, and the fixed values to use for them.
-apiMethodsSuppressArgs = {"ticket": 0, "nowait": False}
-
-AmqpMethod.defName = lambda m: cConstantName(c_ize(m.klass.name) + '_' + c_ize(m.name) + "_method")
-AmqpMethod.fullName = lambda m: "amqp_%s_%s" % (c_ize(m.klass.name), c_ize(m.name))
-AmqpMethod.structName = lambda m: m.fullName() + "_t"
-
-AmqpClass.structName = lambda c: "amqp_" + c_ize(c.name) + "_properties_t"
-
-def methodApiPrototype(m):
-    fn = m.fullName()
-    info = apiMethodInfo.get(fn, [])
-
-    docs = "/**\n * %s\n *\n" % (fn)
-    docs += " * @param [in] state connection state\n"
-    docs += " * @param [in] channel the channel to do the RPC on\n"
-
-    args = []
-    for f in m.arguments:
-        n = c_ize(f.name)
-        if n in apiMethodsSuppressArgs or n in info:
-            continue
-
-        args.append(", ")
-        args.append(typeFor(m.klass.spec, f).ctype)
-        args.append(" ")
-        args.append(n)
-        docs += " * @param [in] %s %s\n" % (n, n)
-
-    docs += " * @returns %s_ok_t\n" % (fn)
-    docs += " */\n"
-
-    return "%sAMQP_PUBLIC_FUNCTION\n%s_ok_t *\nAMQP_CALL %s(amqp_connection_state_t state, amqp_channel_t channel%s)" % (docs, fn, fn, ''.join(args))
-
-AmqpMethod.apiPrototype = methodApiPrototype
-
-def cConstantName(s):
-    return 'AMQP_' + '_'.join(re.split('[- ]', s.upper()))
-
-def cFlagName(c, f):
-    return cConstantName(c.name + '_' + f.name) + '_FLAG'
-
-def genErl(spec):
-    def fieldTempList(fields):
-        return '[' + ', '.join(['F' + str(f.index) for f in fields]) + ']'
-
-    def fieldMapList(fields):
-        return ', '.join([c_ize(f.name) + " = F" + str(f.index) for f in fields])
-
-    def genLookupMethodName(m):
-        print '    case %s: return "%s";' % (m.defName(), m.defName())
-
-    def genDecodeMethodFields(m):
-        print "    case %s: {" % (m.defName(),)
-        print "      %s *m = (%s *) amqp_pool_alloc(pool, sizeof(%s));" % \
-            (m.structName(), m.structName(), m.structName())
-        print "      if (m == NULL) { return AMQP_STATUS_NO_MEMORY; }"
-
-        emitter = BitDecoder(Emitter("      "))
-        for f in m.arguments:
-            typeFor(spec, f).decode(emitter, "m->"+c_ize(f.name))
-
-        print "      *decoded = m;"
-        print "      return 0;"
-        print "    }"
-
-    def genDecodeProperties(c):
-        print "    case %d: {" % (c.index,)
-        print "      %s *p = (%s *) amqp_pool_alloc(pool, sizeof(%s));" % \
-              (c.structName(), c.structName(), c.structName())
-        print "      if (p == NULL) { return AMQP_STATUS_NO_MEMORY; }"
-        print "      p->_flags = flags;"
-
-        emitter = Emitter("      ")
-        for f in c.fields:
-            emitter.emit("if (flags & %s) {" % (cFlagName(c, f),))
-            typeFor(spec, f).decode(emitter, "p->"+c_ize(f.name))
-            emitter.emit("}")
-
-        print "      *decoded = p;"
-        print "      return 0;"
-        print "    }"
-
-    def genEncodeMethodFields(m):
-        print "    case %s: {" % (m.defName(),)
-        if m.arguments:
-            print "      %s *m = (%s *) decoded;" % (m.structName(), m.structName())
-
-        emitter = BitEncoder(Emitter("      "))
-        for f in m.arguments:
-            typeFor(spec, f).encode(emitter, "m->"+c_ize(f.name))
-        emitter.flush()
-
-        print "      return (int)offset;"
-        print "    }"
-
-    def genEncodeProperties(c):
-        print "    case %d: {" % (c.index,)
-        if c.fields:
-            print "      %s *p = (%s *) decoded;" % (c.structName(), c.structName())
-
-        emitter = Emitter("      ")
-        for f in c.fields:
-            emitter.emit("      if (flags & %s) {" % (cFlagName(c, f),))
-            typeFor(spec, f).encode(emitter, "p->"+c_ize(f.name))
-            emitter.emit("}")
-
-        print "      return (int)offset;"
-        print "    }"
-
-    methods = spec.allMethods()
-
-    print """/* Generated code. Do not edit. Edit and re-run codegen.py instead.
- *
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include "amqp_private.h"
-#include <stdint.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <string.h>
-"""
-
-    print """
-char const *amqp_constant_name(int constantNumber) {
-  switch (constantNumber) {"""
-    for (c,v,cls) in spec.constants:
-        print "    case %s: return \"%s\";" % (cConstantName(c), cConstantName(c))
-    print """    default: return "(unknown)";
-  }
-}"""
-
-    print """
-amqp_boolean_t amqp_constant_is_hard_error(int constantNumber) {
-  switch (constantNumber) {"""
-    for (c,v,cls) in spec.constants:
-        if cls == 'hard-error':
-            print "    case %s: return 1;" % (cConstantName(c),)
-    print """    default: return 0;
-  }
-}"""
-
-    print """
-char const *amqp_method_name(amqp_method_number_t methodNumber) {
-  switch (methodNumber) {"""
-    for m in methods: genLookupMethodName(m)
-    print """    default: return NULL;
-  }
-}"""
-
-    print """
-amqp_boolean_t amqp_method_has_content(amqp_method_number_t methodNumber) {
-  switch (methodNumber) {"""
-    for m in methods:
-        if m.hasContent:
-            print '    case %s: return 1;' % (m.defName())
-    print """    default: return 0;
-  }
-}"""
-
-    print """
-int amqp_decode_method(amqp_method_number_t methodNumber,
-                       amqp_pool_t *pool,
-                       amqp_bytes_t encoded,
-                       void **decoded)
-{
-  size_t offset = 0;
-  uint8_t bit_buffer;
-
-  switch (methodNumber) {"""
-    for m in methods: genDecodeMethodFields(m)
-    print """    default: return AMQP_STATUS_UNKNOWN_METHOD;
-  }
-}"""
-
-    print """
-int amqp_decode_properties(uint16_t class_id,
-                           amqp_pool_t *pool,
-                           amqp_bytes_t encoded,
-                           void **decoded)
-{
-  size_t offset = 0;
-
-  amqp_flags_t flags = 0;
-  int flagword_index = 0;
-  uint16_t partial_flags;
-
-  do {
-    if (!amqp_decode_16(encoded, &offset, &partial_flags))
-      return AMQP_STATUS_BAD_AMQP_DATA;
-    flags |= (partial_flags << (flagword_index * 16));
-    flagword_index++;
-  } while (partial_flags & 1);
-
-  switch (class_id) {"""
-    for c in spec.allClasses(): genDecodeProperties(c)
-    print """    default: return AMQP_STATUS_UNKNOWN_CLASS;
-  }
-}"""
-
-    print """
-int amqp_encode_method(amqp_method_number_t methodNumber,
-                       void *decoded,
-                       amqp_bytes_t encoded)
-{
-  size_t offset = 0;
-  uint8_t bit_buffer;
-
-  switch (methodNumber) {"""
-    for m in methods: genEncodeMethodFields(m)
-    print """    default: return AMQP_STATUS_UNKNOWN_METHOD;
-  }
-}"""
-
-    print """
-int amqp_encode_properties(uint16_t class_id,
-                           void *decoded,
-                           amqp_bytes_t encoded)
-{
-  size_t offset = 0;
-
-  /* Cheat, and get the flags out generically, relying on the
-     similarity of structure between classes */
-  amqp_flags_t flags = * (amqp_flags_t *) decoded; /* cheating! */
-
-  {
-    /* We take a copy of flags to avoid destroying it, as it is used
-       in the autogenerated code below. */
-    amqp_flags_t remaining_flags = flags;
-    do {
-      amqp_flags_t remainder = remaining_flags >> 16;
-      uint16_t partial_flags = remaining_flags & 0xFFFE;
-      if (remainder != 0) { partial_flags |= 1; }
-      if (!amqp_encode_16(encoded, &offset, partial_flags))
-        return AMQP_STATUS_BAD_AMQP_DATA;
-      remaining_flags = remainder;
-    } while (remaining_flags != 0);
-  }
-
-  switch (class_id) {"""
-    for c in spec.allClasses(): genEncodeProperties(c)
-    print """    default: return AMQP_STATUS_UNKNOWN_CLASS;
-  }
-}"""
-
-    for m in methods:
-        if not m.isSynchronous:
-            continue
-
-        info = apiMethodInfo.get(m.fullName(), [])
-        if info is False:
-            continue
-
-        print
-        print m.apiPrototype()
-        print "{"
-        print "  %s req;" % (m.structName(),)
-
-        for f in m.arguments:
-            n = c_ize(f.name)
-
-            val = apiMethodsSuppressArgs.get(n)
-            if val is None and n in info:
-                val = f.defaultvalue
-
-            if val is None:
-                val = n
-            else:
-                val = typeFor(spec, f).literal(val)
-
-
-            print "  req.%s = %s;" % (n, val)
-
-        reply = cConstantName(c_ize(m.klass.name) + '_' + c_ize(m.name)
-                              + "_ok_method")
-        print """
-  return amqp_simple_rpc_decoded(state, channel, %s, %s, &req);
-}
-""" % (m.defName(), reply)
-
-def genHrl(spec):
-    def fieldDeclList(fields):
-        if fields:
-            return ''.join(["  %s %s; /**< %s */\n" % (typeFor(spec, f).ctype,
-                                            c_ize(f.name), f.name)
-                            for f in fields])
-        else:
-            return "  char dummy; /**< Dummy field to avoid empty struct */\n"
-
-    def propDeclList(fields):
-        return ''.join(["  %s %s;\n" % (typeFor(spec, f).ctype, c_ize(f.name))
-                        for f in fields
-                        if spec.resolveDomain(f.domain) != 'bit'])
-
-    methods = spec.allMethods()
-
-    print """/* Generated code. Do not edit. Edit and re-run codegen.py instead.
- *
- * ***** BEGIN LICENSE BLOCK *****
- * Version: MIT
- *
- * Portions created by Alan Antonuk are Copyright (c) 2012-2013
- * Alan Antonuk. All Rights Reserved.
- *
- * Portions created by VMware are Copyright (c) 2007-2012 VMware, Inc.
- * All Rights Reserved.
- *
- * Portions created by Tony Garnock-Jones are Copyright (c) 2009-2010
- * VMware, Inc. and Tony Garnock-Jones. All Rights Reserved.
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
- * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
- * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- * ***** END LICENSE BLOCK *****
- */
-
-/** @file amqp_framing.h */
-#ifndef AMQP_FRAMING_H
-#define AMQP_FRAMING_H
-
-#include <amqp.h>
-
-AMQP_BEGIN_DECLS
-"""
-    print "#define AMQP_PROTOCOL_VERSION_MAJOR %d     /**< AMQP protocol version major */" % (spec.major)
-    print "#define AMQP_PROTOCOL_VERSION_MINOR %d     /**< AMQP protocol version minor */" % (spec.minor)
-    print "#define AMQP_PROTOCOL_VERSION_REVISION %d  /**< AMQP protocol version revision */" % (spec.revision)
-    print "#define AMQP_PROTOCOL_PORT %d              /**< Default AMQP Port */" % (spec.port)
-
-    for (c,v,cls) in spec.constants:
-        print "#define %s %s  /**< Constant: %s */" % (cConstantName(c), v, c)
-    print
-
-    print """/* Function prototypes. */
-
-/**
- * Get constant name string from constant
- *
- * @param [in] constantNumber constant to get the name of
- * @returns string describing the constant. String is managed by
- *           the library and should not be free()'d by the program
- */
-AMQP_PUBLIC_FUNCTION
-char const *
-AMQP_CALL amqp_constant_name(int constantNumber);
-
-/**
- * Checks to see if a constant is a hard error
- *
- * A hard error occurs when something severe enough
- * happens that the connection must be closed.
- *
- * @param [in] constantNumber the error constant
- * @returns true if its a hard error, false otherwise
- */
-AMQP_PUBLIC_FUNCTION
-amqp_boolean_t
-AMQP_CALL amqp_constant_is_hard_error(int constantNumber);
-
-/**
- * Get method name string from method number
- *
- * @param [in] methodNumber the method number
- * @returns method name string. String is managed by the library
- *           and should not be freed()'d by the program
- */
-AMQP_PUBLIC_FUNCTION
-char const *
-AMQP_CALL amqp_method_name(amqp_method_number_t methodNumber);
-
-/**
- * Check whether a method has content
- *
- * A method that has content will receive the method frame
- * a properties frame, then 1 to N body frames
- *
- * @param [in] methodNumber the method number
- * @returns true if method has content, false otherwise
- */
-AMQP_PUBLIC_FUNCTION
-amqp_boolean_t
-AMQP_CALL amqp_method_has_content(amqp_method_number_t methodNumber);
-
-/**
- * Decodes a method from AMQP wireformat
- *
- * @param [in] methodNumber the method number for the decoded parameter
- * @param [in] pool the memory pool to allocate the decoded method from
- * @param [in] encoded the encoded byte string buffer
- * @param [out] decoded pointer to the decoded method struct
- * @returns 0 on success, an error code otherwise
- */
-AMQP_PUBLIC_FUNCTION
-int
-AMQP_CALL amqp_decode_method(amqp_method_number_t methodNumber,
-		   amqp_pool_t *pool,
-		   amqp_bytes_t encoded,
-		   void **decoded);
-
-/**
- * Decodes a header frame properties structure from AMQP wireformat
- *
- * @param [in] class_id the class id for the decoded parameter
- * @param [in] pool the memory pool to allocate the decoded properties from
- * @param [in] encoded the encoded byte string buffer
- * @param [out] decoded pointer to the decoded properties struct
- * @returns 0 on success, an error code otherwise
- */
-AMQP_PUBLIC_FUNCTION
-int
-AMQP_CALL amqp_decode_properties(uint16_t class_id,
-            amqp_pool_t *pool,
-            amqp_bytes_t encoded,
-            void **decoded);
-
-/**
- * Encodes a method structure in AMQP wireformat
- *
- * @param [in] methodNumber the method number for the decoded parameter
- * @param [in] decoded the method structure (e.g., amqp_connection_start_t)
- * @param [in] encoded an allocated byte buffer for the encoded method
- *              structure to be written to. If the buffer isn't large enough
- *              to hold the encoded method, an error code will be returned.
- * @returns 0 on success, an error code otherwise.
- */
-AMQP_PUBLIC_FUNCTION
-int
-AMQP_CALL amqp_encode_method(amqp_method_number_t methodNumber,
-		   void *decoded,
-		   amqp_bytes_t encoded);
-
-/**
- * Encodes a properties structure in AMQP wireformat
- *
- * @param [in] class_id the class id for the decoded parameter
- * @param [in] decoded the properties structure (e.g., amqp_basic_properties_t)
- * @param [in] encoded an allocated byte buffer for the encoded properties to written to.
- *              If the buffer isn't large enough to hold the encoded method, an
- *              an error code will be returned
- * @returns 0 on success, an error code otherwise.
- */
-AMQP_PUBLIC_FUNCTION
-int
-AMQP_CALL amqp_encode_properties(uint16_t class_id,
-		       void *decoded,
-		       amqp_bytes_t encoded);
-"""
-
-    print "/* Method field records. */\n"
-    for m in methods:
-        methodid = m.klass.index << 16 | m.index
-        print "#define %s ((amqp_method_number_t) 0x%.08X) /**< %s.%s method id @internal %d, %d; %d */" % \
-              (m.defName(),
-               methodid,
-               m.klass.name,
-               m.name,
-               m.klass.index,
-               m.index,
-               methodid)
-        print "/** %s.%s method fields */\ntypedef struct %s_ {\n%s} %s;\n" % \
-              (m.klass.name, m.name, m.structName(), fieldDeclList(m.arguments), m.structName())
-
-    print "/* Class property records. */"
-    for c in spec.allClasses():
-        print "#define %s (0x%.04X) /**< %s class id @internal %d */" % \
-              (cConstantName(c.name + "_class"), c.index, c.name, c.index)
-        index = 0
-        for f in c.fields:
-            if index % 16 == 15:
-                index = index + 1
-            shortnum = index // 16
-            partialindex = 15 - (index % 16)
-            bitindex = shortnum * 16 + partialindex
-            print '#define %s (1 << %d) /**< %s.%s property flag */' % (cFlagName(c, f), bitindex, c.name, f.name)
-            index = index + 1
-        print "/** %s class properties */\ntypedef struct %s_ {\n  amqp_flags_t _flags; /**< bit-mask of set fields */\n%s} %s;\n" % \
-              (c.name,
-               c.structName(),
-               fieldDeclList(c.fields),
-               c.structName())
-
-    print "/* API functions for methods */\n"
-
-    for m in methods:
-        if m.isSynchronous and apiMethodInfo.get(m.fullName()) is not False:
-            print "%s;" % (m.apiPrototype(),)
-
-    print """
-AMQP_END_DECLS
-
-#endif /* AMQP_FRAMING_H */"""
-
-def generateErl(specPath):
-    genErl(AmqpSpec(specPath))
-
-def generateHrl(specPath):
-    genHrl(AmqpSpec(specPath))
-
-if __name__ == "__main__":
-    do_main(generateHrl, generateErl)