/* in.c - internet routines *//* Copyright 1984-1996 Wind River Systems, Inc. */#include "copyright_wrs.h"/* * Copyright (c) 1982, 1986, 1991, 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. * *	@(#)in.c	8.4 (Berkeley) 1/9/95 *//*modification history--------------------01j,22feb99,ham  called in_socktrim() in SIOCSIFNETMASK, SPR#24251.01h,06oct98,ham  cancelled "01g" moidification, new fix for SPR#22267.01g,08sep98,ham  fixed SIOCAIFADDR inproper work in in_control SPR#22267.01f,08dec97,vin  fixed a bug in_addmulti incremented the ref count SPR 997101e,03dec97,vin  changed _pNetDpool to _pNetSysPool01d,05oct97,vin  added fast multicasting.01c,07jan96,vin  added _igmpJoinGrpHook and _igmpLeaveGrpHook for scaling igmp.01b,05dec96,vin  replaced malloc with MALLOC and free with FREE(),01a,03mar96,vin  created from BSD4.4 stuff,integrated with 02n of in.c.*//*DESCRIPTION*/#include "vxWorks.h"#include "logLib.h"#include "sys/ioctl.h"#include "net/mbuf.h"#include "net/protosw.h"#include "sys/socket.h"#include "net/socketvar.h"#include "net/uio.h"#include "errno.h"#include "netinet/in_systm.h"#include "net/if.h"#include "net/route.h"#include "netinet/in.h"#include "netinet/in_var.h"#include "net/systm.h"#include "netinet/igmp_var.h"#include "net/unixLib.h"#ifdef INET/* defines *//* externals */extern void arp_rtrequest (); extern VOIDFUNCPTR _igmpJoinGrpHook; extern VOIDFUNCPTR _igmpLeaveGrpHook; /* globals */#ifndef SUBNETSARELOCAL#define	SUBNETSARELOCAL	1#endifint subnetsarelocal = SUBNETSARELOCAL;int	in_interfaces;		/* number of external internet interfaces */extern	struct ifnet loif;	/* loop back interface */int	mCastHashTblSize = 64;	/* default size of hash table */struct mcastHashInfo	mCastHashInfo;BOOL inet_netmatch(sin1, sin2)	struct sockaddr_in *sin1;	struct sockaddr_in *sin2;{	return (in_netof(sin1->sin_addr) == in_netof(sin2->sin_addr));}/* * The following routines, in_netof, and in_lnaof, * are similar to the corresponding routines in inetLib, except that * these routines take subnet masks into account. *//* * Return the network number from an internet address. */u_longin_netof(in)	struct in_addr in;{	register u_long i = ntohl(in.s_addr);	register u_long net;	register struct in_ifaddr *ia;	if (IN_CLASSA(i))		net = i & IN_CLASSA_NET; 	else if (IN_CLASSB(i))		net = i & IN_CLASSB_NET;	else if (IN_CLASSC(i))		net = i & IN_CLASSC_NET;	else if (IN_CLASSD(i))		net = i & IN_CLASSD_NET;	else		return (0);	/*	 * Check whether network is a subnet;	 * if so, return subnet number.	 */	for (ia = in_ifaddr; ia; ia = ia->ia_next)		if (net == ia->ia_net)			return (i & ia->ia_subnetmask);	return (net);}/* * Return 1 if an internet address is for a ``local'' host * (one to which we have a connection).  If subnetsarelocal * is true, this includes other subnets of the local net. * Otherwise, it includes only the directly-connected (sub)nets. */intin_localaddr(in)	struct in_addr in;{	register u_long i = ntohl(in.s_addr);	register struct in_ifaddr *ia;	if (subnetsarelocal) {		for (ia = in_ifaddr; ia; ia = ia->ia_next)			if ((i & ia->ia_netmask) == ia->ia_net)				return (1);	} else {		for (ia = in_ifaddr; ia; ia = ia->ia_next)			if ((i & ia->ia_subnetmask) == ia->ia_subnet)				return (1);	}	return (0);}/* * Determine whether an IP address is in a reserved set of addresses * that may not be forwarded, or whether datagrams to that destination * may be forwarded. */intin_canforward(in)	struct in_addr in;{	register u_long i = ntohl(in.s_addr);	register u_long net;	if (IN_EXPERIMENTAL(i) || IN_MULTICAST(i))		return (0);	if (IN_CLASSA(i)) {		net = i & IN_CLASSA_NET;		if (net == 0 || net == (IN_LOOPBACKNET << IN_CLASSA_NSHIFT))			return (0);	}	return (1);}/* * Trim a mask in a sockaddr */voidin_socktrim(ap)struct sockaddr_in *ap;{    register char *cplim = (char *) &ap->sin_addr;    register char *cp = (char *) (&ap->sin_addr + 1);    ap->sin_len = 0;    while (--cp >= cplim)        if (*cp) {	    (ap)->sin_len = cp - (char *) (ap) + 1;	    break;	}}/* * Return the host portion of an internet address. */u_longin_lnaof(in)        struct in_addr in;{        register u_long i = ntohl(in.s_addr);        register u_long net, host;        register struct in_ifaddr *ia;        if (IN_CLASSA(i)) {                net = i & IN_CLASSA_NET;                host = i & IN_CLASSA_HOST;        } else if (IN_CLASSB(i)) {                net = i & IN_CLASSB_NET;                host = i & IN_CLASSB_HOST;        } else if (IN_CLASSC(i)) {                net = i & IN_CLASSC_NET;                host = i & IN_CLASSC_HOST;        } else if (IN_CLASSD(i)) {                net = i & IN_CLASSD_NET;                host = i & IN_CLASSD_HOST;        } else                return (i);        /*         * Check whether network is a subnet;         * if so, use the modified interpretation of `host'.         */        for (ia = in_ifaddr; ia; ia = ia->ia_next)                if (net == ia->ia_net)                        return (host &~ ia->ia_subnetmask);        return (host);}/* * Generic internet control operations (ioctl's). * Ifp is 0 if not an interface-specific ioctl. *//* ARGSUSED */intin_control(so, cmd, data, ifp)	struct socket *so;	u_long cmd;	caddr_t data;	register struct ifnet *ifp;{	register struct ifreq *ifr = (struct ifreq *)data;	register struct in_ifaddr *ia = 0;	register struct ifaddr *ifa;	struct in_ifaddr *oia;	struct in_aliasreq *ifra = (struct in_aliasreq *)data;	struct sockaddr_in oldaddr;	int error, hostIsNew, maskIsNew;	u_long i;	/*	 * Find address for this interface, if it exists.	 */	if (ifp)		for (ia = in_ifaddr; ia; ia = ia->ia_next)			if (ia->ia_ifp == ifp)				break;	switch (cmd) {	case SIOCAIFADDR:	case SIOCDIFADDR:		if (ifra->ifra_addr.sin_family == AF_INET)		    for (oia = ia; ia; ia = ia->ia_next) {			if (ia->ia_ifp == ifp  &&			    ia->ia_addr.sin_addr.s_addr ==				ifra->ifra_addr.sin_addr.s_addr)			    break;		}		if (cmd == SIOCDIFADDR && ia == 0)			return (EADDRNOTAVAIL);		/* FALLTHROUGH */	case SIOCSIFADDR:	case SIOCSIFNETMASK:	case SIOCSIFDSTADDR:		if ((so->so_state & SS_PRIV) == 0)			return (EPERM);		if (ifp == 0)			panic("in_control");		if (ia == (struct in_ifaddr *)0) {			MALLOC (oia, struct in_ifaddr *, sizeof(*oia),				MT_IFADDR, M_WAIT); 			if (oia == (struct in_ifaddr *)NULL)				return (ENOBUFS);			bzero((caddr_t)oia, sizeof *oia);			if ((ia = in_ifaddr)) {				for ( ; ia->ia_next; ia = ia->ia_next)					continue;				ia->ia_next = oia;			} else				in_ifaddr = oia;			ia = oia;			if ((ifa = ifp->if_addrlist)) {				for ( ; ifa->ifa_next; ifa = ifa->ifa_next)					continue;				ifa->ifa_next = (struct ifaddr *) ia;			} else				ifp->if_addrlist = (struct ifaddr *) ia;			ia->ia_ifa.ifa_addr = (struct sockaddr *)&ia->ia_addr;			ia->ia_ifa.ifa_dstaddr					= (struct sockaddr *)&ia->ia_dstaddr;			ia->ia_ifa.ifa_netmask					= (struct sockaddr *)&ia->ia_sockmask;			ia->ia_sockmask.sin_len = 8;			if (ifp->if_flags & IFF_BROADCAST) {				ia->ia_broadaddr.sin_len = sizeof(ia->ia_addr);				ia->ia_broadaddr.sin_family = AF_INET;			}			ia->ia_ifp = ifp;			if (ifp != &loif)				in_interfaces++;		}		break;	case SIOCSIFBRDADDR:		if ((so->so_state & SS_PRIV) == 0)			return (EPERM);		/* FALLTHROUGH */	case SIOCGIFADDR:	case SIOCGIFNETMASK:	case SIOCGIFDSTADDR:	case SIOCGIFBRDADDR:		if (ia == (struct in_ifaddr *)0)			return (EADDRNOTAVAIL);		break;	}	switch (cmd) {	case SIOCGIFADDR:		*((struct sockaddr_in *)&ifr->ifr_addr) = ia->ia_addr;		break;	case SIOCGIFBRDADDR:		if ((ifp->if_flags & IFF_BROADCAST) == 0)			return (EINVAL);		*((struct sockaddr_in *)&ifr->ifr_dstaddr) = ia->ia_broadaddr;		break;	case SIOCGIFDSTADDR:		if ((ifp->if_flags & IFF_POINTOPOINT) == 0)			return (EINVAL);		*((struct sockaddr_in *)&ifr->ifr_dstaddr) = ia->ia_dstaddr;		break;	case SIOCGIFNETMASK:		*((struct sockaddr_in *)&ifr->ifr_addr) = ia->ia_sockmask;		break;	case SIOCSIFDSTADDR:		if ((ifp->if_flags & IFF_POINTOPOINT) == 0)			return (EINVAL);		oldaddr = ia->ia_dstaddr;		ia->ia_dstaddr = *(struct sockaddr_in *)&ifr->ifr_dstaddr;		if (ifp->if_ioctl && (error = (*ifp->if_ioctl)					(ifp, SIOCSIFDSTADDR, (caddr_t)ia))) {			ia->ia_dstaddr = oldaddr;			return (error);		}		if (ia->ia_flags & IFA_ROUTE) {			ia->ia_ifa.ifa_dstaddr = (struct sockaddr *)&oldaddr;			rtinit(&(ia->ia_ifa), (int)RTM_DELETE, RTF_HOST);			ia->ia_ifa.ifa_dstaddr =					(struct sockaddr *)&ia->ia_dstaddr;			rtinit(&(ia->ia_ifa), (int)RTM_ADD, RTF_HOST|RTF_UP);		}		break;	case SIOCSIFBRDADDR:		if ((ifp->if_flags & IFF_BROADCAST) == 0)			return (EINVAL);		ia->ia_broadaddr = *(struct sockaddr_in *)&ifr->ifr_broadaddr;		break;	case SIOCSIFADDR:		return (in_ifinit(ifp, ia,		    (struct sockaddr_in *) &ifr->ifr_addr, 1));	case SIOCSIFNETMASK:		i = ifra->ifra_addr.sin_addr.s_addr;		ia->ia_subnetmask = ntohl(ia->ia_sockmask.sin_addr.s_addr = i);		in_socktrim (&ia->ia_sockmask);		break;	case SIOCAIFADDR:		maskIsNew = 0;		hostIsNew = 1;		error = 0;		if (ia->ia_addr.sin_family == AF_INET) {			if (ifra->ifra_addr.sin_len == 0) {				ifra->ifra_addr = ia->ia_addr;				hostIsNew = 0;			} else if (ifra->ifra_addr.sin_addr.s_addr ==					       ia->ia_addr.sin_addr.s_addr)				hostIsNew = 0;		}		if (ifra->ifra_mask.sin_len) {			in_ifscrub(ifp, ia);			ia->ia_sockmask = ifra->ifra_mask;			ia->ia_subnetmask =			     ntohl(ia->ia_sockmask.sin_addr.s_addr);			maskIsNew = 1;		}		if ((ifp->if_flags & IFF_POINTOPOINT) &&		    (ifra->ifra_dstaddr.sin_family == AF_INET)) {			in_ifscrub(ifp, ia);			ia->ia_dstaddr = ifra->ifra_dstaddr;			maskIsNew  = 1; /* We lie; but the effect's the same */		}		if (ifra->ifra_addr.sin_family == AF_INET &&		    (hostIsNew || maskIsNew))			error = in_ifinit(ifp, ia, &ifra->ifra_addr, 0);                /* ia->ia_broadaddr isn't overwrited in case of      */                /* ifra->ifra_broadaddr.sin_addr.s_addr isn't set by */                /* the caller                                        */                if ((ifp->if_flags & IFF_BROADCAST) &&                    (ifra->ifra_broadaddr.sin_family == AF_INET) &&                    (ifra->ifra_broadaddr.sin_addr.s_addr))                        ia->ia_broadaddr = ifra->ifra_broadaddr;		return (error);	case SIOCDIFADDR:		in_ifscrub(ifp, ia);		if ((ifa = ifp->if_addrlist) == (struct ifaddr *)ia)			ifp->if_addrlist = ifa->ifa_next;		else {			while (ifa->ifa_next &&			       (ifa->ifa_next != (struct ifaddr *)ia))				    ifa = ifa->ifa_next;			if (ifa->ifa_next)				ifa->ifa_next = ((struct ifaddr *)ia)->ifa_next;			else				logMsg("Couldn't unlink inifaddr from ifp\n",				       0,0,0,0,0,0);		}		oia = ia;		if (oia == (ia = in_ifaddr))			in_ifaddr = ia->ia_next;		else {			while (ia->ia_next && (ia->ia_next != oia))				ia = ia->ia_next;			if (ia->ia_next)				ia->ia_next = oia->ia_next;			else