/*
|
/*
|
* Copyright (c) 1982, 1986, 1993
|
* Copyright (c) 1982, 1986, 1993
|
* The Regents of the University of California. All rights reserved.
|
* The Regents of the University of California. All rights reserved.
|
*
|
*
|
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
* are met:
|
* are met:
|
* 1. Redistributions of source code must retain the above copyright
|
* 1. Redistributions of source code must retain the above copyright
|
* notice, this list of conditions and the following disclaimer.
|
* notice, this list of conditions and the following disclaimer.
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* notice, this list of conditions and the following disclaimer in the
|
* notice, this list of conditions and the following disclaimer in the
|
* documentation and/or other materials provided with the distribution.
|
* documentation and/or other materials provided with the distribution.
|
* 3. All advertising materials mentioning features or use of this software
|
* 3. All advertising materials mentioning features or use of this software
|
* must display the following acknowledgement:
|
* must display the following acknowledgement:
|
* This product includes software developed by the University of
|
* This product includes software developed by the University of
|
* California, Berkeley and its contributors.
|
* California, Berkeley and its contributors.
|
* 4. Neither the name of the University nor the names of 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
|
* may be used to endorse or promote products derived from this software
|
* without specific prior written permission.
|
* without specific prior written permission.
|
*
|
*
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* 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
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* SUCH DAMAGE.
|
* SUCH DAMAGE.
|
*
|
*
|
* @(#)if_loop.c 8.1 (Berkeley) 6/10/93
|
* @(#)if_loop.c 8.1 (Berkeley) 6/10/93
|
* $Id: if_loop.c,v 1.2 2001-09-27 12:01:54 chris Exp $
|
* $Id: if_loop.c,v 1.2 2001-09-27 12:01:54 chris Exp $
|
*/
|
*/
|
|
|
/*
|
/*
|
* Loopback interface driver for protocol testing and timing.
|
* Loopback interface driver for protocol testing and timing.
|
*/
|
*/
|
#include "loop.h"
|
#include "loop.h"
|
#if NLOOP > 0
|
#if NLOOP > 0
|
|
|
#include <sys/param.h>
|
#include <sys/param.h>
|
#include <sys/systm.h>
|
#include <sys/systm.h>
|
#include <sys/kernel.h>
|
#include <sys/kernel.h>
|
#include <sys/mbuf.h>
|
#include <sys/mbuf.h>
|
#include <sys/socket.h>
|
#include <sys/socket.h>
|
#include <sys/errno.h>
|
#include <sys/errno.h>
|
#include <sys/ioctl.h>
|
#include <sys/ioctl.h>
|
#include <sys/time.h>
|
#include <sys/time.h>
|
|
|
#include <net/if.h>
|
#include <net/if.h>
|
#include <net/if_types.h>
|
#include <net/if_types.h>
|
#include <net/netisr.h>
|
#include <net/netisr.h>
|
#include <net/route.h>
|
#include <net/route.h>
|
#include <net/bpf.h>
|
#include <net/bpf.h>
|
|
|
#ifdef INET
|
#ifdef INET
|
#include <netinet/in.h>
|
#include <netinet/in.h>
|
#include <netinet/in_systm.h>
|
#include <netinet/in_systm.h>
|
#include <netinet/in_var.h>
|
#include <netinet/in_var.h>
|
#include <netinet/ip.h>
|
#include <netinet/ip.h>
|
#endif
|
#endif
|
|
|
#ifdef IPX
|
#ifdef IPX
|
#include <netipx/ipx.h>
|
#include <netipx/ipx.h>
|
#include <netipx/ipx_if.h>
|
#include <netipx/ipx_if.h>
|
#endif
|
#endif
|
|
|
#ifdef NS
|
#ifdef NS
|
#include <netns/ns.h>
|
#include <netns/ns.h>
|
#include <netns/ns_if.h>
|
#include <netns/ns_if.h>
|
#endif
|
#endif
|
|
|
#ifdef ISO
|
#ifdef ISO
|
#include <netiso/iso.h>
|
#include <netiso/iso.h>
|
#include <netiso/iso_var.h>
|
#include <netiso/iso_var.h>
|
#endif
|
#endif
|
|
|
#ifdef NETATALK
|
#ifdef NETATALK
|
#include <netinet/if_ether.h>
|
#include <netinet/if_ether.h>
|
#include <netatalk/at.h>
|
#include <netatalk/at.h>
|
#include <netatalk/at_var.h>
|
#include <netatalk/at_var.h>
|
#endif NETATALK
|
#endif NETATALK
|
|
|
#include "bpfilter.h"
|
#include "bpfilter.h"
|
|
|
static int loioctl __P((struct ifnet *, int, caddr_t));
|
static int loioctl __P((struct ifnet *, int, caddr_t));
|
static void lortrequest __P((int, struct rtentry *, struct sockaddr *));
|
static void lortrequest __P((int, struct rtentry *, struct sockaddr *));
|
|
|
void rtems_bsdnet_loopattach __P((void *));
|
void rtems_bsdnet_loopattach __P((void *));
|
PSEUDO_SET(loopattach, if_loop);
|
PSEUDO_SET(loopattach, if_loop);
|
|
|
#ifdef TINY_LOMTU
|
#ifdef TINY_LOMTU
|
#define LOMTU (1024+512)
|
#define LOMTU (1024+512)
|
#else
|
#else
|
#define LOMTU 16384
|
#define LOMTU 16384
|
#endif
|
#endif
|
|
|
struct ifnet loif[NLOOP];
|
struct ifnet loif[NLOOP];
|
|
|
/* ARGSUSED */
|
/* ARGSUSED */
|
void
|
void
|
rtems_bsdnet_loopattach(dummy)
|
rtems_bsdnet_loopattach(dummy)
|
void *dummy;
|
void *dummy;
|
{
|
{
|
register struct ifnet *ifp;
|
register struct ifnet *ifp;
|
register int i = 0;
|
register int i = 0;
|
|
|
for (ifp = loif; i < NLOOP; ifp++) {
|
for (ifp = loif; i < NLOOP; ifp++) {
|
ifp->if_name = "lo";
|
ifp->if_name = "lo";
|
ifp->if_next = NULL;
|
ifp->if_next = NULL;
|
ifp->if_unit = i++;
|
ifp->if_unit = i++;
|
ifp->if_mtu = LOMTU;
|
ifp->if_mtu = LOMTU;
|
ifp->if_flags = IFF_LOOPBACK | IFF_MULTICAST;
|
ifp->if_flags = IFF_LOOPBACK | IFF_MULTICAST;
|
ifp->if_ioctl = loioctl;
|
ifp->if_ioctl = loioctl;
|
ifp->if_output = looutput;
|
ifp->if_output = looutput;
|
ifp->if_type = IFT_LOOP;
|
ifp->if_type = IFT_LOOP;
|
ifp->if_hdrlen = 0;
|
ifp->if_hdrlen = 0;
|
ifp->if_addrlen = 0;
|
ifp->if_addrlen = 0;
|
ifp->if_snd.ifq_maxlen = ifqmaxlen;
|
ifp->if_snd.ifq_maxlen = ifqmaxlen;
|
if_attach(ifp);
|
if_attach(ifp);
|
#if NBPFILTER > 0
|
#if NBPFILTER > 0
|
bpfattach(ifp, DLT_NULL, sizeof(u_int));
|
bpfattach(ifp, DLT_NULL, sizeof(u_int));
|
#endif
|
#endif
|
}
|
}
|
}
|
}
|
|
|
int
|
int
|
looutput(ifp, m, dst, rt)
|
looutput(ifp, m, dst, rt)
|
struct ifnet *ifp;
|
struct ifnet *ifp;
|
register struct mbuf *m;
|
register struct mbuf *m;
|
struct sockaddr *dst;
|
struct sockaddr *dst;
|
register struct rtentry *rt;
|
register struct rtentry *rt;
|
{
|
{
|
int s, isr;
|
int s, isr;
|
register struct ifqueue *ifq = 0;
|
register struct ifqueue *ifq = 0;
|
|
|
if ((m->m_flags & M_PKTHDR) == 0)
|
if ((m->m_flags & M_PKTHDR) == 0)
|
panic("looutput no HDR");
|
panic("looutput no HDR");
|
#if NBPFILTER > 0
|
#if NBPFILTER > 0
|
/* BPF write needs to be handled specially */
|
/* BPF write needs to be handled specially */
|
if (dst->sa_family == AF_UNSPEC) {
|
if (dst->sa_family == AF_UNSPEC) {
|
dst->sa_family = *(mtod(m, int *));
|
dst->sa_family = *(mtod(m, int *));
|
m->m_len -= sizeof(int);
|
m->m_len -= sizeof(int);
|
m->m_pkthdr.len -= sizeof(int);
|
m->m_pkthdr.len -= sizeof(int);
|
m->m_data += sizeof(int);
|
m->m_data += sizeof(int);
|
}
|
}
|
|
|
if (ifp->if_bpf) {
|
if (ifp->if_bpf) {
|
/*
|
/*
|
* We need to prepend the address family as
|
* We need to prepend the address family as
|
* a four byte field. Cons up a dummy header
|
* a four byte field. Cons up a dummy header
|
* to pacify bpf. This is safe because bpf
|
* to pacify bpf. This is safe because bpf
|
* will only read from the mbuf (i.e., it won't
|
* will only read from the mbuf (i.e., it won't
|
* try to free it or keep a pointer a to it).
|
* try to free it or keep a pointer a to it).
|
*/
|
*/
|
struct mbuf m0;
|
struct mbuf m0;
|
u_int af = dst->sa_family;
|
u_int af = dst->sa_family;
|
|
|
m0.m_next = m;
|
m0.m_next = m;
|
m0.m_len = 4;
|
m0.m_len = 4;
|
m0.m_data = (char *)⁡
|
m0.m_data = (char *)⁡
|
|
|
bpf_mtap(ifp, &m0);
|
bpf_mtap(ifp, &m0);
|
}
|
}
|
#endif
|
#endif
|
m->m_pkthdr.rcvif = ifp;
|
m->m_pkthdr.rcvif = ifp;
|
|
|
if (rt && rt->rt_flags & (RTF_REJECT|RTF_BLACKHOLE)) {
|
if (rt && rt->rt_flags & (RTF_REJECT|RTF_BLACKHOLE)) {
|
m_freem(m);
|
m_freem(m);
|
return (rt->rt_flags & RTF_BLACKHOLE ? 0 :
|
return (rt->rt_flags & RTF_BLACKHOLE ? 0 :
|
rt->rt_flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
|
rt->rt_flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
|
}
|
}
|
ifp->if_opackets++;
|
ifp->if_opackets++;
|
ifp->if_obytes += m->m_pkthdr.len;
|
ifp->if_obytes += m->m_pkthdr.len;
|
switch (dst->sa_family) {
|
switch (dst->sa_family) {
|
|
|
#ifdef INET
|
#ifdef INET
|
case AF_INET:
|
case AF_INET:
|
ifq = &ipintrq;
|
ifq = &ipintrq;
|
isr = NETISR_IP;
|
isr = NETISR_IP;
|
break;
|
break;
|
#endif
|
#endif
|
#ifdef IPX
|
#ifdef IPX
|
case AF_IPX:
|
case AF_IPX:
|
ifq = &ipxintrq;
|
ifq = &ipxintrq;
|
isr = NETISR_IPX;
|
isr = NETISR_IPX;
|
break;
|
break;
|
#endif
|
#endif
|
#ifdef NS
|
#ifdef NS
|
case AF_NS:
|
case AF_NS:
|
ifq = &nsintrq;
|
ifq = &nsintrq;
|
isr = NETISR_NS;
|
isr = NETISR_NS;
|
break;
|
break;
|
#endif
|
#endif
|
#ifdef ISO
|
#ifdef ISO
|
case AF_ISO:
|
case AF_ISO:
|
ifq = &clnlintrq;
|
ifq = &clnlintrq;
|
isr = NETISR_ISO;
|
isr = NETISR_ISO;
|
break;
|
break;
|
#endif
|
#endif
|
#ifdef NETATALK
|
#ifdef NETATALK
|
case AF_APPLETALK:
|
case AF_APPLETALK:
|
ifq = &atintrq2;
|
ifq = &atintrq2;
|
isr = NETISR_ATALK;
|
isr = NETISR_ATALK;
|
break;
|
break;
|
#endif NETATALK
|
#endif NETATALK
|
default:
|
default:
|
printf("lo%d: can't handle af%d\n", ifp->if_unit,
|
printf("lo%d: can't handle af%d\n", ifp->if_unit,
|
dst->sa_family);
|
dst->sa_family);
|
m_freem(m);
|
m_freem(m);
|
return (EAFNOSUPPORT);
|
return (EAFNOSUPPORT);
|
}
|
}
|
s = splimp();
|
s = splimp();
|
if (IF_QFULL(ifq)) {
|
if (IF_QFULL(ifq)) {
|
IF_DROP(ifq);
|
IF_DROP(ifq);
|
m_freem(m);
|
m_freem(m);
|
splx(s);
|
splx(s);
|
return (ENOBUFS);
|
return (ENOBUFS);
|
}
|
}
|
IF_ENQUEUE(ifq, m);
|
IF_ENQUEUE(ifq, m);
|
schednetisr(isr);
|
schednetisr(isr);
|
ifp->if_ipackets++;
|
ifp->if_ipackets++;
|
ifp->if_ibytes += m->m_pkthdr.len;
|
ifp->if_ibytes += m->m_pkthdr.len;
|
splx(s);
|
splx(s);
|
return (0);
|
return (0);
|
}
|
}
|
|
|
/* ARGSUSED */
|
/* ARGSUSED */
|
static void
|
static void
|
lortrequest(cmd, rt, sa)
|
lortrequest(cmd, rt, sa)
|
int cmd;
|
int cmd;
|
struct rtentry *rt;
|
struct rtentry *rt;
|
struct sockaddr *sa;
|
struct sockaddr *sa;
|
{
|
{
|
if (rt) {
|
if (rt) {
|
rt->rt_rmx.rmx_mtu = rt->rt_ifp->if_mtu; /* for ISO */
|
rt->rt_rmx.rmx_mtu = rt->rt_ifp->if_mtu; /* for ISO */
|
/*
|
/*
|
* For optimal performance, the send and receive buffers
|
* For optimal performance, the send and receive buffers
|
* should be at least twice the MTU plus a little more for
|
* should be at least twice the MTU plus a little more for
|
* overhead.
|
* overhead.
|
*/
|
*/
|
rt->rt_rmx.rmx_recvpipe =
|
rt->rt_rmx.rmx_recvpipe =
|
rt->rt_rmx.rmx_sendpipe = 3 * LOMTU;
|
rt->rt_rmx.rmx_sendpipe = 3 * LOMTU;
|
}
|
}
|
}
|
}
|
|
|
/*
|
/*
|
* Process an ioctl request.
|
* Process an ioctl request.
|
*/
|
*/
|
/* ARGSUSED */
|
/* ARGSUSED */
|
static int
|
static int
|
loioctl(ifp, cmd, data)
|
loioctl(ifp, cmd, data)
|
register struct ifnet *ifp;
|
register struct ifnet *ifp;
|
int cmd;
|
int cmd;
|
caddr_t data;
|
caddr_t data;
|
{
|
{
|
register struct ifaddr *ifa;
|
register struct ifaddr *ifa;
|
register struct ifreq *ifr = (struct ifreq *)data;
|
register struct ifreq *ifr = (struct ifreq *)data;
|
register int error = 0;
|
register int error = 0;
|
|
|
switch (cmd) {
|
switch (cmd) {
|
|
|
case SIOCSIFADDR:
|
case SIOCSIFADDR:
|
ifp->if_flags |= IFF_UP | IFF_RUNNING;
|
ifp->if_flags |= IFF_UP | IFF_RUNNING;
|
ifa = (struct ifaddr *)data;
|
ifa = (struct ifaddr *)data;
|
ifa->ifa_rtrequest = lortrequest;
|
ifa->ifa_rtrequest = lortrequest;
|
/*
|
/*
|
* Everything else is done at a higher level.
|
* Everything else is done at a higher level.
|
*/
|
*/
|
break;
|
break;
|
|
|
case SIOCADDMULTI:
|
case SIOCADDMULTI:
|
case SIOCDELMULTI:
|
case SIOCDELMULTI:
|
if (ifr == 0) {
|
if (ifr == 0) {
|
error = EAFNOSUPPORT; /* XXX */
|
error = EAFNOSUPPORT; /* XXX */
|
break;
|
break;
|
}
|
}
|
switch (ifr->ifr_addr.sa_family) {
|
switch (ifr->ifr_addr.sa_family) {
|
|
|
#ifdef INET
|
#ifdef INET
|
case AF_INET:
|
case AF_INET:
|
break;
|
break;
|
#endif
|
#endif
|
|
|
default:
|
default:
|
error = EAFNOSUPPORT;
|
error = EAFNOSUPPORT;
|
break;
|
break;
|
}
|
}
|
break;
|
break;
|
|
|
case SIOCSIFMTU:
|
case SIOCSIFMTU:
|
ifp->if_mtu = ifr->ifr_mtu;
|
ifp->if_mtu = ifr->ifr_mtu;
|
break;
|
break;
|
|
|
default:
|
default:
|
error = EINVAL;
|
error = EINVAL;
|
}
|
}
|
return (error);
|
return (error);
|
}
|
}
|
#endif /* NLOOP > 0 */
|
#endif /* NLOOP > 0 */
|
|
|
