2021-01-17 05:40:59 -08:00
|
|
|
/* $OpenBSD: dispatch.c,v 1.23 2021/01/17 13:40:59 claudio Exp $ */
|
2004-04-12 14:10:28 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright 2004 Henning Brauer <henning@openbsd.org>
|
|
|
|
* Copyright (c) 1995, 1996, 1997, 1998, 1999
|
|
|
|
* The Internet Software Consortium. 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 Internet Software Consortium 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 INTERNET SOFTWARE CONSORTIUM 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 INTERNET SOFTWARE CONSORTIUM 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.
|
|
|
|
*
|
|
|
|
* This software has been written for the Internet Software Consortium
|
|
|
|
* by Ted Lemon <mellon@fugue.com> in cooperation with Vixie
|
|
|
|
* Enterprises. To learn more about the Internet Software Consortium,
|
|
|
|
* see ``http://www.vix.com/isc''. To learn more about Vixie
|
|
|
|
* Enterprises, see ``http://www.vix.com''.
|
|
|
|
*/
|
|
|
|
|
2016-02-06 16:49:28 -08:00
|
|
|
#include <sys/types.h>
|
2004-04-12 14:10:28 -07:00
|
|
|
#include <sys/ioctl.h>
|
2016-02-06 16:49:28 -08:00
|
|
|
#include <sys/socket.h>
|
2004-04-12 14:10:28 -07:00
|
|
|
|
2016-02-06 16:49:28 -08:00
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/if_dl.h>
|
2004-04-12 14:10:28 -07:00
|
|
|
#include <net/if_media.h>
|
2009-09-03 04:56:49 -07:00
|
|
|
#include <net/if_types.h>
|
|
|
|
|
2016-02-06 16:49:28 -08:00
|
|
|
#include <netinet/in.h>
|
2017-03-15 07:31:49 -07:00
|
|
|
#include <netinet/if_ether.h>
|
2016-02-06 16:49:28 -08:00
|
|
|
|
|
|
|
#include <errno.h>
|
2004-04-12 14:10:28 -07:00
|
|
|
#include <ifaddrs.h>
|
2016-02-06 16:49:28 -08:00
|
|
|
#include <limits.h>
|
2004-04-12 14:10:28 -07:00
|
|
|
#include <poll.h>
|
2016-02-06 16:49:28 -08:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <syslog.h>
|
2016-08-26 18:26:22 -07:00
|
|
|
#include <time.h>
|
2016-02-06 16:49:28 -08:00
|
|
|
#include <unistd.h>
|
|
|
|
|
|
|
|
#include "dhcp.h"
|
|
|
|
#include "dhcpd.h"
|
2017-02-13 11:15:39 -08:00
|
|
|
#include "log.h"
|
2004-04-12 14:10:28 -07:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
/*
|
|
|
|
* Macros implementation used to generate link-local addresses. This
|
|
|
|
* code was copied from: sys/netinet6/in6_ifattach.c.
|
|
|
|
*/
|
|
|
|
#define EUI64_UBIT 0x02
|
|
|
|
#define EUI64_TO_IFID(in6) \
|
|
|
|
do { (in6)->s6_addr[8] ^= EUI64_UBIT; } while (0)
|
|
|
|
|
2004-04-12 14:10:28 -07:00
|
|
|
struct protocol *protocols;
|
|
|
|
struct timeout *timeouts;
|
|
|
|
static struct timeout *free_timeouts;
|
|
|
|
static int interfaces_invalidated;
|
2004-04-19 21:19:00 -07:00
|
|
|
|
2004-04-12 14:10:28 -07:00
|
|
|
void (*bootp_packet_handler)(struct interface_info *,
|
2016-12-08 11:18:15 -08:00
|
|
|
struct dhcp_packet *, int, struct packet_ctx *);
|
2004-04-12 14:10:28 -07:00
|
|
|
|
|
|
|
static int interface_status(struct interface_info *ifinfo);
|
|
|
|
|
2016-12-07 05:19:18 -08:00
|
|
|
struct interface_info *
|
2017-03-15 07:31:49 -07:00
|
|
|
iflist_getbyname(const char *name)
|
2004-04-12 14:10:28 -07:00
|
|
|
{
|
2017-03-15 07:31:49 -07:00
|
|
|
struct interface_info *intf;
|
2016-12-07 05:19:18 -08:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
TAILQ_FOREACH(intf, &intflist, entry) {
|
|
|
|
if (strcmp(intf->name, name) != 0)
|
|
|
|
continue;
|
2016-12-07 05:19:18 -08:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
return intf;
|
|
|
|
}
|
2004-04-12 14:10:28 -07:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
setup_iflist(void)
|
|
|
|
{
|
|
|
|
struct interface_info *intf;
|
|
|
|
struct sockaddr_dl *sdl;
|
|
|
|
struct ifaddrs *ifap, *ifa;
|
|
|
|
struct if_data *ifi;
|
|
|
|
struct sockaddr_in *sin;
|
|
|
|
struct sockaddr_in6 *sin6;
|
|
|
|
|
|
|
|
TAILQ_INIT(&intflist);
|
|
|
|
if (getifaddrs(&ifap))
|
2017-02-13 11:15:39 -08:00
|
|
|
fatalx("getifaddrs failed");
|
2004-04-12 14:10:28 -07:00
|
|
|
|
|
|
|
for (ifa = ifap; ifa != NULL; ifa = ifa->ifa_next) {
|
|
|
|
if ((ifa->ifa_flags & IFF_LOOPBACK) ||
|
2017-03-15 07:31:49 -07:00
|
|
|
(ifa->ifa_flags & IFF_POINTOPOINT))
|
2004-04-12 14:10:28 -07:00
|
|
|
continue;
|
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
/* Find interface or create it. */
|
|
|
|
intf = iflist_getbyname(ifa->ifa_name);
|
|
|
|
if (intf == NULL) {
|
|
|
|
intf = calloc(1, sizeof(*intf));
|
|
|
|
if (intf == NULL)
|
|
|
|
fatal("calloc");
|
2004-04-12 14:10:28 -07:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
strlcpy(intf->name, ifa->ifa_name,
|
|
|
|
sizeof(intf->name));
|
|
|
|
TAILQ_INSERT_HEAD(&intflist, intf, entry);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Signal disabled interface. */
|
|
|
|
if ((ifa->ifa_flags & IFF_UP) == 0)
|
|
|
|
intf->dead = 1;
|
2016-12-08 01:29:50 -08:00
|
|
|
|
2004-04-12 14:10:28 -07:00
|
|
|
if (ifa->ifa_addr->sa_family == AF_LINK) {
|
2017-03-15 07:31:49 -07:00
|
|
|
sdl = (struct sockaddr_dl *)ifa->ifa_addr;
|
|
|
|
ifi = (struct if_data *)ifa->ifa_data;
|
|
|
|
|
2017-07-07 10:25:09 -07:00
|
|
|
/* Skip unsupported interfaces. */
|
2017-03-15 07:31:49 -07:00
|
|
|
if (ifi->ifi_type != IFT_ETHER &&
|
2017-07-07 10:25:09 -07:00
|
|
|
ifi->ifi_type != IFT_ENC &&
|
|
|
|
ifi->ifi_type != IFT_CARP) {
|
2017-03-15 07:31:49 -07:00
|
|
|
TAILQ_REMOVE(&intflist, intf, entry);
|
|
|
|
free(intf);
|
2016-12-08 01:29:50 -08:00
|
|
|
continue;
|
2017-03-15 07:31:49 -07:00
|
|
|
}
|
|
|
|
|
2017-07-07 10:25:09 -07:00
|
|
|
if (ifi->ifi_type == IFT_ENC)
|
2017-03-15 07:31:49 -07:00
|
|
|
intf->hw_address.htype = HTYPE_IPSEC_TUNNEL;
|
2017-07-07 10:25:09 -07:00
|
|
|
else
|
|
|
|
intf->hw_address.htype = HTYPE_ETHER;
|
2004-04-12 14:10:28 -07:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
intf->index = sdl->sdl_index;
|
|
|
|
intf->hw_address.hlen = sdl->sdl_alen;
|
|
|
|
memcpy(intf->hw_address.haddr,
|
|
|
|
LLADDR(sdl), sdl->sdl_alen);
|
|
|
|
} else if (ifa->ifa_addr->sa_family == AF_INET) {
|
2016-12-08 01:29:50 -08:00
|
|
|
sin = (struct sockaddr_in *)ifa->ifa_addr;
|
2017-03-15 07:31:49 -07:00
|
|
|
if (sin->sin_addr.s_addr == htonl(INADDR_LOOPBACK) ||
|
|
|
|
intf->primary_address.s_addr != INADDR_ANY)
|
2004-04-12 14:10:28 -07:00
|
|
|
continue;
|
2016-12-08 01:29:50 -08:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
intf->primary_address = sin->sin_addr;
|
|
|
|
} else if (ifa->ifa_addr->sa_family == AF_INET6) {
|
|
|
|
sin6 = (struct sockaddr_in6 *)ifa->ifa_addr;
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&sin6->sin6_addr)) {
|
|
|
|
intf->linklocal = sin6->sin6_addr;
|
2021-01-17 05:40:59 -08:00
|
|
|
#ifdef __KAME__
|
|
|
|
/*
|
|
|
|
* Remove possible scope from address if
|
|
|
|
* link-local.
|
|
|
|
*/
|
2017-03-15 07:31:49 -07:00
|
|
|
intf->linklocal.s6_addr[2] = 0;
|
|
|
|
intf->linklocal.s6_addr[3] = 0;
|
2021-01-17 05:40:59 -08:00
|
|
|
#endif
|
2017-03-15 07:31:49 -07:00
|
|
|
} else
|
|
|
|
intf->gipv6 = 1;
|
|
|
|
|
|
|
|
/* At least one IPv6 address was found. */
|
|
|
|
intf->ipv6 = 1;
|
2004-04-12 14:10:28 -07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-12-07 05:19:18 -08:00
|
|
|
freeifaddrs(ifap);
|
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
/*
|
|
|
|
* Generate link-local IPv6 address for interfaces without it.
|
|
|
|
*
|
|
|
|
* For IPv6 DHCP Relay it doesn't matter what is used for
|
|
|
|
* link-addr field, so let's generate an address that won't
|
|
|
|
* change during execution so we can always find the interface
|
|
|
|
* to relay packets back. This is only used for layer 2 relaying
|
|
|
|
* when the interface might not have an address.
|
|
|
|
*/
|
|
|
|
TAILQ_FOREACH(intf, &intflist, entry) {
|
|
|
|
if (memcmp(&intf->linklocal, &in6addr_any,
|
|
|
|
sizeof(in6addr_any)) != 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
intf->linklocal.s6_addr[0] = 0xfe;
|
|
|
|
intf->linklocal.s6_addr[1] = 0x80;
|
|
|
|
intf->linklocal.s6_addr[8] = intf->hw_address.haddr[0];
|
|
|
|
intf->linklocal.s6_addr[9] = intf->hw_address.haddr[1];
|
|
|
|
intf->linklocal.s6_addr[10] = intf->hw_address.haddr[2];
|
|
|
|
intf->linklocal.s6_addr[11] = 0xff;
|
|
|
|
intf->linklocal.s6_addr[12] = 0xfe;
|
|
|
|
intf->linklocal.s6_addr[13] = intf->hw_address.haddr[3];
|
|
|
|
intf->linklocal.s6_addr[14] = intf->hw_address.haddr[4];
|
|
|
|
intf->linklocal.s6_addr[15] = intf->hw_address.haddr[5];
|
|
|
|
EUI64_TO_IFID(&intf->linklocal);
|
2016-12-08 01:29:50 -08:00
|
|
|
}
|
2017-03-15 07:31:49 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
struct interface_info *
|
|
|
|
register_interface(const char *ifname, void (*handler)(struct protocol *),
|
|
|
|
int isserver)
|
|
|
|
{
|
|
|
|
struct interface_info *intf;
|
|
|
|
|
|
|
|
if ((intf = iflist_getbyname(ifname)) == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* Don't register disabled interfaces. */
|
|
|
|
if (intf->dead)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/* Check if we already registered the interface. */
|
|
|
|
if (intf->ifr.ifr_name[0] != 0)
|
|
|
|
return intf;
|
2016-12-08 01:29:50 -08:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
if (strlcpy(intf->ifr.ifr_name, ifname,
|
|
|
|
sizeof(intf->ifr.ifr_name)) >= sizeof(intf->ifr.ifr_name))
|
2017-02-13 11:15:39 -08:00
|
|
|
fatalx("interface name '%s' too long", ifname);
|
2004-04-12 14:10:28 -07:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
if_register_receive(intf, isserver);
|
|
|
|
if_register_send(intf);
|
|
|
|
add_protocol(intf->name, intf->rfdesc, handler, intf);
|
2016-12-07 05:19:18 -08:00
|
|
|
|
2017-03-15 07:31:49 -07:00
|
|
|
return intf;
|
2004-04-12 14:10:28 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Wait for packets to come in using poll(). When a packet comes in,
|
|
|
|
* call receive_packet to receive the packet and possibly strip hardware
|
|
|
|
* addressing information from it, and then call through the
|
|
|
|
* bootp_packet_handler hook to try to do something with it.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
dispatch(void)
|
|
|
|
{
|
|
|
|
int count, i, to_msec, nfds = 0;
|
|
|
|
struct protocol *l;
|
|
|
|
struct pollfd *fds;
|
|
|
|
time_t howlong;
|
|
|
|
|
|
|
|
nfds = 0;
|
|
|
|
for (l = protocols; l; l = l->next)
|
|
|
|
nfds++;
|
|
|
|
|
2007-09-02 08:19:07 -07:00
|
|
|
fds = calloc(nfds, sizeof(struct pollfd));
|
2004-04-12 14:10:28 -07:00
|
|
|
if (fds == NULL)
|
2017-02-13 11:15:39 -08:00
|
|
|
fatalx("Can't allocate poll structures.");
|
2004-04-12 14:10:28 -07:00
|
|
|
|
|
|
|
do {
|
|
|
|
/*
|
|
|
|
* Call any expired timeouts, and then if there's still
|
|
|
|
* a timeout registered, time out the select call then.
|
|
|
|
*/
|
|
|
|
another:
|
|
|
|
if (timeouts) {
|
|
|
|
if (timeouts->when <= cur_time) {
|
2004-04-19 21:19:00 -07:00
|
|
|
struct timeout *t = timeouts;
|
|
|
|
|
2004-04-12 14:10:28 -07:00
|
|
|
timeouts = timeouts->next;
|
|
|
|
(*(t->func))(t->what);
|
|
|
|
t->next = free_timeouts;
|
|
|
|
free_timeouts = t;
|
|
|
|
goto another;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Figure timeout in milliseconds, and check for
|
|
|
|
* potential overflow, so we can cram into an
|
|
|
|
* int for poll, while not polling with a
|
2004-09-20 21:07:03 -07:00
|
|
|
* negative timeout and blocking indefinitely.
|
2004-04-12 14:10:28 -07:00
|
|
|
*/
|
|
|
|
howlong = timeouts->when - cur_time;
|
|
|
|
if (howlong > INT_MAX / 1000)
|
|
|
|
howlong = INT_MAX / 1000;
|
|
|
|
to_msec = howlong * 1000;
|
|
|
|
} else
|
|
|
|
to_msec = -1;
|
|
|
|
|
|
|
|
/* Set up the descriptors to be polled. */
|
|
|
|
i = 0;
|
|
|
|
|
|
|
|
for (l = protocols; l; l = l->next) {
|
|
|
|
struct interface_info *ip = l->local;
|
2004-04-19 21:19:00 -07:00
|
|
|
|
2004-04-12 14:10:28 -07:00
|
|
|
if (ip && (l->handler != got_one || !ip->dead)) {
|
|
|
|
fds[i].fd = l->fd;
|
|
|
|
fds[i].events = POLLIN;
|
|
|
|
fds[i].revents = 0;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (i == 0)
|
2017-02-13 11:15:39 -08:00
|
|
|
fatalx("No live interfaces to poll on - exiting.");
|
2004-04-12 14:10:28 -07:00
|
|
|
|
|
|
|
/* Wait for a packet or a timeout... XXX */
|
|
|
|
count = poll(fds, nfds, to_msec);
|
|
|
|
|
|
|
|
/* Not likely to be transitory... */
|
|
|
|
if (count == -1) {
|
|
|
|
if (errno == EAGAIN || errno == EINTR) {
|
|
|
|
time(&cur_time);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
else
|
2017-02-13 14:49:38 -08:00
|
|
|
fatal("poll");
|
2004-04-12 14:10:28 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Get the current time... */
|
|
|
|
time(&cur_time);
|
|
|
|
|
|
|
|
i = 0;
|
|
|
|
for (l = protocols; l; l = l->next) {
|
2004-04-19 21:19:00 -07:00
|
|
|
struct interface_info *ip = l->local;
|
|
|
|
|
2004-06-21 18:10:49 -07:00
|
|
|
if ((fds[i].revents & (POLLIN | POLLHUP))) {
|
2004-04-12 14:10:28 -07:00
|
|
|
fds[i].revents = 0;
|
|
|
|
if (ip && (l->handler != got_one ||
|
|
|
|
!ip->dead))
|
|
|
|
(*(l->handler))(l);
|
|
|
|
if (interfaces_invalidated)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
interfaces_invalidated = 0;
|
|
|
|
} while (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
got_one(struct protocol *l)
|
|
|
|
{
|
2016-12-08 11:18:15 -08:00
|
|
|
struct packet_ctx pc;
|
2017-04-04 08:52:12 -07:00
|
|
|
ssize_t result;
|
2004-04-12 14:10:28 -07:00
|
|
|
union {
|
|
|
|
/*
|
|
|
|
* Packet input buffer. Must be as large as largest
|
|
|
|
* possible MTU.
|
|
|
|
*/
|
|
|
|
unsigned char packbuf[4095];
|
|
|
|
struct dhcp_packet packet;
|
|
|
|
} u;
|
|
|
|
struct interface_info *ip = l->local;
|
|
|
|
|
2016-12-08 11:18:15 -08:00
|
|
|
memset(&pc, 0, sizeof(pc));
|
|
|
|
|
|
|
|
if ((result = receive_packet(ip, u.packbuf, sizeof(u), &pc)) == -1) {
|
2017-02-13 13:57:31 -08:00
|
|
|
log_warn("receive_packet failed on %s", ip->name);
|
2004-04-12 14:10:28 -07:00
|
|
|
ip->errors++;
|
|
|
|
if ((!interface_status(ip)) ||
|
|
|
|
(ip->noifmedia && ip->errors > 20)) {
|
|
|
|
/* our interface has gone away. */
|
2017-02-13 11:15:39 -08:00
|
|
|
log_warnx("Interface %s no longer appears valid.",
|
2004-04-12 14:10:28 -07:00
|
|
|
ip->name);
|
|
|
|
ip->dead = 1;
|
|
|
|
interfaces_invalidated = 1;
|
|
|
|
close(l->fd);
|
|
|
|
remove_protocol(l);
|
|
|
|
free(ip);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (result == 0)
|
|
|
|
return;
|
|
|
|
|
2016-12-08 11:18:15 -08:00
|
|
|
if (bootp_packet_handler)
|
|
|
|
(*bootp_packet_handler)(ip, &u.packet, result, &pc);
|
2004-04-12 14:10:28 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
interface_status(struct interface_info *ifinfo)
|
|
|
|
{
|
|
|
|
char *ifname = ifinfo->name;
|
|
|
|
int ifsock = ifinfo->rfdesc;
|
|
|
|
struct ifreq ifr;
|
|
|
|
struct ifmediareq ifmr;
|
|
|
|
|
|
|
|
/* get interface flags */
|
|
|
|
memset(&ifr, 0, sizeof(ifr));
|
|
|
|
strlcpy(ifr.ifr_name, ifname, sizeof(ifr.ifr_name));
|
2008-09-15 13:39:21 -07:00
|
|
|
if (ioctl(ifsock, SIOCGIFFLAGS, &ifr) == -1) {
|
2017-02-13 14:49:38 -08:00
|
|
|
log_warn("ioctl(SIOCGIFFLAGS) on %s", ifname);
|
2004-04-12 14:10:28 -07:00
|
|
|
goto inactive;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* if one of UP and RUNNING flags is dropped,
|
|
|
|
* the interface is not active.
|
|
|
|
*/
|
|
|
|
if ((ifr.ifr_flags & (IFF_UP|IFF_RUNNING)) != (IFF_UP|IFF_RUNNING)) {
|
|
|
|
goto inactive;
|
|
|
|
}
|
|
|
|
/* Next, check carrier on the interface, if possible */
|
|
|
|
if (ifinfo->noifmedia)
|
|
|
|
goto active;
|
|
|
|
memset(&ifmr, 0, sizeof(ifmr));
|
|
|
|
strlcpy(ifmr.ifm_name, ifname, sizeof(ifmr.ifm_name));
|
2008-09-15 13:39:21 -07:00
|
|
|
if (ioctl(ifsock, SIOCGIFMEDIA, (caddr_t)&ifmr) == -1) {
|
2004-04-12 14:10:28 -07:00
|
|
|
if (errno != EINVAL) {
|
2017-02-13 14:49:38 -08:00
|
|
|
log_debug("ioctl(SIOCGIFMEDIA) on %s", ifname);
|
2004-04-12 14:10:28 -07:00
|
|
|
ifinfo->noifmedia = 1;
|
|
|
|
goto active;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* EINVAL (or ENOTTY) simply means that the interface
|
|
|
|
* does not support the SIOCGIFMEDIA ioctl. We regard it alive.
|
|
|
|
*/
|
|
|
|
ifinfo->noifmedia = 1;
|
|
|
|
goto active;
|
|
|
|
}
|
|
|
|
if (ifmr.ifm_status & IFM_AVALID) {
|
|
|
|
switch (ifmr.ifm_active & IFM_NMASK) {
|
|
|
|
case IFM_ETHER:
|
|
|
|
if (ifmr.ifm_status & IFM_ACTIVE)
|
|
|
|
goto active;
|
|
|
|
else
|
|
|
|
goto inactive;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
goto inactive;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
inactive:
|
|
|
|
return (0);
|
|
|
|
active:
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Add a protocol to the list of protocols... */
|
|
|
|
void
|
|
|
|
add_protocol(char *name, int fd, void (*handler)(struct protocol *),
|
|
|
|
void *local)
|
|
|
|
{
|
|
|
|
struct protocol *p;
|
|
|
|
|
|
|
|
p = malloc(sizeof(*p));
|
|
|
|
if (!p)
|
2017-02-13 11:15:39 -08:00
|
|
|
fatalx("can't allocate protocol struct for %s", name);
|
2004-04-12 14:10:28 -07:00
|
|
|
|
|
|
|
p->fd = fd;
|
|
|
|
p->handler = handler;
|
|
|
|
p->local = local;
|
|
|
|
p->next = protocols;
|
|
|
|
protocols = p;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
remove_protocol(struct protocol *proto)
|
|
|
|
{
|
|
|
|
struct protocol *p, *next, *prev;
|
|
|
|
|
|
|
|
prev = NULL;
|
|
|
|
for (p = protocols; p; p = next) {
|
|
|
|
next = p->next;
|
|
|
|
if (p == proto) {
|
|
|
|
if (prev)
|
|
|
|
prev->next = p->next;
|
|
|
|
else
|
|
|
|
protocols = p->next;
|
|
|
|
free(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|