/*
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* 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 project 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 PROJECT 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 PROJECT 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.
*/
/*-
* Copyright (c) 1998 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Public Access Networks Corporation ("Panix"). It was developed under
* contract to Panix by Eric Haszlakiewicz and Thor Lancelot Simon.
*
* 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 THE NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
*/
/*
* 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. 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
*/
static int subnetsarelocal = SUBNETSARELOCAL;
static int hostzeroisbroadcast = HOSTZEROBROADCAST;
/*
* This list is used to keep track of in_multi chains which belong to
* deleted interface addresses. We use in_ifaddr so that a chain head
* won't be deallocated until all multicast address record are deleted.
*/
LIST_HEAD(in_multihashhead, in_multi); /* Type of the hash head */
/*
* 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.
*/
int
in_localaddr(struct in_addr in)
{
struct in_ifaddr *ia;
int localaddr = 0;
int s = pserialize_read_enter();
/*
* 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.
*/
int
in_canforward(struct in_addr in)
{
u_int32_t net;
if (IN_EXPERIMENTAL(in.s_addr) || IN_MULTICAST(in.s_addr))
return (0);
if (IN_CLASSA(in.s_addr)) {
net = in.s_addr & IN_CLASSA_NET;
if (net == 0 || net == htonl(IN_LOOPBACKNET << IN_CLASSA_NSHIFT))
return (0);
}
return (1);
}
/*
* Trim a mask in a sockaddr
*/
void
in_socktrim(struct sockaddr_in *ap)
{
char *cplim = (char *) &ap->sin_addr;
char *cp = (char *) (&ap->sin_addr + 1);
/*
* Maintain the "in_maxmtu" variable, which is the largest
* mtu for non-local interfaces with AF_INET addresses assigned
* to them that are up.
*/
unsigned long in_maxmtu;
void
in_setmaxmtu(void)
{
struct in_ifaddr *ia;
struct ifnet *ifp;
unsigned long maxmtu = 0;
int s = pserialize_read_enter();
IN_ADDRLIST_READER_FOREACH(ia) {
if ((ifp = ia->ia_ifp) == 0)
continue;
if ((ifp->if_flags & (IFF_UP|IFF_LOOPBACK)) != IFF_UP)
continue;
if (ifp->if_mtu > maxmtu)
maxmtu = ifp->if_mtu;
}
if (maxmtu)
in_maxmtu = maxmtu;
pserialize_read_exit(s);
}
bound = curlwp_bind();
/*
* Find address for this interface, if it exists.
*/
if (ifp != NULL)
ia = in_get_ia_from_ifp_psref(ifp, &psref);
hostIsNew = 1; /* moved here to appease gcc */
switch (cmd) {
case SIOCAIFADDR:
case SIOCDIFADDR:
case SIOCGIFALIAS:
case SIOCGIFAFLAG_IN:
if (ifra->ifra_addr.sin_family == AF_INET) {
int s;
if (ia != NULL)
ia4_release(ia, &psref);
s = pserialize_read_enter();
IN_ADDRHASH_READER_FOREACH(ia,
ifra->ifra_addr.sin_addr.s_addr) {
if (ia->ia_ifp == ifp &&
in_hosteq(ia->ia_addr.sin_addr,
ifra->ifra_addr.sin_addr))
break;
}
if (ia != NULL)
ia4_acquire(ia, &psref);
pserialize_read_exit(s);
}
if ((cmd == SIOCDIFADDR ||
cmd == SIOCGIFALIAS ||
cmd == SIOCGIFAFLAG_IN) &&
ia == NULL) {
error = EADDRNOTAVAIL;
goto out;
}
if (cmd == SIOCDIFADDR &&
ifra->ifra_addr.sin_family == AF_UNSPEC) {
ifra->ifra_addr.sin_family = AF_INET;
}
/* FALLTHROUGH */
case SIOCSIFADDR:
if (ia == NULL || ia->ia_addr.sin_family != AF_INET)
;
else if (ifra->ifra_addr.sin_len == 0) {
ifra->ifra_addr = ia->ia_addr;
hostIsNew = 0;
} else if (in_hosteq(ia->ia_addr.sin_addr,
ifra->ifra_addr.sin_addr))
hostIsNew = 0;
if (ifra->ifra_addr.sin_family != AF_INET) {
error = EAFNOSUPPORT;
goto out;
}
/* FALLTHROUGH */
case SIOCSIFDSTADDR:
if (cmd == SIOCSIFDSTADDR &&
ifreq_getaddr(cmd, ifr)->sa_family != AF_INET) {
error = EAFNOSUPPORT;
goto out;
}
/* FALLTHROUGH */
case SIOCSIFNETMASK:
if (ifp == NULL)
panic("in_control");
if (cmd == SIOCGIFALIAS || cmd == SIOCGIFAFLAG_IN)
break;
case SIOCGIFADDR:
case SIOCGIFNETMASK:
case SIOCGIFDSTADDR:
case SIOCGIFBRDADDR:
if (ia == NULL) {
error = EADDRNOTAVAIL;
goto out;
}
break;
}
error = 0;
switch (cmd) {
case SIOCGIFADDR:
ifreq_setaddr(cmd, ifr, sintocsa(&ia->ia_addr));
break;
case SIOCGIFBRDADDR:
if ((ifp->if_flags & IFF_BROADCAST) == 0) {
error = EINVAL;
goto out;
}
ifreq_setdstaddr(cmd, ifr, sintocsa(&ia->ia_broadaddr));
break;
case SIOCGIFDSTADDR:
if ((ifp->if_flags & IFF_POINTOPOINT) == 0) {
error = EINVAL;
goto out;
}
ifreq_setdstaddr(cmd, ifr, sintocsa(&ia->ia_dstaddr));
break;
case SIOCGIFNETMASK:
/*
* We keep the number of trailing zero bytes the sin_len field
* of ia_sockmask, so we fix this before we pass it back to
* userland.
*/
oldaddr = ia->ia_sockmask;
oldaddr.sin_len = sizeof(struct sockaddr_in);
ifreq_setaddr(cmd, ifr, (const void *)&oldaddr);
break;
case SIOCGIFAFLAG_IN:
ifr->ifr_addrflags = ia->ia4_flags;
break;
case SIOCDIFADDR:
ia4_release(ia, &psref);
ifaref(&ia->ia_ifa);
in_purgeaddr(&ia->ia_ifa);
pfil_run_addrhooks(if_pfil, cmd, &ia->ia_ifa);
ifafree(&ia->ia_ifa);
ia = NULL;
break;
#ifdef MROUTING
case SIOCGETVIFCNT:
case SIOCGETSGCNT:
error = mrt_ioctl(so, cmd, data);
break;
#endif /* MROUTING */
default:
error = ENOTTY;
goto out;
}
/*
* XXX insert regardless of error to make in_purgeaddr below work.
* Need to improve.
*/
if (newifaddr) {
ifaref(&ia->ia_ifa);
ifa_insert(ifp, &ia->ia_ifa);
mutex_enter(&in_ifaddr_lock);
TAILQ_INSERT_TAIL(&in_ifaddrhead, ia, ia_list);
IN_ADDRLIST_WRITER_INSERT_TAIL(ia);
in_addrhash_insert_locked(ia);
/* Release a reference that is held just after creation. */
ifafree(&ia->ia_ifa);
mutex_exit(&in_ifaddr_lock);
} else if (need_reinsert) {
in_addrhash_insert(ia);
}
if (error == 0) {
if (run_hook)
pfil_run_addrhooks(if_pfil, cmd, &ia->ia_ifa);
} else if (newifaddr) {
KASSERT(ia != NULL);
in_purgeaddr(&ia->ia_ifa);
ia = NULL;
}
out:
if (!newifaddr && ia != NULL)
ia4_release(ia, &psref);
curlwp_bindx(bound);
return error;
}
int
in_control(struct socket *so, u_long cmd, void *data, struct ifnet *ifp)
{
int error;
ia = (struct in_ifaddr *)ifa;
if ((ia->ia_ifp->if_flags & IFF_UNNUMBERED)) {
rt_addrmsg(RTM_NEWADDR, ifa);
return;
}
if (ia->ia_addr.sin_addr.s_addr == INADDR_ANY ||
(ia->ia_ifp->if_flags & IFF_POINTOPOINT &&
in_hosteq(ia->ia_dstaddr.sin_addr, ia->ia_addr.sin_addr)))
{
rt_addrmsg(RTM_NEWADDR, ifa);
return;
}
rt_ifa_addlocal(ifa);
}
/* Remove loopback entry of ownaddr */
static void
in_ifremlocal(struct ifaddr *ifa)
{
struct in_ifaddr *ia, *p;
struct ifaddr *alt_ifa = NULL;
int ia_count = 0;
int s;
struct psref psref;
int bound = curlwp_bind();
ia = (struct in_ifaddr *)ifa;
if ((ia->ia_ifp->if_flags & IFF_UNNUMBERED)) {
rt_addrmsg(RTM_DELADDR, ifa);
goto out;
}
/* Delete the entry if exactly one ifaddr matches the
* address, ifa->ifa_addr. */
s = pserialize_read_enter();
IN_ADDRLIST_READER_FOREACH(p) {
if ((p->ia_ifp->if_flags & IFF_UNNUMBERED))
continue;
if (!in_hosteq(p->ia_addr.sin_addr, ia->ia_addr.sin_addr))
continue;
if (p->ia_ifp != ia->ia_ifp)
alt_ifa = &p->ia_ifa;
if (++ia_count > 1 && alt_ifa != NULL)
break;
}
if (alt_ifa != NULL && ia_count > 1)
ifa_acquire(alt_ifa, &psref);
pserialize_read_exit(s);
/*
* Depends on it isn't called in concurrent. It should be guaranteed
* by ifa->ifa_ifp's ioctl lock. The possible callers are in_control
* and if_purgeaddrs; the former is called iva ifa->ifa_ifp's ioctl
* and the latter is called via ifa->ifa_ifp's if_detach. The functions
* never be executed in concurrent.
*/
void
in_purgeaddr(struct ifaddr *ifa)
{
struct in_ifaddr *ia = (void *) ifa;
struct ifnet *ifp = ifa->ifa_ifp;
/* KASSERT(!ifa_held(ifa)); XXX need ifa_not_held (psref_not_held) */
/*
* SIOC[GAD]LIFADDR.
* SIOCGLIFADDR: get first address. (???)
* SIOCGLIFADDR with IFLR_PREFIX:
* get first address that matches the specified prefix.
* SIOCALIFADDR: add the specified address.
* SIOCALIFADDR with IFLR_PREFIX:
* EINVAL since we can't deduce hostid part of the address.
* SIOCDLIFADDR: delete the specified address.
* SIOCDLIFADDR with IFLR_PREFIX:
* delete the first address that matches the specified prefix.
* return values:
* EINVAL on invalid parameters
* EADDRNOTAVAIL on prefix match failed/specified address not found
* other values may be returned from in_ioctl()
*/
static int
in_lifaddr_ioctl(struct socket *so, u_long cmd, void *data,
struct ifnet *ifp)
{
struct if_laddrreq *iflr = (struct if_laddrreq *)data;
struct ifaddr *ifa;
struct sockaddr *sa;
/* sanity checks */
if (data == NULL || ifp == NULL) {
panic("invalid argument to in_lifaddr_ioctl");
/*NOTRECHED*/
}
switch (cmd) {
case SIOCGLIFADDR:
/* address must be specified on GET with IFLR_PREFIX */
if ((iflr->flags & IFLR_PREFIX) == 0)
break;
/*FALLTHROUGH*/
case SIOCALIFADDR:
case SIOCDLIFADDR:
/* address must be specified on ADD and DELETE */
sa = (struct sockaddr *)&iflr->addr;
if (sa->sa_family != AF_INET)
return EINVAL;
if (sa->sa_len != sizeof(struct sockaddr_in))
return EINVAL;
/* XXX need improvement */
sa = (struct sockaddr *)&iflr->dstaddr;
if (sa->sa_family != AF_UNSPEC && sa->sa_family != AF_INET)
return EINVAL;
if (sa->sa_len != 0 && sa->sa_len != sizeof(struct sockaddr_in))
return EINVAL;
break;
default: /*shouldn't happen*/
#if 0
panic("invalid cmd to in_lifaddr_ioctl");
/*NOTREACHED*/
#else
return EOPNOTSUPP;
#endif
}
if (sizeof(struct in_addr) * NBBY < iflr->prefixlen)
return EINVAL;
switch (cmd) {
case SIOCALIFADDR:
{
struct in_aliasreq ifra;
/* if you set extra bits, that's wrong */
if (match.s_addr != sin->sin_addr.s_addr)
return EINVAL;
cmp = 1;
} else {
if (cmd == SIOCGLIFADDR) {
/* on getting an address, take the 1st match */
cmp = 0; /*XXX*/
} else {
/* on deleting an address, do exact match */
in_len2mask(&mask, 32);
sin = (struct sockaddr_in *)&iflr->addr;
match.s_addr = sin->sin_addr.s_addr;
cmp = 1;
}
}
s = pserialize_read_enter();
IFADDR_READER_FOREACH(ifa, ifp) {
if (ifa->ifa_addr->sa_family != AF_INET)
continue;
if (cmp == 0)
break;
candidate.s_addr = ((struct sockaddr_in *)ifa->ifa_addr)->sin_addr.s_addr;
candidate.s_addr &= mask.s_addr;
if (candidate.s_addr == match.s_addr)
break;
}
if (ifa == NULL) {
pserialize_read_exit(s);
return EADDRNOTAVAIL;
}
ia = (struct in_ifaddr *)ifa;
if (cmd == SIOCGLIFADDR) {
/* fill in the if_laddrreq structure */
memcpy(&iflr->addr, &ia->ia_addr, ia->ia_addr.sin_len);
/*
* Initialize an interface's internet address
* and routing table entry.
*/
int
in_ifinit(struct ifnet *ifp, struct in_ifaddr *ia,
const struct sockaddr_in *sin, const struct sockaddr_in *dst, int scrub)
{
u_int32_t i;
struct sockaddr_in oldaddr, olddst;
int s, oldflags, flags = RTF_UP, error, hostIsNew;
if (sin == NULL)
sin = &ia->ia_addr;
if (dst == NULL)
dst = &ia->ia_dstaddr;
/*
* Set up new addresses.
*/
oldaddr = ia->ia_addr;
olddst = ia->ia_dstaddr;
oldflags = ia->ia4_flags;
ia->ia_addr = *sin;
ia->ia_dstaddr = *dst;
hostIsNew = oldaddr.sin_family != AF_INET ||
!in_hosteq(ia->ia_addr.sin_addr, oldaddr.sin_addr);
if (!scrub)
scrub = oldaddr.sin_family != ia->ia_dstaddr.sin_family ||
!in_hosteq(ia->ia_dstaddr.sin_addr, olddst.sin_addr);
/*
* Configure address flags.
* We need to do this early because they may be adjusted
* by if_addr_init depending on the address.
*/
if (ia->ia4_flags & IN_IFF_DUPLICATED) {
ia->ia4_flags &= ~IN_IFF_DUPLICATED;
hostIsNew = 1;
}
if (ifp->if_link_state == LINK_STATE_DOWN) {
ia->ia4_flags |= IN_IFF_DETACHED;
ia->ia4_flags &= ~IN_IFF_TENTATIVE;
} else if (hostIsNew && if_do_dad(ifp) && ip_dad_enabled())
ia->ia4_flags |= IN_IFF_TRYTENTATIVE;
/*
* Give the interface a chance to initialize
* if this is its first address,
* and to validate the address if necessary.
*/
s = splsoftnet();
error = if_addr_init(ifp, &ia->ia_ifa, true);
splx(s);
/* Now clear the try tentative flag, its job is done. */
ia->ia4_flags &= ~IN_IFF_TRYTENTATIVE;
if (error != 0) {
ia->ia_addr = oldaddr;
ia->ia_dstaddr = olddst;
ia->ia4_flags = oldflags;
return error;
}
/*
* The interface which does not have IPv4 address is not required
* to scrub old address. So, skip scrub such cases.
*/
if (oldaddr.sin_family == AF_INET && (scrub || hostIsNew)) {
int newflags = ia->ia4_flags;
i = ia->ia_addr.sin_addr.s_addr;
if (ifp->if_flags & IFF_POINTOPOINT)
ia->ia_netmask = INADDR_BROADCAST; /* default to /32 */
else if (IN_CLASSA(i))
ia->ia_netmask = IN_CLASSA_NET;
else if (IN_CLASSB(i))
ia->ia_netmask = IN_CLASSB_NET;
else
ia->ia_netmask = IN_CLASSC_NET;
/*
* The subnet mask usually includes at least the standard network part,
* but may may be smaller in the case of supernetting.
* If it is set, we believe it.
*/
if (ia->ia_subnetmask == 0) {
ia->ia_subnetmask = ia->ia_netmask;
ia->ia_sockmask.sin_addr.s_addr = ia->ia_subnetmask;
} else
ia->ia_netmask &= ia->ia_subnetmask;
ia->ia_net = i & ia->ia_netmask;
ia->ia_subnet = i & ia->ia_subnetmask;
in_socktrim(&ia->ia_sockmask);
/* re-calculate the "in_maxmtu" value */
in_setmaxmtu();
/* Add the local route to the address */
in_ifaddlocal(&ia->ia_ifa);
/* Add the prefix route for the address */
error = in_addprefix(ia, flags);
/*
* If the interface supports multicast, join the "all hosts"
* multicast group on that interface.
*/
mutex_enter(&in_ifaddr_lock);
if ((ifp->if_flags & IFF_MULTICAST) != 0 && ia->ia_allhosts == NULL) {
struct in_addr addr;
/*
* add a route to prefix ("connected route" in cisco terminology).
* does nothing if there's some interface address with the same prefix already.
*/
static int
in_addprefix(struct in_ifaddr *target, int flags)
{
struct in_ifaddr *ia;
struct in_addr prefix, mask, p;
int error;
int s;
s = pserialize_read_enter();
IN_ADDRLIST_READER_FOREACH(ia) {
if (rtinitflags(ia))
p = ia->ia_dstaddr.sin_addr;
else {
p = ia->ia_addr.sin_addr;
p.s_addr &= ia->ia_sockmask.sin_addr.s_addr;
}
if (prefix.s_addr != p.s_addr)
continue;
if ((ia->ia_ifp->if_flags & IFF_UNNUMBERED))
continue;
/*
* if we got a matching prefix route inserted by other
* interface address, we don't need to bother
*
* XXX RADIX_MPATH implications here? -dyoung
*/
if (ia->ia_flags & IFA_ROUTE) {
pserialize_read_exit(s);
return 0;
}
}
pserialize_read_exit(s);
/*
* noone seem to have prefix route. insert it.
*/
if (target->ia_ifa.ifa_ifp->if_flags & IFF_UNNUMBERED) {
error = 0;
} else {
error = rtinit(&target->ia_ifa, RTM_ADD, flags);
if (error == 0)
target->ia_flags |= IFA_ROUTE;
else if (error == EEXIST) {
/*
* the fact the route already exists is not an error.
*/
error = 0;
}
}
return error;
}
/*
* remove a route to prefix ("connected route" in cisco terminology).
* re-installs the route by using another interface address, if there's one
* with the same prefix (otherwise we lose the route mistakenly).
*/
static int
in_scrubprefix(struct in_ifaddr *target)
{
struct in_ifaddr *ia;
struct in_addr prefix, mask, p;
int error;
int s;
/* If we don't have IFA_ROUTE we have nothing to do */
if ((target->ia_flags & IFA_ROUTE) == 0)
return 0;
s = pserialize_read_enter();
IN_ADDRLIST_READER_FOREACH(ia) {
if (rtinitflags(ia))
p = ia->ia_dstaddr.sin_addr;
else {
p = ia->ia_addr.sin_addr;
p.s_addr &= ia->ia_sockmask.sin_addr.s_addr;
}
if (prefix.s_addr != p.s_addr)
continue;
if ((ia->ia_ifp->if_flags & IFF_UNNUMBERED))
continue;
/*
* if we got a matching prefix route, move IFA_ROUTE to him
*/
if ((ia->ia_flags & IFA_ROUTE) == 0) {
struct psref psref;
int bound = curlwp_bind();
if (!ISSET(target->ia_ifa.ifa_flags, IFA_DESTROYING))
goto skip;
/*
* Replace rt_ifa of routes that have the removing address
* with the new address.
*/
rt_replace_ifa_matched_entries(AF_INET,
in_rt_ifa_matcher, &target->ia_ifa, &ia->ia_ifa);
/*
* noone seem to have prefix route. remove it.
*/
rtinit(&target->ia_ifa, RTM_DELETE, rtinitflags(target));
target->ia_flags &= ~IFA_ROUTE;
if (ISSET(target->ia_ifa.ifa_flags, IFA_DESTROYING)) {
/* Remove routes that have the removing address as rt_ifa. */
rt_delete_matched_entries(AF_INET, in_rt_ifa_matcher,
&target->ia_ifa, true);
}
return 0;
}
#undef rtinitflags
/*
* Return 1 if the address might be a local broadcast address.
*/
int
in_broadcast(struct in_addr in, struct ifnet *ifp)
{
struct ifaddr *ifa;
int s;
KASSERT(ifp != NULL);
if (in.s_addr == INADDR_BROADCAST ||
in_nullhost(in))
return 1;
if ((ifp->if_flags & IFF_BROADCAST) == 0)
return 0;
/*
* Look through the list of addresses for a match
* with a broadcast address.
*/
#define ia (ifatoia(ifa))
s = pserialize_read_enter();
IFADDR_READER_FOREACH(ifa, ifp) {
if (ifa->ifa_addr->sa_family == AF_INET &&
!in_hosteq(in, ia->ia_addr.sin_addr) &&
(in_hosteq(in, ia->ia_broadaddr.sin_addr) ||
in_hosteq(in, ia->ia_netbroadcast) ||
(hostzeroisbroadcast &&
/*
* Check for old-style (host 0) broadcast, but
* taking into account that RFC 3021 obsoletes it.
*/
ia->ia_subnetmask != IN_RFC3021_MASK &&
(in.s_addr == ia->ia_subnet ||
in.s_addr == ia->ia_net)))) {
pserialize_read_exit(s);
return 1;
}
}
pserialize_read_exit(s);
return (0);
#undef ia
}
/*
* perform DAD when interface becomes IFF_UP.
*/
void
in_if_link_up(struct ifnet *ifp)
{
struct ifaddr *ifa;
struct in_ifaddr *ia;
int s, bound;
/* Ensure it's sane to run DAD */
if (ifp->if_link_state == LINK_STATE_DOWN)
return;
if ((ifp->if_flags & (IFF_UP|IFF_RUNNING)) != (IFF_UP|IFF_RUNNING))
return;
if (ifa->ifa_addr->sa_family != AF_INET)
continue;
ifa_acquire(ifa, &psref);
pserialize_read_exit(s);
ia = (struct in_ifaddr *)ifa;
/* If detached then mark as tentative */
if (ia->ia4_flags & IN_IFF_DETACHED) {
ia->ia4_flags &= ~IN_IFF_DETACHED;
if (if_do_dad(ifp) && ia->ia_dad_start != NULL)
ia->ia4_flags |= IN_IFF_TENTATIVE;
else if ((ia->ia4_flags & IN_IFF_TENTATIVE) == 0)
rt_addrmsg(RTM_NEWADDR, ifa);
}
if (ia->ia4_flags & IN_IFF_TENTATIVE) {
/* Clear the duplicated flag as we're starting DAD. */
ia->ia4_flags &= ~IN_IFF_DUPLICATED;
ia->ia_dad_start(ifa);
}
s = pserialize_read_enter();
ifa_release(ifa, &psref);
}
pserialize_read_exit(s);
curlwp_bindx(bound);
}
void
in_if_up(struct ifnet *ifp)
{
/* interface may not support link state, so bring it up also */
in_if_link_up(ifp);
}
/*
* Mark all addresses as detached.
*/
void
in_if_link_down(struct ifnet *ifp)
{
struct ifaddr *ifa;
struct in_ifaddr *ia;
int s, bound;
void
in_if_link_state_change(struct ifnet *ifp, int link_state)
{
/*
* Treat LINK_STATE_UNKNOWN as UP.
* LINK_STATE_UNKNOWN transitions to LINK_STATE_DOWN when
* if_link_state_change() transitions to LINK_STATE_UP.
*/
if (link_state == LINK_STATE_DOWN)
in_if_link_down(ifp);
else
in_if_link_up(ifp);
}
/*
* in_lookup_multi: look up the in_multi record for a given IP
* multicast address on a given interface. If no matching record is
* found, return NULL.
*/
struct in_multi *
in_lookup_multi(struct in_addr addr, ifnet_t *ifp)
{
struct in_multi *inm;
/*
* in_multi_group: check whether the address belongs to an IP multicast
* group we are joined on this interface. Returns true or false.
*/
bool
in_multi_group(struct in_addr addr, ifnet_t *ifp, int flags)
{
bool ingroup;
/*
* Add an address to the list of IP multicast addresses for a given interface.
*/
struct in_multi *
in_addmulti(struct in_addr *ap, ifnet_t *ifp)
{
struct sockaddr_in sin;
struct in_multi *inm;
/*
* See if address already in list.
*/
rw_enter(&in_multilock, RW_WRITER);
inm = in_lookup_multi(*ap, ifp);
if (inm != NULL) {
/*
* Found it; just increment the reference count.
*/
inm->inm_refcount++;
rw_exit(&in_multilock);
return inm;
}
/*
* New address; allocate a new multicast record.
*/
inm = pool_get(&inmulti_pool, PR_NOWAIT);
if (inm == NULL) {
rw_exit(&in_multilock);
return NULL;
}
inm->inm_addr = *ap;
inm->inm_ifp = ifp;
inm->inm_refcount = 1;
/*
* Ask the network driver to update its multicast reception
* filter appropriately for the new address.
*/
sockaddr_in_init(&sin, ap, 0);
if (if_mcast_op(ifp, SIOCADDMULTI, sintosa(&sin)) != 0) {
rw_exit(&in_multilock);
pool_put(&inmulti_pool, inm);
return NULL;
}
/*
* Let IGMP know that we have joined a new IP multicast group.
*/
if (igmp_joingroup(inm) != 0) {
rw_exit(&in_multilock);
pool_put(&inmulti_pool, inm);
return NULL;
}
LIST_INSERT_HEAD(
&IN_MULTI_HASH(inm->inm_addr.s_addr, ifp),
inm, inm_list);
in_multientries++;
rw_exit(&in_multilock);
rw_enter(&in_multilock, RW_WRITER);
if (--inm->inm_refcount > 0) {
rw_exit(&in_multilock);
return;
}
/*
* No remaining claims to this record; let IGMP know that
* we are leaving the multicast group.
*/
igmp_leavegroup(inm);
/*
* Notify the network driver to update its multicast reception
* filter.
*/
sockaddr_in_init(&sin, &inm->inm_addr, 0);
if_mcast_op(inm->inm_ifp, SIOCDELMULTI, sintosa(&sin));
/*
* Unlink from list.
*/
LIST_REMOVE(inm, inm_list);
in_multientries--;
rw_exit(&in_multilock);
pool_put(&inmulti_pool, inm);
}
/*
* in_next_multi: step through all of the in_multi records, one at a time.
* The current position is remembered in "step", which the caller must
* provide. in_first_multi(), below, must be called to initialize "step"
* and get the first record. Both macros return a NULL "inm" when there
* are no remaining records.
*/
struct in_multi *
in_next_multi(struct in_multistep *step)
{
struct in_multi *inm;
KASSERT(ISSET(curlwp->l_pflag, LP_BOUND));
/*
* If route is known or can be allocated now, take the
* source address from the interface. Otherwise, punt.
*/
if ((soopts & SO_DONTROUTE) != 0)
rtcache_free(ro);
else {
union {
struct sockaddr dst;
struct sockaddr_in dst4;
} u;
sockaddr_in_init(&u.dst4, &sin->sin_addr, 0);
rt = rtcache_lookup(ro, &u.dst);
}
/*
* If we found a route, use the address
* corresponding to the outgoing interface
* unless it is the loopback (in case a route
* to our address on another net goes to loopback).
*
* XXX Is this still true? Do we care?
*/
if (rt != NULL && (rt->rt_ifp->if_flags & IFF_LOOPBACK) == 0) {
int s;
struct ifaddr *ifa;
/*
* Just in case. May not need to do this workaround.
* Revisit when working on rtentry MP-ification.
*/
s = pserialize_read_enter();
IFADDR_READER_FOREACH(ifa, rt->rt_ifp) {
if (ifa == rt->rt_ifa)
break;
}
if (ifa != NULL)
ifa_acquire(ifa, psref);
pserialize_read_exit(s);
ia = ifatoia(ifa);
}
if (ia == NULL) {
in_port_t fport = sin->sin_port;
struct ifaddr *ifa;
int s;
sin->sin_port = 0;
ifa = ifa_ifwithladdr_psref(sintosa(sin), psref);
sin->sin_port = fport;
if (ifa == NULL) {
/* Find 1st non-loopback AF_INET address */
s = pserialize_read_enter();
IN_ADDRLIST_READER_FOREACH(ia) {
if (!(ia->ia_ifp->if_flags & IFF_LOOPBACK))
break;
}
if (ia != NULL)
ia4_acquire(ia, psref);
pserialize_read_exit(s);
} else {
/* ia is already referenced by psref */
ia = ifatoia(ifa);
}
if (ia == NULL) {
*errorp = EADDRNOTAVAIL;
goto out;
}
}
/*
* If the destination address is multicast and an outgoing
* interface has been set as a multicast option, use the
* address of that interface as our source address.
*/
if (IN_MULTICAST(sin->sin_addr.s_addr) && mopts != NULL) {
struct ip_moptions *imo;
imo = mopts;
if (imo->imo_multicast_if_index != 0) {
struct ifnet *ifp;
int s;
if (ia != NULL)
ia4_release(ia, psref);
s = pserialize_read_enter();
ifp = if_byindex(imo->imo_multicast_if_index);
if (ifp != NULL) {
/* XXX */
ia = in_get_ia_from_ifp_psref(ifp, psref);
} else
ia = NULL;
if (ia == NULL || ia->ia4_flags & IN_IFF_NOTREADY) {
pserialize_read_exit(s);
if (ia != NULL)
ia4_release(ia, psref);
*errorp = EADDRNOTAVAIL;
ia = NULL;
goto out;
}
pserialize_read_exit(s);
}
}
if (ia->ia_ifa.ifa_getifa != NULL) {
ia = ifatoia((*ia->ia_ifa.ifa_getifa)(&ia->ia_ifa,
sintosa(sin)));
if (ia == NULL) {
*errorp = EADDRNOTAVAIL;
goto out;
}
/* FIXME NOMPSAFE */
ia4_acquire(ia, psref);
}
#ifdef GETIFA_DEBUG
else
printf("%s: missing ifa_getifa\n", __func__);
#endif
out:
rtcache_unref(rt, ro);
return ia;
}
int
in_tunnel_validate(const struct ip *ip, struct in_addr src, struct in_addr dst)
{
struct in_ifaddr *ia4;
int s;
/* check for address match */
if (src.s_addr != ip->ip_dst.s_addr ||
dst.s_addr != ip->ip_src.s_addr)
return 0;
/* martian filters on outer source - NOT done in ip_input! */
if (IN_MULTICAST(ip->ip_src.s_addr))
return 0;
switch ((ntohl(ip->ip_src.s_addr) & 0xff000000) >> 24) {
case 0:
case 127:
case 255:
return 0;
}
/* reject packets with broadcast on source */
s = pserialize_read_enter();
IN_ADDRLIST_READER_FOREACH(ia4) {
if ((ia4->ia_ifa.ifa_ifp->if_flags & IFF_BROADCAST) == 0)
continue;
if (ip->ip_src.s_addr == ia4->ia_broadaddr.sin_addr.s_addr) {
pserialize_read_exit(s);
return 0;
}
}
pserialize_read_exit(s);
/*
* Do actual deallocation of @lle.
* Called by LLE_FREE_LOCKED when number of references
* drops to zero.
*/
static void
in_lltable_destroy_lle(struct llentry *lle)
{
static int
in_lltable_rtcheck(struct ifnet *ifp, u_int flags, const struct sockaddr *l3addr,
const struct rtentry *rt)
{
int error = EINVAL;
if (rt == NULL)
return error;
/*
* If the gateway for an existing host route matches the target L3
* address, which is a special route inserted by some implementation
* such as MANET, and the interface is of the correct type, then
* allow for ARP to proceed.
*/
if (rt->rt_flags & RTF_GATEWAY) {
if (!(rt->rt_flags & RTF_HOST) || !rt->rt_ifp ||
rt->rt_ifp->if_type != IFT_ETHER ||
(rt->rt_ifp->if_flags & IFF_NOARP) != 0 ||
memcmp(rt->rt_gateway->sa_data, l3addr->sa_data,
sizeof(in_addr_t)) != 0) {
goto error;
}
}
/*
* Make sure that at least the destination address is covered
* by the route. This is for handling the case where 2 or more
* interfaces have the same prefix. An incoming packet arrives
* on one interface and the corresponding outgoing packet leaves
* another interface.
*/
if (!(rt->rt_flags & RTF_HOST) && rt->rt_ifp != ifp) {
const char *sa, *mask, *addr, *lim;
int len;
mask = (const char *)rt_mask(rt);
/*
* Just being extra cautious to avoid some custom
* code getting into trouble.
*/
if (mask == NULL)
goto error;
if (lle != NULL) {
LLE_WLOCK(lle);
return (lle);
}
/* no existing record, we need to create new one */
/*
* A route that covers the given address must have
* been installed 1st because we are doing a resolution,
* verify this.
*/
if (!(flags & LLE_IFADDR) &&
in_lltable_rtcheck(ifp, flags, l3addr, rt) != 0)
return (NULL);
lle = in_lltable_new(sin->sin_addr, flags);
if (lle == NULL) {
log(LOG_INFO, "lla_lookup: new lle malloc failed\n");
return (NULL);
}
lle->la_flags = flags;
if ((flags & LLE_IFADDR) == LLE_IFADDR) {
memcpy(&lle->ll_addr, CLLADDR(ifp->if_sadl), ifp->if_addrlen);
lle->la_flags |= (LLE_VALID | LLE_STATIC);
}
lltable_link_entry(llt, lle);
LLE_WLOCK(lle);
return (lle);
}
/*
* Return NULL if not found or marked for deletion.
* If found return lle read locked.
*/
static struct llentry *
in_lltable_lookup(struct lltable *llt, u_int flags, const struct sockaddr *l3addr)
{
const struct sockaddr_in *sin = (const struct sockaddr_in *)l3addr;
struct llentry *lle;
