LCOM1920-T02G10

/*	$NetBSD: if_altq.h,v 1.14 2014/07/01 10:16:02 ozaki-r Exp $	*/

/*	$KAME: if_altq.h,v 1.12 2005/04/13 03:44:25 suz Exp $	*/

/*

 * Copyright (C) 1997-2003

 *	Sony Computer Science Laboratories Inc.  All rights reserved.

 *

 * 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 above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. 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.

 *

 * THIS SOFTWARE IS PROVIDED BY SONY CSL 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 SONY CSL 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.

 */

#ifndef _ALTQ_IF_ALTQ_H_

#define	_ALTQ_IF_ALTQ_H_

#if defined(_KERNEL_OPT)

#include "opt_altq_enabled.h"

#endif

struct altq_pktattr; struct tb_regulator; struct top_cdnr;

/*

 * Structure defining a queue for a network interface.

 */

struct	ifaltq {

	/* fields compatible with struct ifqueue */

	struct	mbuf *ifq_head;

	struct	mbuf *ifq_tail;

	int	ifq_len;

	int	ifq_maxlen;

	int	ifq_drops;

	kmutex_t	*ifq_lock;

	/* alternate queueing related fields */

	int	altq_type;		/* discipline type */

	int	altq_flags;		/* flags (e.g. ready, in-use) */

	void	*altq_disc;		/* for discipline-specific use */

	struct	ifnet *altq_ifp;	/* back pointer to interface */

	int	(*altq_enqueue)(struct ifaltq *, struct mbuf *,

				struct altq_pktattr *);

	struct	mbuf *(*altq_dequeue)(struct ifaltq *, int);

	int	(*altq_request)(struct ifaltq *, int, void *);

	/* classifier fields */

	void	*altq_clfier;		/* classifier-specific use */

	void	*(*altq_classify)(void *, struct mbuf *, int);

	/* token bucket regulator */

	struct	tb_regulator *altq_tbr;

	/* input traffic conditioner (doesn't belong to the output queue...) */

	struct top_cdnr *altq_cdnr;

};

#ifdef _KERNEL

/*

 * packet attributes used by queueing disciplines.

 * pattr_class is a discipline-dependent scheduling class that is

 * set by a classifier.

 * pattr_hdr and pattr_af may be used by a discipline to access

 * the header within a mbuf.  (e.g. ECN needs to update the CE bit)

 * note that pattr_hdr could be stale after m_pullup, though link

 * layer output routines usually don't use m_pullup.  link-level

 * compression also invalidates these fields.  thus, pattr_hdr needs

 * to be verified when a discipline touches the header.

 */

struct altq_pktattr {

	void	*pattr_class;		/* sched class set by classifier */

	int	pattr_af;		/* address family */

	void *	pattr_hdr;		/* saved header position in mbuf */

};

/*

 * mbuf tag to carry a queue id (and hints for ECN).

 */

struct altq_tag {

	u_int32_t	qid;		/* queue id */

	/* hints for ecn */

	int		af;		/* address family */

	void		*hdr;		/* saved header position in mbuf */

};

/*

 * a token-bucket regulator limits the rate that a network driver can

 * dequeue packets from the output queue.

 * modern cards are able to buffer a large amount of packets and dequeue

 * too many packets at a time.  this bursty dequeue behavior makes it

 * impossible to schedule packets by queueing disciplines.

 * a token-bucket is used to control the burst size in a device

 * independent manner.

 */

struct tb_regulator {

	int64_t		tbr_rate;	/* (scaled) token bucket rate */

	int64_t		tbr_depth;	/* (scaled) token bucket depth */

	int64_t		tbr_token;	/* (scaled) current token */

	int64_t		tbr_filluptime;	/* (scaled) time to fill up bucket */

	u_int64_t	tbr_last;	/* last time token was updated */

	int		tbr_lastop;	/* last dequeue operation type

					   needed for poll-and-dequeue */

};

/* if_altqflags */

#define	ALTQF_READY	 0x01	/* driver supports alternate queueing */

#define	ALTQF_ENABLED	 0x02	/* altq is in use */

#define	ALTQF_CLASSIFY	 0x04	/* classify packets */

#define	ALTQF_CNDTNING	 0x08	/* altq traffic conditioning is enabled */

#define	ALTQF_DRIVER1	 0x40	/* driver specific */

/* if_altqflags set internally only: */

#define	ALTQF_CANTCHANGE 	(ALTQF_READY)

/* altq_dequeue 2nd arg */

#define	ALTDQ_REMOVE		1	/* dequeue mbuf from the queue */

#define	ALTDQ_POLL		2	/* don't dequeue mbuf from the queue */

/* altq request types (currently only purge is defined) */

#define	ALTRQ_PURGE		1	/* purge all packets */

#define	ALTQ_IS_READY(ifq)		((ifq)->altq_flags & ALTQF_READY)

#define	ALTQ_IS_ENABLED(ifq)		((ifq)->altq_flags & ALTQF_ENABLED)

#define	ALTQ_NEEDS_CLASSIFY(ifq)	((ifq)->altq_flags & ALTQF_CLASSIFY)

#define	ALTQ_IS_CNDTNING(ifq)		((ifq)->altq_flags & ALTQF_CNDTNING)

#define	ALTQ_SET_CNDTNING(ifq)		((ifq)->altq_flags |= ALTQF_CNDTNING)

#define	ALTQ_CLEAR_CNDTNING(ifq)	((ifq)->altq_flags &= ~ALTQF_CNDTNING)

#define	ALTQ_IS_ATTACHED(ifq)		((ifq)->altq_disc != NULL)

#define	ALTQ_ENQUEUE(ifq, m, pa, err)					\

	(err) = (*(ifq)->altq_enqueue)((ifq),(m),(pa))

#define	ALTQ_DEQUEUE(ifq, m)						\

	(m) = (*(ifq)->altq_dequeue)((ifq), ALTDQ_REMOVE)

#define	ALTQ_POLL(ifq, m)						\

	(m) = (*(ifq)->altq_dequeue)((ifq), ALTDQ_POLL)

#define	ALTQ_PURGE(ifq)							\

	(void)(*(ifq)->altq_request)((ifq), ALTRQ_PURGE, (void *)0)

#define	ALTQ_IS_EMPTY(ifq)		((ifq)->ifq_len == 0)

#define	TBR_IS_ENABLED(ifq)		((ifq)->altq_tbr != NULL)

extern int altq_attach(struct ifaltq *, int, void *,

		       int (*)(struct ifaltq *, struct mbuf *,

			       struct altq_pktattr *),

		       struct mbuf *(*)(struct ifaltq *, int),

		       int (*)(struct ifaltq *, int, void *),

		       void *,

		       void *(*)(void *, struct mbuf *, int));

extern int altq_detach(struct ifaltq *);

extern int altq_enable(struct ifaltq *);

extern int altq_disable(struct ifaltq *);

extern struct mbuf *tbr_dequeue(struct ifaltq *, int);

extern int (*altq_input)(struct mbuf *, int);

#if 1 /* ALTQ3_CLFIER_COMPAT */

void altq_etherclassify(struct ifaltq *, struct mbuf *, struct altq_pktattr *);

#endif

#endif /* _KERNEL */

#endif /* _ALTQ_IF_ALTQ_H_ */

// -*- C++ -*-

//===------------------------------ chrono ---------------------------------===//

//

//                     The LLVM Compiler Infrastructure

//

// This file is distributed under the University of Illinois Open Source

// License. See LICENSE.TXT for details.

//

//===----------------------------------------------------------------------===//

#ifndef _LIBCPP_EXPERIMENTAL_CHRONO

#define _LIBCPP_EXPERIMENTAL_CHRONO

/**

    experimental/chrono synopsis

// C++1y

#include <chrono>

namespace std {

namespace chrono {

namespace experimental {

inline namespace fundamentals_v1 {

  // See C++14 20.12.4, customization traits

  template <class Rep> constexpr bool treat_as_floating_point_v

    = treat_as_floating_point<Rep>::value;

} // namespace fundamentals_v1

} // namespace experimental

} // namespace chrono

} // namespace std

 */

#include <experimental/__config>

#include <chrono>

#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)

#pragma GCC system_header

#endif

#if _LIBCPP_STD_VER > 11

_LIBCPP_BEGIN_NAMESPACE_CHRONO_LFTS

#ifndef _LIBCPP_HAS_NO_VARIABLE_TEMPLATES

template <class _Rep> _LIBCPP_CONSTEXPR bool treat_as_floating_point_v

    = treat_as_floating_point<_Rep>::value;

#endif /* _LIBCPP_HAS_NO_VARIABLE_TEMPLATES */

_LIBCPP_END_NAMESPACE_CHRONO_LFTS

#endif /* _LIBCPP_STD_VER > 11 */

#endif /* _LIBCPP_EXPERIMENTAL_CHRONO */

// -*- C++ -*-

//===------------------------- hash_set ------------------------------------===//

//

//                     The LLVM Compiler Infrastructure

//

// This file is dual licensed under the MIT and the University of Illinois Open

// Source Licenses. See LICENSE.TXT for details.

//

//===----------------------------------------------------------------------===//

#ifndef _LIBCPP_EXT_HASH

#define _LIBCPP_EXT_HASH

#pragma GCC system_header

#include <string>

#include <cstring>

namespace __gnu_cxx {

using namespace std;

template <typename _Tp> struct _LIBCPP_TYPE_VIS_ONLY hash { };

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<const char*>

    : public unary_function<const char*, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(const char *__c) const _NOEXCEPT

    {

        return __do_string_hash(__c, __c + strlen(__c));

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<char *>

    : public unary_function<char*, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(char *__c) const _NOEXCEPT

    {

        return __do_string_hash<const char *>(__c, __c + strlen(__c));

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<char>

    : public unary_function<char, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(char __c) const _NOEXCEPT

    {

        return __c;

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<signed char>

    : public unary_function<signed char, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(signed char __c) const _NOEXCEPT

    {

        return __c;

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<unsigned char>

    : public unary_function<unsigned char, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(unsigned char __c) const _NOEXCEPT

    {

        return __c;

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<short>

    : public unary_function<short, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(short __c) const _NOEXCEPT

    {

        return __c;

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<unsigned short>

    : public unary_function<unsigned short, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(unsigned short __c) const _NOEXCEPT

    {

        return __c;

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<int>

    : public unary_function<int, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(int __c) const _NOEXCEPT

    {

        return __c;

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<unsigned int>

    : public unary_function<unsigned int, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(unsigned int __c) const _NOEXCEPT

    {

        return __c;

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<long>

    : public unary_function<long, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(long __c) const _NOEXCEPT

    {

        return __c;

    }

};

template <> struct _LIBCPP_TYPE_VIS_ONLY hash<unsigned long>

    : public unary_function<unsigned long, size_t>

{

    _LIBCPP_INLINE_VISIBILITY

    size_t operator()(unsigned long __c) const _NOEXCEPT

    {

        return __c;

    }

};

}

#endif  // _LIBCPP_EXT_HASH

/*	$NetBSD: ftp.h,v 1.6 2003/08/07 09:44:12 agc Exp $	*/

/*

 * Copyright (c) 1983, 1989, 1993

 *	The Regents of the University of California.  All rights reserved.

 *

 * 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 above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. 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.

 * 3. Neither the name of the University nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.

 *

 *	@(#)ftp.h	8.1 (Berkeley) 6/2/93

 */

#ifndef _ARPA_FTP_H_

#define	_ARPA_FTP_H_

/* Definitions for FTP; see RFC-765. */

/*

 * Reply codes.

 */

#define PRELIM		1	/* positive preliminary */

#define COMPLETE	2	/* positive completion */

#define CONTINUE	3	/* positive intermediate */

#define TRANSIENT	4	/* transient negative completion */

#define ERROR		5	/* permanent negative completion */

/*

 * Type codes

 */

#define	TYPE_A		1	/* ASCII */

#define	TYPE_E		2	/* EBCDIC */

#define	TYPE_I		3	/* image */

#define	TYPE_L		4	/* local byte size */

#ifdef FTP_NAMES

char *typenames[] =  {"0", "ASCII", "EBCDIC", "Image", "Local" };

#endif

/*

 * Form codes

 */

#define	FORM_N		1	/* non-print */

#define	FORM_T		2	/* telnet format effectors */

#define	FORM_C		3	/* carriage control (ASA) */

#ifdef FTP_NAMES

char *formnames[] =  {"0", "Nonprint", "Telnet", "Carriage-control" };

#endif

/*

 * Structure codes

 */

#define	STRU_F		1	/* file (no record structure) */

#define	STRU_R		2	/* record structure */

#define	STRU_P		3	/* page structure */

#ifdef FTP_NAMES

char *strunames[] =  {"0", "File", "Record", "Page" };

#endif

/*

 * Mode types

 */

#define	MODE_S		1	/* stream */

#define	MODE_B		2	/* block */

#define	MODE_C		3	/* compressed */

#ifdef FTP_NAMES

char *modenames[] =  {"0", "Stream", "Block", "Compressed" };

#endif

/*

 * Record Tokens

 */

#define	REC_ESC		'\377'	/* Record-mode Escape */

#define	REC_EOR		'\001'	/* Record-mode End-of-Record */

#define REC_EOF		'\002'	/* Record-mode End-of-File */

/*

 * Block Header

 */

#define	BLK_EOR		0x80	/* Block is End-of-Record */

#define	BLK_EOF		0x40	/* Block is End-of-File */

#define BLK_ERRORS	0x20	/* Block is suspected of containing errors */

#define	BLK_RESTART	0x10	/* Block is Restart Marker */

#define	BLK_BYTECOUNT	2	/* Bytes in this block */

#endif /* _ARPA_FTP_H_ */

/*	$NetBSD: inet.h,v 1.24 2008/06/21 20:12:49 christos Exp $	*/

/*

 * ++Copyright++ 1983, 1993

 * -

 * Copyright (c) 1983, 1993

 *    The Regents of the University of California.  All rights reserved.

 * 

 * 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 above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. 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.

 * 3. Neither the name of the University nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific prior written permission.

 * 

 * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.

 * -

 * Portions Copyright (c) 1993 by Digital Equipment Corporation.

 * 

 * 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, and that

 * the name of Digital Equipment Corporation not be used in advertising or

 * publicity pertaining to distribution of the document or software without

 * specific, written prior permission.

 * 

 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL

 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES

 * OF MERCHANTABILITY AND FITNESS.   IN NO EVENT SHALL DIGITAL EQUIPMENT

 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL

 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR

 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS

 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS

 * SOFTWARE.

 * -

 * --Copyright--

 */

/*%

 *	@(#)inet.h	8.1 (Berkeley) 6/2/93

 *	Id: inet.h,v 1.3 2005/04/27 04:56:16 sra Exp

 */

#ifndef _ARPA_INET_H_

#define	_ARPA_INET_H_

/* External definitions for functions in inet(3) */

#include <sys/ansi.h>

#include <sys/cdefs.h>

#include <sys/featuretest.h>

#include <sys/types.h>

#include <netinet/in.h>

#if (_POSIX_C_SOURCE - 0) >= 200112L || (_XOPEN_SOURCE - 0) >= 520 || \

    defined(_NETBSD_SOURCE)

#ifndef socklen_t

typedef __socklen_t	socklen_t;

#define socklen_t	__socklen_t

#endif

#endif /* _POSIX_C_SOURCE >= 200112 || XOPEN_SOURCE >= 520 || _NETBSD_SOURCE */

__BEGIN_DECLS

in_addr_t	 inet_addr(const char *);

in_addr_t	 inet_lnaof(struct in_addr);

struct in_addr	 inet_makeaddr(in_addr_t, in_addr_t);

in_addr_t	 inet_netof(struct in_addr);

in_addr_t	 inet_network(const char *);

char		*inet_ntoa(struct in_addr);

#if (_POSIX_C_SOURCE - 0) >= 200112L || (_XOPEN_SOURCE - 0) >= 520 || \

    defined(_NETBSD_SOURCE)

const char	*inet_ntop(int, const void * __restrict,

		                char * __restrict, socklen_t);

int		 inet_pton(int, const char * __restrict,

		                void * __restrict);

#endif

#if defined(_NETBSD_SOURCE)

int		 inet_aton(const char *, struct in_addr *);

char *		 inet_neta(u_long, char *, size_t);

char		*inet_net_ntop(int, const void *, int, char *, size_t);

int		 inet_net_pton(int, const char *, void *, size_t);

char		*inet_cidr_ntop(int, const void *, int, char *, size_t);

int		 inet_cidr_pton(int, const char *, void *, int *);

u_int		 inet_nsap_addr(const char *, u_char *, int);

char		*inet_nsap_ntoa(int, const u_char *, char *);

#endif

__END_DECLS

#endif /* _ARPA_INET_H_ */

/*	$NetBSD: nameser.h,v 1.25 2009/04/12 17:07:34 christos Exp $	*/

/*

 * Portions Copyright (C) 2004, 2005, 2008, 2009  Internet Systems Consortium, Inc. ("ISC")

 * Portions Copyright (C) 1996-2003  Internet Software Consortium.

 *

 * Permission to use, copy, modify, and/or distribute this software for any

 * purpose with or without fee is hereby granted, provided that the above

 * copyright notice and this permission notice appear in all copies.

 *

 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH

 * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY

 * AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,

 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM

 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE

 * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR

 * PERFORMANCE OF THIS SOFTWARE.

 */

/*

 * Copyright (c) 1983, 1989, 1993

 *    The Regents of the University of California.  All rights reserved.

 *

 * 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 above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. 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.

 * 3. Neither the name of the University nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.

 */

/*

 *	Id: nameser.h,v 1.16 2009/03/03 01:52:48 each Exp

 */

#ifndef _ARPA_NAMESER_H_

#define _ARPA_NAMESER_H_

#define BIND_4_COMPAT

#include <sys/param.h>

#if (!defined(BSD)) || (BSD < 199306)

# include <sys/bitypes.h>

#else

# include <sys/types.h>

#endif

#include <sys/cdefs.h>

/*%

 * Revision information.  This is the release date in YYYYMMDD format.

 * It can change every day so the right thing to do with it is use it

 * in preprocessor commands such as "#if (__NAMESER > 19931104)".  Do not

 * compare for equality; rather, use it to determine whether your libbind.a

 * contains a new enough lib/nameser/ to support the feature you need.

 */

#define __NAMESER	20090302	/*%< New interface version stamp. */

/*

 * Define constants based on RFC0883, RFC1034, RFC 1035

 */

#define NS_PACKETSZ	512	/*%< default UDP packet size */

#define NS_MAXDNAME	1025	/*%< maximum domain name (presentation format)*/

#define NS_MAXMSG	65535	/*%< maximum message size */

#define NS_MAXCDNAME	255	/*%< maximum compressed domain name */

#define NS_MAXLABEL	63	/*%< maximum length of domain label */

#define NS_MAXLABELS	128	/*%< theoretical max #/labels per domain name */

#define NS_MAXNNAME	256	/*%< maximum uncompressed (binary) domain name*/

#define	NS_MAXPADDR	(sizeof "ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff")

#define NS_HFIXEDSZ	12	/*%< #/bytes of fixed data in header */

#define NS_QFIXEDSZ	4	/*%< #/bytes of fixed data in query */

#define NS_RRFIXEDSZ	10	/*%< #/bytes of fixed data in r record */

#define NS_INT32SZ	4	/*%< #/bytes of data in a uint32_t */

#define NS_INT16SZ	2	/*%< #/bytes of data in a uint16_t */

#define NS_INT8SZ	1	/*%< #/bytes of data in a u_int8_t */

#define NS_INADDRSZ	4	/*%< IPv4 T_A */

#define NS_IN6ADDRSZ	16	/*%< IPv6 T_AAAA */

#define NS_CMPRSFLGS	0xc0	/*%< Flag bits indicating name compression. */

#define NS_DEFAULTPORT	53	/*%< For both TCP and UDP. */

/*

 * These can be expanded with synonyms, just keep ns_parse.c:ns_parserecord()

 * in synch with it.

 */

typedef enum __ns_sect {

	ns_s_qd = 0,		/*%< Query: Question. */

	ns_s_zn = 0,		/*%< Update: Zone. */

	ns_s_an = 1,		/*%< Query: Answer. */

	ns_s_pr = 1,		/*%< Update: Prerequisites. */

	ns_s_ns = 2,		/*%< Query: Name servers. */

	ns_s_ud = 2,		/*%< Update: Update. */

	ns_s_ar = 3,		/*%< Query|Update: Additional records. */

	ns_s_max = 4

} ns_sect;

/*%

 * Network name (compressed or not) type.  Equivilent to a pointer when used

 * in a function prototype.  Can be const'd.

 */

typedef u_char ns_nname[NS_MAXNNAME];

typedef const u_char *ns_nname_ct;

typedef u_char *ns_nname_t;

struct ns_namemap { ns_nname_ct base; int len; };

typedef struct ns_namemap *ns_namemap_t;

typedef const struct ns_namemap *ns_namemap_ct;

/*%

 * This is a message handle.  It is caller allocated and has no dynamic data.

 * This structure is intended to be opaque to all but ns_parse.c, thus the

 * leading _'s on the member names.  Use the accessor functions, not the _'s.

 */

typedef struct __ns_msg {

	const u_char	*_msg, *_eom;

	uint16_t	_id, _flags, _counts[ns_s_max];

	const u_char	*_sections[ns_s_max];

	ns_sect		_sect;

	int		_rrnum;

	const u_char	*_msg_ptr;

} ns_msg;

/*

 * This is a newmsg handle, used when constructing new messages with

 * ns_newmsg_init, et al.

 */

struct ns_newmsg {

	ns_msg		msg;

	const u_char	*dnptrs[25];

	const u_char	**lastdnptr;

};

typedef struct ns_newmsg ns_newmsg;

/* Private data structure - do not use from outside library. */

struct _ns_flagdata {  int mask, shift;  };

extern struct _ns_flagdata _ns_flagdata[];

/* Accessor macros - this is part of the public interface. */

#define ns_msg_id(handle) ((handle)._id + 0)

#define ns_msg_base(handle) ((handle)._msg + 0)

#define ns_msg_end(handle) ((handle)._eom + 0)

#define ns_msg_size(handle) ((size_t)((handle)._eom - (handle)._msg))

#define ns_msg_count(handle, section) ((handle)._counts[section] + 0)

/*%

 * This is a parsed record.  It is caller allocated and has no dynamic data.

 */

typedef	struct __ns_rr {

	char		name[NS_MAXDNAME];

	uint16_t	type;

	uint16_t	rr_class;

	uint32_t	ttl;

	uint16_t	rdlength;

	const u_char *	rdata;

} ns_rr;

/*

 * Same thing, but using uncompressed network binary names, and real C types.

 */

typedef	struct __ns_rr2 {

	ns_nname	nname;

	size_t		nnamel;

	int		type;

	int		rr_class;

	u_int		ttl;

	int		rdlength;

	const u_char *	rdata;

} ns_rr2;

/* Accessor macros - this is part of the public interface. */

#define ns_rr_name(rr)	(((rr).name[0] != '\0') ? (rr).name : ".")

#define ns_rr_nname(rr)	((const ns_nname_t)(rr).nname)

#define ns_rr_nnamel(rr) ((rr).nnamel + 0)

#define ns_rr_type(rr)	((ns_type)((rr).type + 0))

#define ns_rr_class(rr)	((ns_class)((rr).rr_class + 0))

#define ns_rr_ttl(rr)	((u_long)(rr).ttl + 0)

#define ns_rr_rdlen(rr)	((size_t)(rr).rdlength + 0)

#define ns_rr_rdata(rr)	((rr).rdata + 0)

/*%

 * These don't have to be in the same order as in the packet flags word,

 * and they can even overlap in some cases, but they will need to be kept

 * in synch with ns_parse.c:ns_flagdata[].

 */

typedef enum __ns_flag {

	ns_f_qr,		/*%< Question/Response. */

	ns_f_opcode,		/*%< Operation code. */

	ns_f_aa,		/*%< Authoritative Answer. */

	ns_f_tc,		/*%< Truncation occurred. */

	ns_f_rd,		/*%< Recursion Desired. */

	ns_f_ra,		/*%< Recursion Available. */

	ns_f_z,			/*%< MBZ. */

	ns_f_ad,		/*%< Authentic Data (DNSSEC). */

	ns_f_cd,		/*%< Checking Disabled (DNSSEC). */

	ns_f_rcode,		/*%< Response code. */

	ns_f_max

} ns_flag;

/*%

 * Currently defined opcodes.

 */

typedef enum __ns_opcode {

	ns_o_query = 0,		/*%< Standard query. */

	ns_o_iquery = 1,	/*%< Inverse query (deprecated/unsupported). */

	ns_o_status = 2,	/*%< Name server status query (unsupported). */

				/* Opcode 3 is undefined/reserved. */

	ns_o_notify = 4,	/*%< Zone change notification. */

	ns_o_update = 5,	/*%< Zone update message. */

	ns_o_max = 6

} ns_opcode;

/*%

 * Currently defined response codes.

 */

typedef	enum __ns_rcode {

	ns_r_noerror = 0,	/*%< No error occurred. */

	ns_r_formerr = 1,	/*%< Format error. */

	ns_r_servfail = 2,	/*%< Server failure. */

	ns_r_nxdomain = 3,	/*%< Name error. */

	ns_r_notimpl = 4,	/*%< Unimplemented. */

	ns_r_refused = 5,	/*%< Operation refused. */

	/* these are for BIND_UPDATE */

	ns_r_yxdomain = 6,	/*%< Name exists */

	ns_r_yxrrset = 7,	/*%< RRset exists */

	ns_r_nxrrset = 8,	/*%< RRset does not exist */

	ns_r_notauth = 9,	/*%< Not authoritative for zone */

	ns_r_notzone = 10,	/*%< Zone of record different from zone section */

	ns_r_max = 11,

	/* The following are EDNS extended rcodes */

	ns_r_badvers = 16,

	/* The following are TSIG errors */

	ns_r_badsig = 16,

	ns_r_badkey = 17,

	ns_r_badtime = 18

} ns_rcode;

/* BIND_UPDATE */

typedef enum __ns_update_operation {

	ns_uop_delete = 0,

	ns_uop_add = 1,

	ns_uop_max = 2

} ns_update_operation;

/*%

 * This structure is used for TSIG authenticated messages

 */

struct ns_tsig_key {

	char name[NS_MAXDNAME], alg[NS_MAXDNAME];

	unsigned char *data;

	int len;

};

typedef struct ns_tsig_key ns_tsig_key;

/*%

 * This structure is used for TSIG authenticated TCP messages

 */

struct ns_tcp_tsig_state {

	int counter;

	struct dst_key *key;

	void *ctx;

	unsigned char sig[NS_PACKETSZ];

	int siglen;

};

typedef struct ns_tcp_tsig_state ns_tcp_tsig_state;

#define NS_TSIG_FUDGE 300

#define NS_TSIG_TCP_COUNT 100

#define NS_TSIG_ALG_HMAC_MD5 "HMAC-MD5.SIG-ALG.REG.INT"

#define NS_TSIG_ERROR_NO_TSIG -10

#define NS_TSIG_ERROR_NO_SPACE -11

#define NS_TSIG_ERROR_FORMERR -12

/*%

 * Currently defined type values for resources and queries.

 */

typedef enum __ns_type {

	ns_t_invalid = 0,	/*%< Cookie. */

	ns_t_a = 1,		/*%< Host address. */

	ns_t_ns = 2,		/*%< Authoritative server. */

	ns_t_md = 3,		/*%< Mail destination. */

	ns_t_mf = 4,		/*%< Mail forwarder. */

	ns_t_cname = 5,		/*%< Canonical name. */

	ns_t_soa = 6,		/*%< Start of authority zone. */

	ns_t_mb = 7,		/*%< Mailbox domain name. */

	ns_t_mg = 8,		/*%< Mail group member. */

	ns_t_mr = 9,		/*%< Mail rename name. */

	ns_t_null = 10,		/*%< Null resource record. */

	ns_t_wks = 11,		/*%< Well known service. */

	ns_t_ptr = 12,		/*%< Domain name pointer. */

	ns_t_hinfo = 13,	/*%< Host information. */

	ns_t_minfo = 14,	/*%< Mailbox information. */

	ns_t_mx = 15,		/*%< Mail routing information. */

	ns_t_txt = 16,		/*%< Text strings. */

	ns_t_rp = 17,		/*%< Responsible person. */

	ns_t_afsdb = 18,	/*%< AFS cell database. */

	ns_t_x25 = 19,		/*%< X_25 calling address. */

	ns_t_isdn = 20,		/*%< ISDN calling address. */

	ns_t_rt = 21,		/*%< Router. */

	ns_t_nsap = 22,		/*%< NSAP address. */

	ns_t_nsap_ptr = 23,	/*%< Reverse NSAP lookup (deprecated). */

	ns_t_sig = 24,		/*%< Security signature. */

	ns_t_key = 25,		/*%< Security key. */

	ns_t_px = 26,		/*%< X.400 mail mapping. */

	ns_t_gpos = 27,		/*%< Geographical position (withdrawn). */

	ns_t_aaaa = 28,		/*%< IPv6 Address. */

	ns_t_loc = 29,		/*%< Location Information. */

	ns_t_nxt = 30,		/*%< Next domain (security). */

	ns_t_eid = 31,		/*%< Endpoint identifier. */

	ns_t_nimloc = 32,	/*%< Nimrod Locator. */

	ns_t_srv = 33,		/*%< Server Selection. */

	ns_t_atma = 34,		/*%< ATM Address */

	ns_t_naptr = 35,	/*%< Naming Authority PoinTeR */

	ns_t_kx = 36,		/*%< Key Exchange */

	ns_t_cert = 37,		/*%< Certification record */

	ns_t_a6 = 38,		/*%< IPv6 address (experimental) */

	ns_t_dname = 39,	/*%< Non-terminal DNAME */

	ns_t_sink = 40,		/*%< Kitchen sink (experimentatl) */

	ns_t_opt = 41,		/*%< EDNS0 option (meta-RR) */

	ns_t_apl = 42,		/*%< Address prefix list (RFC3123) */

	ns_t_ds = 43,		/*%< Delegation Signer */

	ns_t_sshfp = 44,	/*%< SSH Fingerprint */

	ns_t_ipseckey = 45,	/*%< IPSEC Key */

	ns_t_rrsig = 46,	/*%< RRset Signature */

	ns_t_nsec = 47,		/*%< Negative security */

	ns_t_dnskey = 48,	/*%< DNS Key */

	ns_t_dhcid = 49,	/*%< Dynamic host configuratin identifier */

	ns_t_nsec3 = 50,	/*%< Negative security type 3 */

	ns_t_nsec3param = 51,	/*%< Negative security type 3 parameters */

	ns_t_hip = 55,		/*%< Host Identity Protocol */

	ns_t_spf = 99,		/*%< Sender Policy Framework */

	ns_t_tkey = 249,	/*%< Transaction key */

	ns_t_tsig = 250,	/*%< Transaction signature. */

	ns_t_ixfr = 251,	/*%< Incremental zone transfer. */

	ns_t_axfr = 252,	/*%< Transfer zone of authority. */

	ns_t_mailb = 253,	/*%< Transfer mailbox records. */

	ns_t_maila = 254,	/*%< Transfer mail agent records. */

	ns_t_any = 255,		/*%< Wildcard match. */

	ns_t_zxfr = 256,	/*%< BIND-specific, nonstandard. */

	ns_t_dlv = 32769,	/*%< DNSSEC look-aside validatation. */

	ns_t_max = 65536

} ns_type;

/* Exclusively a QTYPE? (not also an RTYPE) */

#define	ns_t_qt_p(t) (ns_t_xfr_p(t) || (t) == ns_t_any || \

		      (t) == ns_t_mailb || (t) == ns_t_maila)

/* Some kind of meta-RR? (not a QTYPE, but also not an RTYPE) */

#define	ns_t_mrr_p(t) ((t) == ns_t_tsig || (t) == ns_t_opt)

/* Exclusively an RTYPE? (not also a QTYPE or a meta-RR) */

#define ns_t_rr_p(t) (!ns_t_qt_p(t) && !ns_t_mrr_p(t))

#define ns_t_udp_p(t) ((t) != ns_t_axfr && (t) != ns_t_zxfr)

#define ns_t_xfr_p(t) ((t) == ns_t_axfr || (t) == ns_t_ixfr || \

		       (t) == ns_t_zxfr)

/*%

 * Values for class field

 */

typedef enum __ns_class {

	ns_c_invalid = 0,	/*%< Cookie. */

	ns_c_in = 1,		/*%< Internet. */

	ns_c_2 = 2,		/*%< unallocated/unsupported. */

	ns_c_chaos = 3,		/*%< MIT Chaos-net. */

	ns_c_hs = 4,		/*%< MIT Hesiod. */

	/* Query class values which do not appear in resource records */

	ns_c_none = 254,	/*%< for prereq. sections in update requests */

	ns_c_any = 255,		/*%< Wildcard match. */

	ns_c_max = 65536

} ns_class;

/* DNSSEC constants. */

typedef enum __ns_key_types {

	ns_kt_rsa = 1,		/*%< key type RSA/MD5 */

	ns_kt_dh  = 2,		/*%< Diffie Hellman */

	ns_kt_dsa = 3,		/*%< Digital Signature Standard (MANDATORY) */

	ns_kt_private = 254	/*%< Private key type starts with OID */

} ns_key_types;

typedef enum __ns_cert_types {

	cert_t_pkix = 1,	/*%< PKIX (X.509v3) */

	cert_t_spki = 2,	/*%< SPKI */

	cert_t_pgp  = 3,	/*%< PGP */

	cert_t_url  = 253,	/*%< URL private type */

	cert_t_oid  = 254	/*%< OID private type */

} ns_cert_types;

/* Flags field of the KEY RR rdata. */

#define	NS_KEY_TYPEMASK		0xC000	/*%< Mask for "type" bits */

#define	NS_KEY_TYPE_AUTH_CONF	0x0000	/*%< Key usable for both */

#define	NS_KEY_TYPE_CONF_ONLY	0x8000	/*%< Key usable for confidentiality */

#define	NS_KEY_TYPE_AUTH_ONLY	0x4000	/*%< Key usable for authentication */

#define	NS_KEY_TYPE_NO_KEY	0xC000	/*%< No key usable for either; no key */

/* The type bits can also be interpreted independently, as single bits: */

#define	NS_KEY_NO_AUTH		0x8000	/*%< Key unusable for authentication */

#define	NS_KEY_NO_CONF		0x4000	/*%< Key unusable for confidentiality */

#define	NS_KEY_RESERVED2	0x2000	/* Security is *mandatory* if bit=0 */

#define	NS_KEY_EXTENDED_FLAGS	0x1000	/*%< reserved - must be zero */

#define	NS_KEY_RESERVED4	0x0800  /*%< reserved - must be zero */

#define	NS_KEY_RESERVED5	0x0400  /*%< reserved - must be zero */

#define	NS_KEY_NAME_TYPE	0x0300	/*%< these bits determine the type */

#define	NS_KEY_NAME_USER	0x0000	/*%< key is assoc. with user */

#define	NS_KEY_NAME_ENTITY	0x0200	/*%< key is assoc. with entity eg host */

#define	NS_KEY_NAME_ZONE	0x0100	/*%< key is zone key */

#define	NS_KEY_NAME_RESERVED	0x0300	/*%< reserved meaning */

#define	NS_KEY_RESERVED8	0x0080  /*%< reserved - must be zero */

#define	NS_KEY_RESERVED9	0x0040  /*%< reserved - must be zero */

#define	NS_KEY_RESERVED10	0x0020  /*%< reserved - must be zero */

#define	NS_KEY_RESERVED11	0x0010  /*%< reserved - must be zero */

#define	NS_KEY_SIGNATORYMASK	0x000F	/*%< key can sign RR's of same name */

#define	NS_KEY_RESERVED_BITMASK ( NS_KEY_RESERVED2 | \

				  NS_KEY_RESERVED4 | \

				  NS_KEY_RESERVED5 | \

				  NS_KEY_RESERVED8 | \

				  NS_KEY_RESERVED9 | \

				  NS_KEY_RESERVED10 | \

				  NS_KEY_RESERVED11 )

#define NS_KEY_RESERVED_BITMASK2 0xFFFF /*%< no bits defined here */

/* The Algorithm field of the KEY and SIG RR's is an integer, {1..254} */

#define	NS_ALG_MD5RSA		1	/*%< MD5 with RSA */

#define	NS_ALG_DH               2	/*%< Diffie Hellman KEY */

#define	NS_ALG_DSA              3	/*%< DSA KEY */

#define	NS_ALG_DSS              NS_ALG_DSA

#define	NS_ALG_EXPIRE_ONLY	253	/*%< No alg, no security */

#define	NS_ALG_PRIVATE_OID	254	/*%< Key begins with OID giving alg */

/* Protocol values  */

/* value 0 is reserved */

#define NS_KEY_PROT_TLS         1

#define NS_KEY_PROT_EMAIL       2

#define NS_KEY_PROT_DNSSEC      3

#define NS_KEY_PROT_IPSEC       4

#define NS_KEY_PROT_ANY		255

/* Signatures */

#define	NS_MD5RSA_MIN_BITS	 512	/*%< Size of a mod or exp in bits */

#define	NS_MD5RSA_MAX_BITS	4096

	/* Total of binary mod and exp */

#define	NS_MD5RSA_MAX_BYTES	((NS_MD5RSA_MAX_BITS+7/8)*2+3)

	/* Max length of text sig block */

#define	NS_MD5RSA_MAX_BASE64	(((NS_MD5RSA_MAX_BYTES+2)/3)*4)

#define NS_MD5RSA_MIN_SIZE	((NS_MD5RSA_MIN_BITS+7)/8)

#define NS_MD5RSA_MAX_SIZE	((NS_MD5RSA_MAX_BITS+7)/8)

#define NS_DSA_SIG_SIZE         41

#define NS_DSA_MIN_SIZE         213

#define NS_DSA_MAX_BYTES        405

/* Offsets into SIG record rdata to find various values */

#define	NS_SIG_TYPE	0	/*%< Type flags */

#define	NS_SIG_ALG	2	/*%< Algorithm */

#define	NS_SIG_LABELS	3	/*%< How many labels in name */

#define	NS_SIG_OTTL	4	/*%< Original TTL */

#define	NS_SIG_EXPIR	8	/*%< Expiration time */

#define	NS_SIG_SIGNED	12	/*%< Signature time */

#define	NS_SIG_FOOT	16	/*%< Key footprint */

#define	NS_SIG_SIGNER	18	/*%< Domain name of who signed it */

/* How RR types are represented as bit-flags in NXT records */

#define	NS_NXT_BITS 8

#define	NS_NXT_BIT_SET(  n,p) (p[(n)/NS_NXT_BITS] |=  (0x80>>((n)%NS_NXT_BITS)))

#define	NS_NXT_BIT_CLEAR(n,p) (p[(n)/NS_NXT_BITS] &= ~(0x80>>((n)%NS_NXT_BITS)))

#define	NS_NXT_BIT_ISSET(n,p) (p[(n)/NS_NXT_BITS] &   (0x80>>((n)%NS_NXT_BITS)))

#define NS_NXT_MAX 127

/*%

 * EDNS0 extended flags and option codes, host order.

 */

#define NS_OPT_DNSSEC_OK	0x8000U

#define NS_OPT_NSID             3

/*%

 * Inline versions of get/put short/long.  Pointer is advanced.

 */

#define NS_GET16(s, cp) do { \

	const u_char *t_cp = (const u_char *)(cp); \

	(s) = ((uint16_t)t_cp[0] << 8) \

	    | ((uint16_t)t_cp[1]) \

	    ; \

	(cp) += NS_INT16SZ; \

} while (/*CONSTCOND*/0)

#define NS_GET32(l, cp) do { \

	const u_char *t_cp = (const u_char *)(cp); \

	(l) = ((uint32_t)t_cp[0] << 24) \

	    | ((uint32_t)t_cp[1] << 16) \

	    | ((uint32_t)t_cp[2] << 8) \

	    | ((uint32_t)t_cp[3]) \

	    ; \

	(cp) += NS_INT32SZ; \

} while (/*CONSTCOND*/0)

#define NS_PUT16(s, cp) do { \

	uint32_t t_s = (uint32_t)(s); \

	u_char *t_cp = (u_char *)(cp); \

	*t_cp++ = t_s >> 8; \

	*t_cp   = t_s; \

	(cp) += NS_INT16SZ; \

} while (/*CONSTCOND*/0)

#define NS_PUT32(l, cp) do { \

	uint32_t t_l = (uint32_t)(l); \

	u_char *t_cp = (u_char *)(cp); \

	*t_cp++ = t_l >> 24; \

	*t_cp++ = t_l >> 16; \

	*t_cp++ = t_l >> 8; \

	*t_cp   = t_l; \

	(cp) += NS_INT32SZ; \

} while (/*CONSTCOND*/0)

/*%

 * ANSI C identifier hiding for bind's lib/nameser.

 */

#define	ns_msg_getflag		__ns_msg_getflag

#define ns_get16		__ns_get16

#define ns_get32		__ns_get32

#define ns_put16		__ns_put16

#define ns_put32		__ns_put32

#define ns_initparse		__ns_initparse

#define ns_skiprr		__ns_skiprr

#define ns_parserr		__ns_parserr

#define ns_parserr2		__ns_parserr2

#define	ns_sprintrr		__ns_sprintrr

#define	ns_sprintrrf		__ns_sprintrrf

#define	ns_format_ttl		__ns_format_ttl

#define	ns_parse_ttl		__ns_parse_ttl

#define ns_datetosecs		__ns_datetosecs

#define	ns_name_ntol		__ns_name_ntol

#define	ns_name_ntop		__ns_name_ntop

#define	ns_name_pton		__ns_name_pton

#define	ns_name_pton2		__ns_name_pton2

#define	ns_name_unpack		__ns_name_unpack

#define	ns_name_unpack2		__ns_name_unpack2

#define	ns_name_pack		__ns_name_pack

#define	ns_name_compress	__ns_name_compress

#define	ns_name_uncompress	__ns_name_uncompress

#define	ns_name_skip		__ns_name_skip

#define	ns_name_rollback	__ns_name_rollback

#define	ns_name_length		__ns_name_length

#define	ns_name_eq		__ns_name_eq

#define	ns_name_owned		__ns_name_owned

#define	ns_name_map		__ns_name_map

#define	ns_name_labels		__ns_name_labels

#define	ns_sign			__ns_sign

#define	ns_sign2		__ns_sign2

#define	ns_sign_tcp		__ns_sign_tcp

#define	ns_sign_tcp2		__ns_sign_tcp2

#define	ns_sign_tcp_init	__ns_sign_tcp_init

#define ns_find_tsig		__ns_find_tsig

#define	ns_verify		__ns_verify

#define	ns_verify_tcp		__ns_verify_tcp

#define	ns_verify_tcp_init	__ns_verify_tcp_init

#define	ns_samedomain		__ns_samedomain

#define	ns_subdomain		__ns_subdomain

#define	ns_makecanon		__ns_makecanon

#define	ns_samename		__ns_samename

#define	ns_newmsg_init		__ns_newmsg_init

#define	ns_newmsg_copy		__ns_newmsg_copy

#define	ns_newmsg_id		__ns_newmsg_id

#define	ns_newmsg_flag		__ns_newmsg_flag

#define	ns_newmsg_q		__ns_newmsg_q

#define	ns_newmsg_rr		__ns_newmsg_rr

#define	ns_newmsg_done		__ns_newmsg_done

#define	ns_rdata_unpack		__ns_rdata_unpack

#define	ns_rdata_equal		__ns_rdata_equal

#define	ns_rdata_refers		__ns_rdata_refers

__BEGIN_DECLS

int		ns_msg_getflag(ns_msg, int);

uint16_t	ns_get16(const u_char *);

uint32_t	ns_get32(const u_char *);

void		ns_put16(uint16_t, u_char *);

void		ns_put32(uint32_t, u_char *);

int		ns_initparse(const u_char *, int, ns_msg *);

int		ns_skiprr(const u_char *, const u_char *, ns_sect, int);

int		ns_parserr(ns_msg *, ns_sect, int, ns_rr *);

int		ns_parserr2(ns_msg *, ns_sect, int, ns_rr2 *);

int		ns_sprintrr(const ns_msg *, const ns_rr *,

				 const char *, const char *, char *, size_t);

int		ns_sprintrrf(const u_char *, size_t, const char *,

				  ns_class, ns_type, u_long, const u_char *,

				  size_t, const char *, const char *,

				  char *, size_t);

int		ns_format_ttl(u_long, char *, size_t);

int		ns_parse_ttl(const char *, u_long *);

uint32_t	ns_datetosecs(const char *cp, int *errp);

int		ns_name_ntol(const u_char *, u_char *, size_t);

int		ns_name_ntop(const u_char *, char *, size_t);

int		ns_name_pton(const char *, u_char *, size_t);

int		ns_name_pton2(const char *, u_char *, size_t, size_t *);

int		ns_name_unpack(const u_char *, const u_char *,

				    const u_char *, u_char *, size_t);

int		ns_name_unpack2(const u_char *, const u_char *,

				     const u_char *, u_char *, size_t,

				     size_t *);

int		ns_name_pack(const u_char *, u_char *, int,

				  const u_char **, const u_char **);

int		ns_name_uncompress(const u_char *, const u_char *,

					const u_char *, char *, size_t);

int		ns_name_compress(const char *, u_char *, size_t,

				      const u_char **, const u_char **);

int		ns_name_skip(const u_char **, const u_char *);

void		ns_name_rollback(const u_char *, const u_char **,

				      const u_char **);

#ifndef __LIBC12_SOURCE__

int		ns_sign(u_char *, int *, int, int, void *,

			     const u_char *, int, u_char *, int *, time_t)

    __RENAME(__ns_sign50);

int		ns_sign2(u_char *, int *, int, int, void *,

			      const u_char *, int, u_char *, int *, time_t,

			      u_char **, u_char **)

    __RENAME(__ns_sign250);

#endif

ssize_t		ns_name_length(ns_nname_ct, size_t);

int		ns_name_eq(ns_nname_ct, size_t, ns_nname_ct, size_t);

int		ns_name_owned(ns_namemap_ct, int, ns_namemap_ct, int);

int		ns_name_map(ns_nname_ct, size_t, ns_namemap_t, int);

int		ns_name_labels(ns_nname_ct, size_t);

int		ns_sign_tcp(u_char *, int *, int, int,

				 ns_tcp_tsig_state *, int);

int		ns_sign_tcp2(u_char *, int *, int, int,

				  ns_tcp_tsig_state *, int,

				  u_char **, u_char **);

int		ns_sign_tcp_init(void *, const u_char *, int,

					ns_tcp_tsig_state *);

u_char		*ns_find_tsig(u_char *, u_char *);

#ifndef __LIBC12_SOURCE__

int		ns_verify(u_char *, int *, void *,

			       const u_char *, int, u_char *, int *,

			       time_t *, int)

    __RENAME(__ns_verify50);

#endif

int		ns_verify_tcp(u_char *, int *, ns_tcp_tsig_state *, int);

int		ns_verify_tcp_init(void *, const u_char *, int,

					ns_tcp_tsig_state *);

int		ns_samedomain(const char *, const char *);

int		ns_subdomain(const char *, const char *);

int		ns_makecanon(const char *, char *, size_t);

int		ns_samename(const char *, const char *);

int		ns_newmsg_init(u_char *buffer, size_t bufsiz, ns_newmsg *);

int		ns_newmsg_copy(ns_newmsg *, ns_msg *);

void		ns_newmsg_id(ns_newmsg *handle, uint16_t id);

void		ns_newmsg_flag(ns_newmsg *handle, ns_flag flag, u_int value);

int		ns_newmsg_q(ns_newmsg *handle, ns_nname_ct qname,

			    ns_type qtype, ns_class qclass);

int		ns_newmsg_rr(ns_newmsg *handle, ns_sect sect,

			     ns_nname_ct name, ns_type type,

			     ns_class rr_class, uint32_t ttl,

			     uint16_t rdlen, const u_char *rdata);

size_t		ns_newmsg_done(ns_newmsg *handle);

ssize_t		ns_rdata_unpack(const u_char *, const u_char *, ns_type,

				const u_char *, size_t, u_char *, size_t);

int		ns_rdata_equal(ns_type,

			       const u_char *, size_t,

			       const u_char *, size_t);

int		ns_rdata_refers(ns_type,

				const u_char *, size_t,

				const u_char *);

__END_DECLS

#ifdef BIND_4_COMPAT

#include <arpa/nameser_compat.h>

#endif

#endif /* !_ARPA_NAMESER_H_ */

// -*- C++ -*-

//===-------------------------- optional ----------------------------------===//

//

//                     The LLVM Compiler Infrastructure

//

// This file is dual licensed under the MIT and the University of Illinois Open

// Source Licenses. See LICENSE.TXT for details.

//

//===----------------------------------------------------------------------===//

#ifndef _LIBCPP_OPTIONAL

#define _LIBCPP_OPTIONAL

/*

    optional synopsis

// C++1y

namespace std { namespace experimental { inline namespace fundamentals_v1 {

    // 5.3, optional for object types

    template <class T> class optional;

    // 5.4, In-place construction

    struct in_place_t{};

    constexpr in_place_t in_place{};

    // 5.5, No-value state indicator

    struct nullopt_t{see below};

    constexpr nullopt_t nullopt(unspecified);

    // 5.6, Class bad_optional_access

    class bad_optional_access;

    // 5.7, Relational operators

    template <class T>

      constexpr bool operator==(const optional<T>&, const optional<T>&);

    template <class T>

      constexpr bool operator!=(const optional<T>&, const optional<T>&);

    template <class T>

      constexpr bool operator<(const optional<T>&, const optional<T>&);

    template <class T>

      constexpr bool operator>(const optional<T>&, const optional<T>&);

    template <class T>

      constexpr bool operator<=(const optional<T>&, const optional<T>&);

    template <class T>

      constexpr bool operator>=(const optional<T>&, const optional<T>&);

    // 5.8, Comparison with nullopt

    template <class T> constexpr bool operator==(const optional<T>&, nullopt_t) noexcept;

    template <class T> constexpr bool operator==(nullopt_t, const optional<T>&) noexcept;

    template <class T> constexpr bool operator!=(const optional<T>&, nullopt_t) noexcept;

    template <class T> constexpr bool operator!=(nullopt_t, const optional<T>&) noexcept;

    template <class T> constexpr bool operator<(const optional<T>&, nullopt_t) noexcept;

    template <class T> constexpr bool operator<(nullopt_t, const optional<T>&) noexcept;

    template <class T> constexpr bool operator<=(const optional<T>&, nullopt_t) noexcept;

    template <class T> constexpr bool operator<=(nullopt_t, const optional<T>&) noexcept;

    template <class T> constexpr bool operator>(const optional<T>&, nullopt_t) noexcept;

    template <class T> constexpr bool operator>(nullopt_t, const optional<T>&) noexcept;

    template <class T> constexpr bool operator>=(const optional<T>&, nullopt_t) noexcept;

    template <class T> constexpr bool operator>=(nullopt_t, const optional<T>&) noexcept;

    // 5.9, Comparison with T

    template <class T> constexpr bool operator==(const optional<T>&, const T&);

    template <class T> constexpr bool operator==(const T&, const optional<T>&);

    template <class T> constexpr bool operator!=(const optional<T>&, const T&);

    template <class T> constexpr bool operator!=(const T&, const optional<T>&);

    template <class T> constexpr bool operator<(const optional<T>&, const T&);

    template <class T> constexpr bool operator<(const T&, const optional<T>&);

    template <class T> constexpr bool operator<=(const optional<T>&, const T&);

    template <class T> constexpr bool operator<=(const T&, const optional<T>&);

    template <class T> constexpr bool operator>(const optional<T>&, const T&);

    template <class T> constexpr bool operator>(const T&, const optional<T>&);

    template <class T> constexpr bool operator>=(const optional<T>&, const T&);

    template <class T> constexpr bool operator>=(const T&, const optional<T>&);

    // 5.10, Specialized algorithms

    template <class T> void swap(optional<T>&, optional<T>&) noexcept(see below);

    template <class T> constexpr optional<see below> make_optional(T&&);

	template <class T>

	class optional

	{

	public:

	  typedef T value_type;

	  // 5.3.1, Constructors

	  constexpr optional() noexcept;

	  constexpr optional(nullopt_t) noexcept;

	  optional(const optional&);

	  optional(optional&&) noexcept(see below);

	  constexpr optional(const T&);

	  constexpr optional(T&&);

	  template <class... Args> constexpr explicit optional(in_place_t, Args&&...);

	  template <class U, class... Args>

		constexpr explicit optional(in_place_t, initializer_list<U>, Args&&...);

	  // 5.3.2, Destructor

	  ~optional();

	  // 5.3.3, Assignment

	  optional& operator=(nullopt_t) noexcept;

	  optional& operator=(const optional&);

	  optional& operator=(optional&&) noexcept(see below);

	  template <class U> optional& operator=(U&&);

	  template <class... Args> void emplace(Args&&...);

	  template <class U, class... Args>

		void emplace(initializer_list<U>, Args&&...);

	  // 5.3.4, Swap

	  void swap(optional&) noexcept(see below);

	  // 5.3.5, Observers

	  constexpr T const* operator ->() const;

	  constexpr T* operator ->();

	  constexpr T const& operator *() const &;

	  constexpr T& operator *() &;

	  constexpr T&& operator *() &&;

	  constexpr const T&& operator *() const &&;

	  constexpr explicit operator bool() const noexcept;

	  constexpr T const& value() const &;

	  constexpr T& value() &;

	  constexpr T&& value() &&;

	  constexpr const T&& value() const &&;

	  template <class U> constexpr T value_or(U&&) const &;

	  template <class U> constexpr T value_or(U&&) &&;

	private:

	  T*   val;  // exposition only

	};

  } // namespace fundamentals_v1

  } // namespace experimental

  // 5.11, Hash support

  template <class T> struct hash;

  template <class T> struct hash<experimental::optional<T>>;

} // namespace std

*/

#include <experimental/__config>

#include <functional>

#include <stdexcept>

_LIBCPP_BEGIN_NAMESPACE_EXPERIMENTAL

class _LIBCPP_EXCEPTION_ABI bad_optional_access

    : public std::logic_error

{

public:

	bad_optional_access() : std::logic_error("Bad optional Access") {}

//	Get the key function ~bad_optional_access() into the dylib

    virtual ~bad_optional_access() _NOEXCEPT;

};

_LIBCPP_END_NAMESPACE_EXPERIMENTAL

#if _LIBCPP_STD_VER > 11

#include <initializer_list>

#include <type_traits>

#include <new>

#include <__functional_base>

#include <__undef_min_max>

#include <__debug>

#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)

#pragma GCC system_header

#endif

_LIBCPP_BEGIN_NAMESPACE_LFTS

struct in_place_t {};

constexpr in_place_t in_place{};