Add Socket Libraries.

Add Posix functions for porting compatibility.
Fix compliance issues with ISO/IEC 9899:199409
New Functions:
  setenv(), fparseln(), GetFileNameFromPath(), rename(),
  realpath(), setprogname(), getprogname(), strlcat(), strlcpy(),
  strsep(), setitimer(), getitimer(), timegm(), getopt(), basename(),
  mkstemp(), ffs(), vsnprintf(), snprintf(), getpass(), usleep(), select(),
  writev(), strcasecmp(), getcwd(), chdir(), tcgetpgrp(), getpgrp(), gettimeofday(),
  bcopy(), 


git-svn-id: https://edk2.svn.sourceforge.net/svnroot/edk2/trunk/edk2@12061 6f19259b-4bc3-4df7-8a09-765794883524

4 files changed, 775 insertions, 0 deletions

diff --git a/StdLib/Include/net/if.h b/StdLib/Include/net/if.h
new file mode 100644
index 0000000000..0b8afa0965
--- /dev/null
+++ b/StdLib/Include/net/if.h
@@ -0,0 +1,227 @@
+/*

+ * Copyright (c) 1982, 1986, 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. All advertising materials mentioning features or use of this software

+ *    must display the following acknowledgement:

+ *	This product includes software developed by the University of

+ *	California, Berkeley and its contributors.

+ * 4. 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.

+ *

+ *	@(#)if.h	8.1 (Berkeley) 6/10/93

+ *	$Id: if.h,v 1.1.1.1 2006/05/30 06:12:41 hhzhou Exp $

+ */

+

+#ifndef _NET_IF_H_

+#define	_NET_IF_H_

+

+/*

+ * <net/if.h> does not depend on <sys/time.h> on most other systems.  This

+ * helps userland compatability.  (struct timeval ifi_lastchange)

+ */

+#ifndef KERNEL

+#include <sys/time.h>

+#endif

+

+/*

+ * Structure describing information about an interface

+ * which may be of interest to management entities.

+ */

+struct if_data {

+	/* generic interface information */

+	u_char	ifi_type;		/* ethernet, tokenring, etc */

+	u_char	ifi_physical;		/* e.g., AUI, Thinnet, 10base-T, etc */

+	u_char	ifi_addrlen;		/* media address length */

+	u_char	ifi_hdrlen;		/* media header length */

+	u_char	ifi_recvquota;		/* polling quota for receive intrs */

+	u_char	ifi_xmitquota;		/* polling quota for xmit intrs */

+	u_long	ifi_mtu;		/* maximum transmission unit */

+	u_long	ifi_metric;		/* routing metric (external only) */

+	u_long	ifi_baudrate;		/* linespeed */

+	/* volatile statistics */

+	u_long	ifi_ipackets;		/* packets received on interface */

+	u_long	ifi_ierrors;		/* input errors on interface */

+	u_long	ifi_opackets;		/* packets sent on interface */

+	u_long	ifi_oerrors;		/* output errors on interface */

+	u_long	ifi_collisions;		/* collisions on csma interfaces */

+	u_long	ifi_ibytes;		/* total number of octets received */

+	u_long	ifi_obytes;		/* total number of octets sent */

+	u_long	ifi_imcasts;		/* packets received via multicast */

+	u_long	ifi_omcasts;		/* packets sent via multicast */

+	u_long	ifi_iqdrops;		/* dropped on input, this interface */

+	u_long	ifi_noproto;		/* destined for unsupported protocol */

+	u_long	ifi_recvtiming;		/* usec spent receiving when timing */

+	u_long	ifi_xmittiming;		/* usec spent xmitting when timing */

+	struct	timeval ifi_lastchange;	/* time of last administrative change */

+};

+

+#define	IFF_UP		0x1		/* interface is up */

+#define	IFF_BROADCAST	0x2		/* broadcast address valid */

+#define	IFF_DEBUG	0x4		/* turn on debugging */

+#define	IFF_LOOPBACK	0x8		/* is a loopback net */

+#define	IFF_POINTOPOINT	0x10		/* interface is point-to-point link */

+/*#define IFF_NOTRAILERS 0x20		 * obsolete: avoid use of trailers */

+#define	IFF_RUNNING	0x40		/* resources allocated */

+#define	IFF_NOARP	0x80		/* no address resolution protocol */

+#define	IFF_PROMISC	0x100		/* receive all packets */

+#define	IFF_ALLMULTI	0x200		/* receive all multicast packets */

+#define	IFF_OACTIVE	0x400		/* transmission in progress */

+#define	IFF_SIMPLEX	0x800		/* can't hear own transmissions */

+#define	IFF_LINK0	0x1000		/* per link layer defined bit */

+#define	IFF_LINK1	0x2000		/* per link layer defined bit */

+#define	IFF_LINK2	0x4000		/* per link layer defined bit */

+#define	IFF_ALTPHYS	IFF_LINK2	/* use alternate physical connection */

+#define	IFF_MULTICAST	0x8000		/* supports multicast */

+

+/* flags set internally only: */

+#define	IFF_CANTCHANGE \

+	(IFF_BROADCAST|IFF_POINTOPOINT|IFF_RUNNING|IFF_OACTIVE|\

+	    IFF_SIMPLEX|IFF_MULTICAST|IFF_ALLMULTI)

+

+#define	IFQ_MAXLEN	50

+#define	IFNET_SLOWHZ	1		/* granularity is 1 second */

+

+/*

+ * Message format for use in obtaining information about interfaces

+ * from getkerninfo and the routing socket

+ */

+struct if_msghdr {

+	u_short	ifm_msglen;	/* to skip over non-understood messages */

+	u_char	ifm_version;	/* future binary compatability */

+	u_char	ifm_type;	/* message type */

+	int	ifm_addrs;	/* like rtm_addrs */

+	int	ifm_flags;	/* value of if_flags */

+	u_short	ifm_index;	/* index for associated ifp */

+	struct	if_data ifm_data;/* statistics and other data about if */

+};

+

+/*

+ * Message format for use in obtaining information about interface addresses

+ * from getkerninfo and the routing socket

+ */

+struct ifa_msghdr {

+	u_short	ifam_msglen;	/* to skip over non-understood messages */

+	u_char	ifam_version;	/* future binary compatability */

+	u_char	ifam_type;	/* message type */

+	int	ifam_addrs;	/* like rtm_addrs */

+	int	ifam_flags;	/* value of ifa_flags */

+	u_short	ifam_index;	/* index for associated ifp */

+	int	ifam_metric;	/* value of ifa_metric */

+};

+

+/*

+ * Message format for use in obtaining information about multicast addresses

+ * from the routing socket

+ */

+struct ifma_msghdr {

+	u_short	ifmam_msglen;	/* to skip over non-understood messages */

+	u_char	ifmam_version;	/* future binary compatability */

+	u_char	ifmam_type;	/* message type */

+	int	ifmam_addrs;	/* like rtm_addrs */

+	int	ifmam_flags;	/* value of ifa_flags */

+	u_short	ifmam_index;	/* index for associated ifp */

+};

+

+/*

+ * Interface request structure used for socket

+ * ioctl's.  All interface ioctl's must have parameter

+ * definitions which begin with ifr_name.  The

+ * remainder may be interface specific.

+ */

+struct	ifreq {

+#define	IFNAMSIZ	16

+	char	ifr_name[IFNAMSIZ];		/* if name, e.g. "en0" */

+	union {

+		struct	sockaddr ifru_addr;

+		struct	sockaddr ifru_dstaddr;

+		struct	sockaddr ifru_broadaddr;

+		short	ifru_flags;

+		int	ifru_metric;

+		int	ifru_mtu;

+		int	ifru_phys;

+		int	ifru_media;

+		caddr_t	ifru_data;

+	} ifr_ifru;

+#define	ifr_addr	ifr_ifru.ifru_addr	/* address */

+#define	ifr_dstaddr	ifr_ifru.ifru_dstaddr	/* other end of p-to-p link */

+#define	ifr_broadaddr	ifr_ifru.ifru_broadaddr	/* broadcast address */

+#define	ifr_flags	ifr_ifru.ifru_flags	/* flags */

+#define	ifr_metric	ifr_ifru.ifru_metric	/* metric */

+#define	ifr_mtu		ifr_ifru.ifru_mtu	/* mtu */

+#define ifr_phys	ifr_ifru.ifru_phys	/* physical wire */

+#define ifr_media	ifr_ifru.ifru_media	/* physical media */

+#define	ifr_data	ifr_ifru.ifru_data	/* for use by interface */

+};

+

+#define	_SIZEOF_ADDR_IFREQ(ifr) \

+	((ifr).ifr_addr.sa_len > sizeof(struct sockaddr) ? \

+	 (sizeof(struct ifreq) - sizeof(struct sockaddr) + \

+	  (ifr).ifr_addr.sa_len) : sizeof(struct ifreq))

+

+struct ifaliasreq {

+	char	ifra_name[IFNAMSIZ];		/* if name, e.g. "en0" */

+	struct	sockaddr ifra_addr;

+	struct	sockaddr ifra_broadaddr;

+	struct	sockaddr ifra_mask;

+};

+

+struct ifmediareq {

+	char	ifm_name[IFNAMSIZ];	/* if name, e.g. "en0" */

+	int	ifm_current;		/* current media options */

+	int	ifm_mask;		/* don't care mask */

+	int	ifm_status;		/* media status */

+	int	ifm_active;		/* active options */

+	int	ifm_count;		/* # entries in ifm_ulist array */

+	int	*ifm_ulist;		/* media words */

+};

+/*

+ * Structure used in SIOCGIFCONF request.

+ * Used to retrieve interface configuration

+ * for machine (useful for programs which

+ * must know all networks accessible).

+ */

+struct	ifconf {

+	int	ifc_len;		/* size of associated buffer */

+	union {

+		caddr_t	ifcu_buf;

+		struct	ifreq *ifcu_req;

+	} ifc_ifcu;

+#define	ifc_buf	ifc_ifcu.ifcu_buf	/* buffer address */

+#define	ifc_req	ifc_ifcu.ifcu_req	/* array of structures returned */

+};

+

+#ifdef KERNEL

+#ifdef MALLOC_DECLARE

+MALLOC_DECLARE(M_IFADDR);

+MALLOC_DECLARE(M_IFMADDR);

+#endif

+#endif

+

+/* XXX - this should go away soon */

+#ifdef KERNEL

+#include <net/if_var.h>

+#endif

+

+#endif /* !_NET_IF_H_ */

diff --git a/StdLib/Include/net/if_dl.h b/StdLib/Include/net/if_dl.h
new file mode 100644
index 0000000000..3935551097
--- /dev/null
+++ b/StdLib/Include/net/if_dl.h
@@ -0,0 +1,86 @@
+/*

+ * Copyright (c) 1990, 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. All advertising materials mentioning features or use of this software

+ *    must display the following acknowledgement:

+ *	This product includes software developed by the University of

+ *	California, Berkeley and its contributors.

+ * 4. 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.

+ *

+ *	@(#)if_dl.h	8.1 (Berkeley) 6/10/93

+ * $Id: if_dl.h,v 1.1.1.1 2006/05/30 06:12:42 hhzhou Exp $

+ */

+

+#ifndef _NET_IF_DL_H_

+#define _NET_IF_DL_H_

+

+/*

+ * A Link-Level Sockaddr may specify the interface in one of two

+ * ways: either by means of a system-provided index number (computed

+ * anew and possibly differently on every reboot), or by a human-readable

+ * string such as "il0" (for managerial convenience).

+ *

+ * Census taking actions, such as something akin to SIOCGCONF would return

+ * both the index and the human name.

+ *

+ * High volume transactions (such as giving a link-level ``from'' address

+ * in a recvfrom or recvmsg call) may be likely only to provide the indexed

+ * form, (which requires fewer copy operations and less space).

+ *

+ * The form and interpretation  of the link-level address is purely a matter

+ * of convention between the device driver and its consumers; however, it is

+ * expected that all drivers for an interface of a given if_type will agree.

+ */

+

+/*

+ * Structure of a Link-Level sockaddr:

+ */

+struct sockaddr_dl {

+	u_char	sdl_len;	/* Total length of sockaddr */

+	u_char	sdl_family;	/* AF_DLI */

+	u_short	sdl_index;	/* if != 0, system given index for interface */

+	u_char	sdl_type;	/* interface type */

+	u_char	sdl_nlen;	/* interface name length, no trailing 0 reqd. */

+	u_char	sdl_alen;	/* link level address length */

+	u_char	sdl_slen;	/* link layer selector length */

+	char	sdl_data[12];	/* minimum work area, can be larger;

+				   contains both if name and ll address */

+};

+

+#define LLADDR(s) ((caddr_t)((s)->sdl_data + (s)->sdl_nlen))

+

+#ifndef KERNEL

+

+#include <sys/EfiCdefs.h>

+

+__BEGIN_DECLS

+void	link_addr __P((const char *, struct sockaddr_dl *));

+char	*link_ntoa __P((const struct sockaddr_dl *));

+__END_DECLS

+

+#endif /* !KERNEL */

+

+#endif

diff --git a/StdLib/Include/net/radix.h b/StdLib/Include/net/radix.h
new file mode 100644
index 0000000000..20ad34b6e8
--- /dev/null
+++ b/StdLib/Include/net/radix.h
@@ -0,0 +1,170 @@
+/*

+ * Copyright (c) 1988, 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. All advertising materials mentioning features or use of this software

+ *    must display the following acknowledgement:

+ *	This product includes software developed by the University of

+ *	California, Berkeley and its contributors.

+ * 4. 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.

+ *

+ *	@(#)radix.h	8.2 (Berkeley) 10/31/94

+ *	$Id: radix.h,v 1.1.1.1 2006/05/30 06:12:46 hhzhou Exp $

+ */

+

+#ifndef _RADIX_H_

+#define	_RADIX_H_

+

+#ifdef MALLOC_DECLARE

+MALLOC_DECLARE(M_RTABLE);

+#endif

+

+/*

+ * Radix search tree node layout.

+ */

+

+struct radix_node {

+	struct	radix_mask *rn_mklist;	/* list of masks contained in subtree */

+	struct	radix_node *rn_p;	/* parent */

+	short	rn_b;			/* bit offset; -1-index(netmask) */

+	char	rn_bmask;		/* node: mask for bit test*/

+	u_char	rn_flags;		/* enumerated next */

+#define RNF_NORMAL	1		/* leaf contains normal route */

+#define RNF_ROOT	2		/* leaf is root leaf for tree */

+#define RNF_ACTIVE	4		/* This node is alive (for rtfree) */

+	union {

+		struct {			/* leaf only data: */

+			caddr_t	rn_Key;		/* object of search */

+			caddr_t	rn_Mask;	/* netmask, if present */

+			struct	radix_node *rn_Dupedkey;

+		} rn_leaf;

+		struct {			/* node only data: */

+			int	rn_Off;		/* where to start compare */

+			struct	radix_node *rn_L;/* progeny */

+			struct	radix_node *rn_R;/* progeny */

+		} rn_node;

+	}		rn_u;

+#ifdef RN_DEBUG

+	int rn_info;

+	struct radix_node *rn_twin;

+	struct radix_node *rn_ybro;

+#endif

+};

+

+#define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey

+#define rn_key rn_u.rn_leaf.rn_Key

+#define rn_mask rn_u.rn_leaf.rn_Mask

+#define rn_off rn_u.rn_node.rn_Off

+#define rn_l rn_u.rn_node.rn_L

+#define rn_r rn_u.rn_node.rn_R

+

+/*

+ * Annotations to tree concerning potential routes applying to subtrees.

+ */

+

+struct radix_mask {

+	short	rm_b;			/* bit offset; -1-index(netmask) */

+	char	rm_unused;		/* cf. rn_bmask */

+	u_char	rm_flags;		/* cf. rn_flags */

+	struct	radix_mask *rm_mklist;	/* more masks to try */

+	union	{

+		caddr_t	rmu_mask;		/* the mask */

+		struct	radix_node *rmu_leaf;	/* for normal routes */

+	}	rm_rmu;

+	int	rm_refs;		/* # of references to this struct */

+};

+

+#define rm_mask rm_rmu.rmu_mask

+#define rm_leaf rm_rmu.rmu_leaf		/* extra field would make 32 bytes */

+

+#define MKGet(m) {\

+	if (rn_mkfreelist) {\

+		m = rn_mkfreelist; \

+		rn_mkfreelist = (m)->rm_mklist; \

+	} else \

+		R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\

+

+#define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}

+

+typedef int walktree_f_t __P((struct radix_node *, void *));

+

+struct radix_node_head {

+	struct	radix_node *rnh_treetop;

+	int	rnh_addrsize;		/* permit, but not require fixed keys */

+	int	rnh_pktsize;		/* permit, but not require fixed keys */

+	struct	radix_node *(*rnh_addaddr)	/* add based on sockaddr */

+		__P((void *v, void *mask,

+		     struct radix_node_head *head, struct radix_node nodes[]));

+	struct	radix_node *(*rnh_addpkt)	/* add based on packet hdr */

+		__P((void *v, void *mask,

+		     struct radix_node_head *head, struct radix_node nodes[]));

+	struct	radix_node *(*rnh_deladdr)	/* remove based on sockaddr */

+		__P((void *v, void *mask, struct radix_node_head *head));

+	struct	radix_node *(*rnh_delpkt)	/* remove based on packet hdr */

+		__P((void *v, void *mask, struct radix_node_head *head));

+	struct	radix_node *(*rnh_matchaddr)	/* locate based on sockaddr */

+		__P((void *v, struct radix_node_head *head));

+	struct	radix_node *(*rnh_lookup)	/* locate based on sockaddr */

+		__P((void *v, void *mask, struct radix_node_head *head));

+	struct	radix_node *(*rnh_matchpkt)	/* locate based on packet hdr */

+		__P((void *v, struct radix_node_head *head));

+	int	(*rnh_walktree)			/* traverse tree */

+		__P((struct radix_node_head *head, walktree_f_t *f, void *w));

+	int	(*rnh_walktree_from)		/* traverse tree below a */

+		__P((struct radix_node_head *head, void *a, void *m,

+		     walktree_f_t *f, void *w));

+	void	(*rnh_close)	/* do something when the last ref drops */

+		__P((struct radix_node *rn, struct radix_node_head *head));

+	struct	radix_node rnh_nodes[3];	/* empty tree for common case */

+};

+

+#ifndef KERNEL

+#define Bcmp(a, b, n) bcmp(((char *)(a)), ((char *)(b)), (n))

+#define Bcopy(a, b, n) bcopy(((char *)(a)), ((char *)(b)), (unsigned)(n))

+#define Bzero(p, n) bzero((char *)(p), (int)(n));

+#define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n)))

+#define Free(p) free((char *)p);

+#else

+#define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))

+#define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))

+#define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n));

+#define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_DONTWAIT))

+#define Free(p) free((caddr_t)p, M_RTABLE);

+#endif /*KERNEL*/

+

+void	 rn_init __P((void));

+int	 rn_inithead __P((void **, int));

+int	 rn_refines __P((void *, void *));

+struct radix_node

+	 *rn_addmask __P((void *, int, int)),

+	 *rn_addroute __P((void *, void *, struct radix_node_head *,

+			struct radix_node [2])),

+	 *rn_delete __P((void *, void *, struct radix_node_head *)),

+	 *rn_lookup __P((void *v_arg, void *m_arg,

+		        struct radix_node_head *head)),

+	 *rn_match __P((void *, struct radix_node_head *));

+

+

+#endif /* _RADIX_H_ */

diff --git a/StdLib/Include/net/route.h b/StdLib/Include/net/route.h
new file mode 100644
index 0000000000..ec5d9eba7e
--- /dev/null
+++ b/StdLib/Include/net/route.h
@@ -0,0 +1,292 @@
+/*

+ * Copyright (c) 1980, 1986, 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. All advertising materials mentioning features or use of this software

+ *    must display the following acknowledgement:

+ *	This product includes software developed by the University of

+ *	California, Berkeley and its contributors.

+ * 4. 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.

+ *

+ *	@(#)route.h	8.3 (Berkeley) 4/19/94

+ * $Id: route.h,v 1.1.1.1 2006/05/30 06:12:46 hhzhou Exp $

+ */

+

+#ifndef _NET_ROUTE_H_

+#define _NET_ROUTE_H_

+

+#define	__P(protos)	protos		/* full-blown ANSI C */

+

+

+/*

+ * Kernel resident routing tables.

+ *

+ * The routing tables are initialized when interface addresses

+ * are set by making entries for all directly connected interfaces.

+ */

+

+/*

+ * A route consists of a destination address and a reference

+ * to a routing entry.  These are often held by protocols

+ * in their control blocks, e.g. inpcb.

+ */

+struct route {

+	struct	rtentry *ro_rt;

+	struct	sockaddr ro_dst;

+};

+

+/*

+ * These numbers are used by reliable protocols for determining

+ * retransmission behavior and are included in the routing structure.

+ */

+struct rt_metrics {

+	u_long	rmx_locks;	/* Kernel must leave these values alone */

+	u_long	rmx_mtu;	/* MTU for this path */

+	u_long	rmx_hopcount;	/* max hops expected */

+	u_long	rmx_expire;	/* lifetime for route, e.g. redirect */

+	u_long	rmx_recvpipe;	/* inbound delay-bandwidth product */

+	u_long	rmx_sendpipe;	/* outbound delay-bandwidth product */

+	u_long	rmx_ssthresh;	/* outbound gateway buffer limit */

+	u_long	rmx_rtt;	/* estimated round trip time */

+	u_long	rmx_rttvar;	/* estimated rtt variance */

+	u_long	rmx_pksent;	/* packets sent using this route */

+	u_long	rmx_filler[4];	/* will be used for T/TCP later */

+};

+

+/*

+ * rmx_rtt and rmx_rttvar are stored as microseconds;

+ * RTTTOPRHZ(rtt) converts to a value suitable for use

+ * by a protocol slowtimo counter.

+ */

+#define	RTM_RTTUNIT	1000000	/* units for rtt, rttvar, as units per sec */

+#define	RTTTOPRHZ(r)	((r) / (RTM_RTTUNIT / PR_SLOWHZ))

+

+/*

+ * XXX kernel function pointer `rt_output' is visible to applications.

+ */

+struct mbuf;

+

+/*

+ * We distinguish between routes to hosts and routes to networks,

+ * preferring the former if available.  For each route we infer

+ * the interface to use from the gateway address supplied when

+ * the route was entered.  Routes that forward packets through

+ * gateways are marked so that the output routines know to address the

+ * gateway rather than the ultimate destination.

+ */

+#ifndef RNF_NORMAL

+#include <net/radix.h>

+#endif

+struct rtentry {

+	struct	radix_node rt_nodes[2];	/* tree glue, and other values */

+#define	rt_key(r)	((struct sockaddr *)((r)->rt_nodes->rn_key))

+#define	rt_mask(r)	((struct sockaddr *)((r)->rt_nodes->rn_mask))

+	struct	sockaddr *rt_gateway;	/* value */

+	short	rt_filler;		/* was short flags field */

+	short	rt_refcnt;		/* # held references */

+	u_long	rt_flags;		/* up/down?, host/net */

+	struct	ifnet *rt_ifp;		/* the answer: interface to use */

+	struct	ifaddr *rt_ifa;		/* the answer: interface to use */

+	struct	sockaddr *rt_genmask;	/* for generation of cloned routes */

+	caddr_t	rt_llinfo;		/* pointer to link level info cache */

+	struct	rt_metrics rt_rmx;	/* metrics used by rx'ing protocols */

+	struct	rtentry *rt_gwroute;	/* implied entry for gatewayed routes */

+	int	(*rt_output) __P((struct ifnet *, struct mbuf *,

+				  struct sockaddr *, struct rtentry *));

+					/* output routine for this (rt,if) */

+	struct	rtentry *rt_parent; 	/* cloning parent of this route */

+	void	*rt_filler2;		/* more filler */

+};

+

+/*

+ * Following structure necessary for 4.3 compatibility;

+ * We should eventually move it to a compat file.

+ */

+struct ortentry {

+	u_long	rt_hash;		/* to speed lookups */

+	struct	sockaddr rt_dst;	/* key */

+	struct	sockaddr rt_gateway;	/* value */

+	short	rt_flags;		/* up/down?, host/net */

+	short	rt_refcnt;		/* # held references */

+	u_long	rt_use;			/* raw # packets forwarded */

+	struct	ifnet *rt_ifp;		/* the answer: interface to use */

+};

+

+#define rt_use rt_rmx.rmx_pksent

+

+#define	RTF_UP		0x1		/* route usable */

+#define	RTF_GATEWAY	0x2		/* destination is a gateway */

+#define	RTF_HOST	0x4		/* host entry (net otherwise) */

+#define	RTF_REJECT	0x8		/* host or net unreachable */

+#define	RTF_DYNAMIC	0x10		/* created dynamically (by redirect) */

+#define	RTF_MODIFIED	0x20		/* modified dynamically (by redirect) */

+#define RTF_DONE	0x40		/* message confirmed */

+/*			0x80		   unused */

+#define RTF_CLONING	0x100		/* generate new routes on use */

+#define RTF_XRESOLVE	0x200		/* external daemon resolves name */

+#define RTF_LLINFO	0x400		/* generated by link layer (e.g. ARP) */

+#define RTF_STATIC	0x800		/* manually added */

+#define RTF_BLACKHOLE	0x1000		/* just discard pkts (during updates) */

+#define RTF_PROTO2	0x4000		/* protocol specific routing flag */

+#define RTF_PROTO1	0x8000		/* protocol specific routing flag */

+

+#define RTF_PRCLONING	0x10000		/* protocol requires cloning */

+#define RTF_WASCLONED	0x20000		/* route generated through cloning */

+#define RTF_PROTO3	0x40000		/* protocol specific routing flag */

+/*			0x80000		   unused */

+#define RTF_PINNED	0x100000	/* future use */

+#define	RTF_LOCAL	0x200000 	/* route represents a local address */

+#define	RTF_BROADCAST	0x400000	/* route represents a bcast address */

+#define	RTF_MULTICAST	0x800000	/* route represents a mcast address */

+					/* 0x1000000 and up unassigned */

+

+/*

+ * Routing statistics.

+ */

+struct	rtstat {

+	short	rts_badredirect;	/* bogus redirect calls */

+	short	rts_dynamic;		/* routes created by redirects */

+	short	rts_newgateway;		/* routes modified by redirects */

+	short	rts_unreach;		/* lookups which failed */

+	short	rts_wildcard;		/* lookups satisfied by a wildcard */

+};

+/*

+ * Structures for routing messages.

+ */

+struct rt_msghdr {

+	u_short	rtm_msglen;	/* to skip over non-understood messages */

+	u_char	rtm_version;	/* future binary compatibility */

+	u_char	rtm_type;	/* message type */

+	u_short	rtm_index;	/* index for associated ifp */

+	int	rtm_flags;	/* flags, incl. kern & message, e.g. DONE */

+	int	rtm_addrs;	/* bitmask identifying sockaddrs in msg */

+	pid_t	rtm_pid;	/* identify sender */

+	int	rtm_seq;	/* for sender to identify action */

+	int	rtm_errno;	/* why failed */

+	int	rtm_use;	/* from rtentry */

+	u_long	rtm_inits;	/* which metrics we are initializing */

+	struct	rt_metrics rtm_rmx; /* metrics themselves */

+};

+

+#define RTM_VERSION	5	/* Up the ante and ignore older versions */

+

+#define RTM_ADD		0x1	/* Add Route */

+#define RTM_DELETE	0x2	/* Delete Route */

+#define RTM_CHANGE	0x3	/* Change Metrics or flags */

+#define RTM_GET		0x4	/* Report Metrics */

+#define RTM_LOSING	0x5	/* Kernel Suspects Partitioning */

+#define RTM_REDIRECT	0x6	/* Told to use different route */

+#define RTM_MISS	0x7	/* Lookup failed on this address */

+#define RTM_LOCK	0x8	/* fix specified metrics */

+#define RTM_OLDADD	0x9	/* caused by SIOCADDRT */

+#define RTM_OLDDEL	0xa	/* caused by SIOCDELRT */

+#define RTM_RESOLVE	0xb	/* req to resolve dst to LL addr */

+#define RTM_NEWADDR	0xc	/* address being added to iface */

+#define RTM_DELADDR	0xd	/* address being removed from iface */

+#define RTM_IFINFO	0xe	/* iface going up/down etc. */

+#define	RTM_NEWMADDR	0xf	/* mcast group membership being added to if */

+#define	RTM_DELMADDR	0x10	/* mcast group membership being deleted */

+

+#define RTV_MTU		0x1	/* init or lock _mtu */

+#define RTV_HOPCOUNT	0x2	/* init or lock _hopcount */

+#define RTV_EXPIRE	0x4	/* init or lock _hopcount */

+#define RTV_RPIPE	0x8	/* init or lock _recvpipe */

+#define RTV_SPIPE	0x10	/* init or lock _sendpipe */

+#define RTV_SSTHRESH	0x20	/* init or lock _ssthresh */

+#define RTV_RTT		0x40	/* init or lock _rtt */

+#define RTV_RTTVAR	0x80	/* init or lock _rttvar */

+

+/*

+ * Bitmask values for rtm_addr.

+ */

+#define RTA_DST		0x1	/* destination sockaddr present */

+#define RTA_GATEWAY	0x2	/* gateway sockaddr present */

+#define RTA_NETMASK	0x4	/* netmask sockaddr present */

+#define RTA_GENMASK	0x8	/* cloning mask sockaddr present */

+#define RTA_IFP		0x10	/* interface name sockaddr present */

+#define RTA_IFA		0x20	/* interface addr sockaddr present */

+#define RTA_AUTHOR	0x40	/* sockaddr for author of redirect */

+#define RTA_BRD		0x80	/* for NEWADDR, broadcast or p-p dest addr */

+

+/*

+ * Index offsets for sockaddr array for alternate internal encoding.

+ */

+#define RTAX_DST	0	/* destination sockaddr present */

+#define RTAX_GATEWAY	1	/* gateway sockaddr present */

+#define RTAX_NETMASK	2	/* netmask sockaddr present */

+#define RTAX_GENMASK	3	/* cloning mask sockaddr present */

+#define RTAX_IFP	4	/* interface name sockaddr present */

+#define RTAX_IFA	5	/* interface addr sockaddr present */

+#define RTAX_AUTHOR	6	/* sockaddr for author of redirect */

+#define RTAX_BRD	7	/* for NEWADDR, broadcast or p-p dest addr */

+#define RTAX_MAX	8	/* size of array to allocate */

+

+struct rt_addrinfo {

+	int	rti_addrs;

+	struct	sockaddr *rti_info[RTAX_MAX];

+};

+

+struct route_cb {

+	int	ip_count;

+	int	ipx_count;

+	int	ns_count;

+	int	iso_count;

+	int	any_count;

+};

+

+#ifdef KERNEL

+#define	RTFREE(rt) \

+	if ((rt)->rt_refcnt <= 1) \

+		rtfree(rt); \

+	else \

+		(rt)->rt_refcnt--;

+

+extern struct route_cb route_cb;

+extern struct radix_node_head *rt_tables[AF_MAX+1];

+

+struct ifmultiaddr;

+struct proc;

+

+void	 route_init __P((void));

+void	 rt_ifmsg __P((struct ifnet *));

+void	 rt_missmsg __P((int, struct rt_addrinfo *, int, int));

+void	 rt_newaddrmsg __P((int, struct ifaddr *, int, struct rtentry *));

+void	 rt_newmaddrmsg __P((int, struct ifmultiaddr *));

+int	 rt_setgate __P((struct rtentry *,

+	    struct sockaddr *, struct sockaddr *));

+void	 rtalloc __P((struct route *));

+void	 rtalloc_ign __P((struct route *, unsigned long));

+struct rtentry *

+	 rtalloc1 __P((struct sockaddr *, int, unsigned long));

+void	 rtfree __P((struct rtentry *));

+int	 rtinit __P((struct ifaddr *, int, int));

+int	 rtioctl __P((int, caddr_t, struct proc *));

+void	 rtredirect __P((struct sockaddr *, struct sockaddr *,

+	    struct sockaddr *, int, struct sockaddr *, struct rtentry **));

+int	 rtrequest __P((int, struct sockaddr *,

+	    struct sockaddr *, struct sockaddr *, int, struct rtentry **));

+#endif

+

+#endif