2005-01-07 01:45:51 +00:00
|
|
|
/*-
|
1995-10-26 20:31:59 +00:00
|
|
|
* Copyright (c) 1984, 1985, 1986, 1987, 1993
|
2006-03-27 01:12:58 +00:00
|
|
|
* The Regents of the University of California.
|
2009-06-24 20:57:50 +00:00
|
|
|
* Copyright (c) 2004-2009 Robert N. M. Watson
|
2006-03-27 01:12:58 +00:00
|
|
|
* All rights reserved.
|
1995-10-26 20:31:59 +00:00
|
|
|
*
|
|
|
|
* 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.
|
2007-01-08 22:14:00 +00:00
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* Copyright (c) 1995, Mike Mitchell
|
|
|
|
* 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.
|
1995-10-26 20:31:59 +00:00
|
|
|
* 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.
|
|
|
|
*
|
1995-11-04 09:03:47 +00:00
|
|
|
* @(#)ipx_input.c
|
1995-10-26 20:31:59 +00:00
|
|
|
*/
|
|
|
|
|
2003-06-11 05:37:42 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
1995-10-26 20:31:59 +00:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/kernel.h>
|
2000-04-24 17:30:08 +00:00
|
|
|
#include <sys/random.h>
|
2009-06-23 18:36:42 +00:00
|
|
|
#include <sys/lock.h>
|
2009-06-21 21:04:12 +00:00
|
|
|
#include <sys/rwlock.h>
|
1996-01-05 20:47:05 +00:00
|
|
|
#include <sys/sysctl.h>
|
1995-10-26 20:31:59 +00:00
|
|
|
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
#include <net/netisr.h>
|
|
|
|
|
|
|
|
#include <netipx/ipx.h>
|
|
|
|
#include <netipx/spx.h>
|
|
|
|
#include <netipx/ipx_if.h>
|
|
|
|
#include <netipx/ipx_pcb.h>
|
|
|
|
#include <netipx/ipx_var.h>
|
|
|
|
|
1997-05-10 09:58:58 +00:00
|
|
|
int ipxcksum = 0;
|
1996-01-05 20:47:05 +00:00
|
|
|
SYSCTL_INT(_net_ipx_ipx, OID_AUTO, checksum, CTLFLAG_RW,
|
2008-07-25 23:54:07 +00:00
|
|
|
&ipxcksum, 0, "Compute ipx checksum");
|
1995-10-26 20:31:59 +00:00
|
|
|
|
1997-06-26 19:36:03 +00:00
|
|
|
static int ipxprintfs = 0; /* printing forwarding information */
|
1997-05-10 09:58:58 +00:00
|
|
|
SYSCTL_INT(_net_ipx_ipx, OID_AUTO, ipxprintfs, CTLFLAG_RW,
|
2008-07-25 23:54:07 +00:00
|
|
|
&ipxprintfs, 0, "Printing forwarding information");
|
1996-01-05 20:47:05 +00:00
|
|
|
|
1997-06-26 19:36:03 +00:00
|
|
|
static int ipxforwarding = 0;
|
1996-01-05 20:47:05 +00:00
|
|
|
SYSCTL_INT(_net_ipx_ipx, OID_AUTO, ipxforwarding, CTLFLAG_RW,
|
2008-07-25 23:54:07 +00:00
|
|
|
&ipxforwarding, 0, "Enable ipx forwarding");
|
1995-10-26 20:31:59 +00:00
|
|
|
|
1997-06-26 19:36:03 +00:00
|
|
|
static int ipxnetbios = 0;
|
1997-05-10 09:58:58 +00:00
|
|
|
SYSCTL_INT(_net_ipx, OID_AUTO, ipxnetbios, CTLFLAG_RW,
|
2008-07-25 23:54:07 +00:00
|
|
|
&ipxnetbios, 0, "Propagate netbios over ipx");
|
1995-10-26 20:31:59 +00:00
|
|
|
|
Reimplement the netisr framework in order to support parallel netisr
threads:
- Support up to one netisr thread per CPU, each processings its own
workstream, or set of per-protocol queues. Threads may be bound
to specific CPUs, or allowed to migrate, based on a global policy.
In the future it would be desirable to support topology-centric
policies, such as "one netisr per package".
- Allow each protocol to advertise an ordering policy, which can
currently be one of:
NETISR_POLICY_SOURCE: packets must maintain ordering with respect to
an implicit or explicit source (such as an interface or socket).
NETISR_POLICY_FLOW: make use of mbuf flow identifiers to place work,
as well as allowing protocols to provide a flow generation function
for mbufs without flow identifers (m2flow). Falls back on
NETISR_POLICY_SOURCE if now flow ID is available.
NETISR_POLICY_CPU: allow protocols to inspect and assign a CPU for
each packet handled by netisr (m2cpuid).
- Provide utility functions for querying the number of workstreams
being used, as well as a mapping function from workstream to CPU ID,
which protocols may use in work placement decisions.
- Add explicit interfaces to get and set per-protocol queue limits, and
get and clear drop counters, which query data or apply changes across
all workstreams.
- Add a more extensible netisr registration interface, in which
protocols declare 'struct netisr_handler' structures for each
registered NETISR_ type. These include name, handler function,
optional mbuf to flow ID function, optional mbuf to CPU ID function,
queue limit, and ordering policy. Padding is present to allow these
to be expanded in the future. If no queue limit is declared, then
a default is used.
- Queue limits are now per-workstream, and raised from the previous
IFQ_MAXLEN default of 50 to 256.
- All protocols are updated to use the new registration interface, and
with the exception of netnatm, default queue limits. Most protocols
register as NETISR_POLICY_SOURCE, except IPv4 and IPv6, which use
NETISR_POLICY_FLOW, and will therefore take advantage of driver-
generated flow IDs if present.
- Formalize a non-packet based interface between interface polling and
the netisr, rather than having polling pretend to be two protocols.
Provide two explicit hooks in the netisr worker for start and end
events for runs: netisr_poll() and netisr_pollmore(), as well as a
function, netisr_sched_poll(), to allow the polling code to schedule
netisr execution. DEVICE_POLLING still embeds single-netisr
assumptions in its implementation, so for now if it is compiled into
the kernel, a single and un-bound netisr thread is enforced
regardless of tunable configuration.
In the default configuration, the new netisr implementation maintains
the same basic assumptions as the previous implementation: a single,
un-bound worker thread processes all deferred work, and direct dispatch
is enabled by default wherever possible.
Performance measurement shows a marginal performance improvement over
the old implementation due to the use of batched dequeue.
An rmlock is used to synchronize use and registration/unregistration
using the framework; currently, synchronized use is disabled
(replicating current netisr policy) due to a measurable 3%-6% hit in
ping-pong micro-benchmarking. It will be enabled once further rmlock
optimization has taken place. However, in practice, netisrs are
rarely registered or unregistered at runtime.
A new man page for netisr will follow, but since one doesn't currently
exist, it hasn't been updated.
This change is not appropriate for MFC, although the polling shutdown
handler should be merged to 7-STABLE.
Bump __FreeBSD_version.
Reviewed by: bz
2009-06-01 10:41:38 +00:00
|
|
|
static int ipx_do_route(struct ipx_addr *src, struct route *ro);
|
|
|
|
static void ipx_undo_route(struct route *ro);
|
|
|
|
static void ipx_forward(struct mbuf *m);
|
|
|
|
static void ipxintr(struct mbuf *m);
|
|
|
|
|
2004-12-30 16:56:07 +00:00
|
|
|
const union ipx_net ipx_zeronet;
|
1995-10-26 20:31:59 +00:00
|
|
|
|
2004-12-30 16:56:07 +00:00
|
|
|
const union ipx_net ipx_broadnet = { .s_net[0] = 0xffff,
|
|
|
|
.s_net[1] = 0xffff };
|
|
|
|
const union ipx_host ipx_broadhost = { .s_host[0] = 0xffff,
|
|
|
|
.s_host[1] = 0xffff,
|
|
|
|
.s_host[2] = 0xffff };
|
1995-10-26 20:31:59 +00:00
|
|
|
|
1997-05-10 09:58:58 +00:00
|
|
|
struct ipxstat ipxstat;
|
|
|
|
struct sockaddr_ipx ipx_netmask, ipx_hostmask;
|
1995-10-26 20:31:59 +00:00
|
|
|
|
2004-12-30 17:49:40 +00:00
|
|
|
/*
|
|
|
|
* IPX protocol control block (pcb) lists.
|
|
|
|
*/
|
Introduce a global mutex, ipxpcb_list_mtx, to protect the global
IPX PCB lists. Add macros to initialize, destroy, lock, unlock,
and assert the mutex. Initialize the mutex when IPX is started.
Add per-IPX PCB mutexes, ipxp_mtx in struct ipxpcb, to protect
per-PCB IPX/SPX state. Add macros to initialize, destroy, lock,
unlock, and assert the mutex. Initialize the mutex when a new
PCB is allocated; destroy it when the PCB is free'd.
MFC after: 2 weeks
2005-01-09 05:00:41 +00:00
|
|
|
struct mtx ipxpcb_list_mtx;
|
2004-12-30 17:49:40 +00:00
|
|
|
struct ipxpcbhead ipxpcb_list;
|
|
|
|
struct ipxpcbhead ipxrawpcb_list;
|
1995-10-26 20:31:59 +00:00
|
|
|
|
Reimplement the netisr framework in order to support parallel netisr
threads:
- Support up to one netisr thread per CPU, each processings its own
workstream, or set of per-protocol queues. Threads may be bound
to specific CPUs, or allowed to migrate, based on a global policy.
In the future it would be desirable to support topology-centric
policies, such as "one netisr per package".
- Allow each protocol to advertise an ordering policy, which can
currently be one of:
NETISR_POLICY_SOURCE: packets must maintain ordering with respect to
an implicit or explicit source (such as an interface or socket).
NETISR_POLICY_FLOW: make use of mbuf flow identifiers to place work,
as well as allowing protocols to provide a flow generation function
for mbufs without flow identifers (m2flow). Falls back on
NETISR_POLICY_SOURCE if now flow ID is available.
NETISR_POLICY_CPU: allow protocols to inspect and assign a CPU for
each packet handled by netisr (m2cpuid).
- Provide utility functions for querying the number of workstreams
being used, as well as a mapping function from workstream to CPU ID,
which protocols may use in work placement decisions.
- Add explicit interfaces to get and set per-protocol queue limits, and
get and clear drop counters, which query data or apply changes across
all workstreams.
- Add a more extensible netisr registration interface, in which
protocols declare 'struct netisr_handler' structures for each
registered NETISR_ type. These include name, handler function,
optional mbuf to flow ID function, optional mbuf to CPU ID function,
queue limit, and ordering policy. Padding is present to allow these
to be expanded in the future. If no queue limit is declared, then
a default is used.
- Queue limits are now per-workstream, and raised from the previous
IFQ_MAXLEN default of 50 to 256.
- All protocols are updated to use the new registration interface, and
with the exception of netnatm, default queue limits. Most protocols
register as NETISR_POLICY_SOURCE, except IPv4 and IPv6, which use
NETISR_POLICY_FLOW, and will therefore take advantage of driver-
generated flow IDs if present.
- Formalize a non-packet based interface between interface polling and
the netisr, rather than having polling pretend to be two protocols.
Provide two explicit hooks in the netisr worker for start and end
events for runs: netisr_poll() and netisr_pollmore(), as well as a
function, netisr_sched_poll(), to allow the polling code to schedule
netisr execution. DEVICE_POLLING still embeds single-netisr
assumptions in its implementation, so for now if it is compiled into
the kernel, a single and un-bound netisr thread is enforced
regardless of tunable configuration.
In the default configuration, the new netisr implementation maintains
the same basic assumptions as the previous implementation: a single,
un-bound worker thread processes all deferred work, and direct dispatch
is enabled by default wherever possible.
Performance measurement shows a marginal performance improvement over
the old implementation due to the use of batched dequeue.
An rmlock is used to synchronize use and registration/unregistration
using the framework; currently, synchronized use is disabled
(replicating current netisr policy) due to a measurable 3%-6% hit in
ping-pong micro-benchmarking. It will be enabled once further rmlock
optimization has taken place. However, in practice, netisrs are
rarely registered or unregistered at runtime.
A new man page for netisr will follow, but since one doesn't currently
exist, it hasn't been updated.
This change is not appropriate for MFC, although the polling shutdown
handler should be merged to 7-STABLE.
Bump __FreeBSD_version.
Reviewed by: bz
2009-06-01 10:41:38 +00:00
|
|
|
static struct netisr_handler ipx_nh = {
|
|
|
|
.nh_name = "ipx",
|
|
|
|
.nh_handler = ipxintr,
|
|
|
|
.nh_proto = NETISR_IPX,
|
|
|
|
.nh_policy = NETISR_POLICY_SOURCE,
|
|
|
|
};
|
1995-10-26 20:31:59 +00:00
|
|
|
|
2005-01-09 05:15:59 +00:00
|
|
|
long ipx_pexseq; /* Locked with ipxpcb_list_mtx. */
|
1995-10-26 20:31:59 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* IPX initialization.
|
|
|
|
*/
|
|
|
|
|
|
|
|
void
|
2007-05-11 10:38:34 +00:00
|
|
|
ipx_init(void)
|
1995-10-26 20:31:59 +00:00
|
|
|
{
|
|
|
|
|
1998-04-06 09:30:42 +00:00
|
|
|
read_random(&ipx_pexseq, sizeof ipx_pexseq);
|
2004-12-30 17:49:40 +00:00
|
|
|
|
|
|
|
LIST_INIT(&ipxpcb_list);
|
|
|
|
LIST_INIT(&ipxrawpcb_list);
|
2009-06-24 20:57:50 +00:00
|
|
|
TAILQ_INIT(&ipx_ifaddrhead);
|
1995-10-26 20:31:59 +00:00
|
|
|
|
Introduce a global mutex, ipxpcb_list_mtx, to protect the global
IPX PCB lists. Add macros to initialize, destroy, lock, unlock,
and assert the mutex. Initialize the mutex when IPX is started.
Add per-IPX PCB mutexes, ipxp_mtx in struct ipxpcb, to protect
per-PCB IPX/SPX state. Add macros to initialize, destroy, lock,
unlock, and assert the mutex. Initialize the mutex when a new
PCB is allocated; destroy it when the PCB is free'd.
MFC after: 2 weeks
2005-01-09 05:00:41 +00:00
|
|
|
IPX_LIST_LOCK_INIT();
|
2009-06-21 21:04:12 +00:00
|
|
|
IPX_IFADDR_LOCK_INIT();
|
Introduce a global mutex, ipxpcb_list_mtx, to protect the global
IPX PCB lists. Add macros to initialize, destroy, lock, unlock,
and assert the mutex. Initialize the mutex when IPX is started.
Add per-IPX PCB mutexes, ipxp_mtx in struct ipxpcb, to protect
per-PCB IPX/SPX state. Add macros to initialize, destroy, lock,
unlock, and assert the mutex. Initialize the mutex when a new
PCB is allocated; destroy it when the PCB is free'd.
MFC after: 2 weeks
2005-01-09 05:00:41 +00:00
|
|
|
|
1995-10-26 20:31:59 +00:00
|
|
|
ipx_netmask.sipx_len = 6;
|
|
|
|
ipx_netmask.sipx_addr.x_net = ipx_broadnet;
|
|
|
|
|
|
|
|
ipx_hostmask.sipx_len = 12;
|
|
|
|
ipx_hostmask.sipx_addr.x_net = ipx_broadnet;
|
|
|
|
ipx_hostmask.sipx_addr.x_host = ipx_broadhost;
|
2000-02-13 03:32:07 +00:00
|
|
|
|
Reimplement the netisr framework in order to support parallel netisr
threads:
- Support up to one netisr thread per CPU, each processings its own
workstream, or set of per-protocol queues. Threads may be bound
to specific CPUs, or allowed to migrate, based on a global policy.
In the future it would be desirable to support topology-centric
policies, such as "one netisr per package".
- Allow each protocol to advertise an ordering policy, which can
currently be one of:
NETISR_POLICY_SOURCE: packets must maintain ordering with respect to
an implicit or explicit source (such as an interface or socket).
NETISR_POLICY_FLOW: make use of mbuf flow identifiers to place work,
as well as allowing protocols to provide a flow generation function
for mbufs without flow identifers (m2flow). Falls back on
NETISR_POLICY_SOURCE if now flow ID is available.
NETISR_POLICY_CPU: allow protocols to inspect and assign a CPU for
each packet handled by netisr (m2cpuid).
- Provide utility functions for querying the number of workstreams
being used, as well as a mapping function from workstream to CPU ID,
which protocols may use in work placement decisions.
- Add explicit interfaces to get and set per-protocol queue limits, and
get and clear drop counters, which query data or apply changes across
all workstreams.
- Add a more extensible netisr registration interface, in which
protocols declare 'struct netisr_handler' structures for each
registered NETISR_ type. These include name, handler function,
optional mbuf to flow ID function, optional mbuf to CPU ID function,
queue limit, and ordering policy. Padding is present to allow these
to be expanded in the future. If no queue limit is declared, then
a default is used.
- Queue limits are now per-workstream, and raised from the previous
IFQ_MAXLEN default of 50 to 256.
- All protocols are updated to use the new registration interface, and
with the exception of netnatm, default queue limits. Most protocols
register as NETISR_POLICY_SOURCE, except IPv4 and IPv6, which use
NETISR_POLICY_FLOW, and will therefore take advantage of driver-
generated flow IDs if present.
- Formalize a non-packet based interface between interface polling and
the netisr, rather than having polling pretend to be two protocols.
Provide two explicit hooks in the netisr worker for start and end
events for runs: netisr_poll() and netisr_pollmore(), as well as a
function, netisr_sched_poll(), to allow the polling code to schedule
netisr execution. DEVICE_POLLING still embeds single-netisr
assumptions in its implementation, so for now if it is compiled into
the kernel, a single and un-bound netisr thread is enforced
regardless of tunable configuration.
In the default configuration, the new netisr implementation maintains
the same basic assumptions as the previous implementation: a single,
un-bound worker thread processes all deferred work, and direct dispatch
is enabled by default wherever possible.
Performance measurement shows a marginal performance improvement over
the old implementation due to the use of batched dequeue.
An rmlock is used to synchronize use and registration/unregistration
using the framework; currently, synchronized use is disabled
(replicating current netisr policy) due to a measurable 3%-6% hit in
ping-pong micro-benchmarking. It will be enabled once further rmlock
optimization has taken place. However, in practice, netisrs are
rarely registered or unregistered at runtime.
A new man page for netisr will follow, but since one doesn't currently
exist, it hasn't been updated.
This change is not appropriate for MFC, although the polling shutdown
handler should be merged to 7-STABLE.
Bump __FreeBSD_version.
Reviewed by: bz
2009-06-01 10:41:38 +00:00
|
|
|
netisr_register(&ipx_nh);
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* IPX input routine. Pass to next level.
|
|
|
|
*/
|
2003-03-04 23:19:55 +00:00
|
|
|
static void
|
|
|
|
ipxintr(struct mbuf *m)
|
1995-10-26 20:31:59 +00:00
|
|
|
{
|
2007-05-11 10:38:34 +00:00
|
|
|
struct ipx *ipx;
|
|
|
|
struct ipxpcb *ipxp;
|
1997-05-10 09:58:58 +00:00
|
|
|
struct ipx_ifaddr *ia;
|
2003-03-04 23:19:55 +00:00
|
|
|
int len;
|
1995-10-26 20:31:59 +00:00
|
|
|
|
1997-05-10 09:58:58 +00:00
|
|
|
/*
|
|
|
|
* If no IPX addresses have been set yet but the interfaces
|
|
|
|
* are receiving, can't do anything with incoming packets yet.
|
|
|
|
*/
|
2009-06-24 20:57:50 +00:00
|
|
|
if (TAILQ_EMPTY(&ipx_ifaddrhead)) {
|
2005-01-09 04:39:16 +00:00
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
1997-05-10 09:58:58 +00:00
|
|
|
|
|
|
|
ipxstat.ipxs_total++;
|
|
|
|
|
|
|
|
if ((m->m_flags & M_EXT || m->m_len < sizeof(struct ipx)) &&
|
2005-04-10 18:05:02 +00:00
|
|
|
(m = m_pullup(m, sizeof(struct ipx))) == NULL) {
|
1995-10-26 20:31:59 +00:00
|
|
|
ipxstat.ipxs_toosmall++;
|
2003-03-04 23:19:55 +00:00
|
|
|
return;
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Give any raw listeners a crack at the packet
|
|
|
|
*/
|
2005-01-09 05:06:19 +00:00
|
|
|
IPX_LIST_LOCK();
|
2004-12-30 17:49:40 +00:00
|
|
|
LIST_FOREACH(ipxp, &ipxrawpcb_list, ipxp_list) {
|
1995-10-26 20:31:59 +00:00
|
|
|
struct mbuf *m1 = m_copy(m, 0, (int)M_COPYALL);
|
2005-01-09 05:08:47 +00:00
|
|
|
if (m1 != NULL) {
|
|
|
|
IPX_LOCK(ipxp);
|
1997-05-10 09:58:58 +00:00
|
|
|
ipx_input(m1, ipxp);
|
2005-01-09 05:08:47 +00:00
|
|
|
IPX_UNLOCK(ipxp);
|
|
|
|
}
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
2005-01-09 05:06:19 +00:00
|
|
|
IPX_LIST_UNLOCK();
|
1995-10-26 20:31:59 +00:00
|
|
|
|
|
|
|
ipx = mtod(m, struct ipx *);
|
|
|
|
len = ntohs(ipx->ipx_len);
|
|
|
|
/*
|
|
|
|
* Check that the amount of data in the buffers
|
|
|
|
* is as at least much as the IPX header would have us expect.
|
|
|
|
* Trim mbufs if longer than we expect.
|
|
|
|
* Drop packet if shorter than we expect.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len < len) {
|
|
|
|
ipxstat.ipxs_tooshort++;
|
2005-01-09 04:39:16 +00:00
|
|
|
m_freem(m);
|
|
|
|
return;
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
if (m->m_pkthdr.len > len) {
|
|
|
|
if (m->m_len == m->m_pkthdr.len) {
|
|
|
|
m->m_len = len;
|
|
|
|
m->m_pkthdr.len = len;
|
|
|
|
} else
|
|
|
|
m_adj(m, len - m->m_pkthdr.len);
|
|
|
|
}
|
1999-08-28 18:21:55 +00:00
|
|
|
if (ipxcksum && ipx->ipx_sum != 0xffff) {
|
|
|
|
if (ipx->ipx_sum != ipx_cksum(m, len)) {
|
1995-10-26 20:31:59 +00:00
|
|
|
ipxstat.ipxs_badsum++;
|
2005-01-09 04:39:16 +00:00
|
|
|
m_freem(m);
|
|
|
|
return;
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
}
|
1997-05-10 09:58:58 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Propagated (Netbios) packets (type 20) has to be handled
|
|
|
|
* different. :-(
|
|
|
|
*/
|
|
|
|
if (ipx->ipx_pt == IPXPROTO_NETBIOS) {
|
|
|
|
if (ipxnetbios) {
|
|
|
|
ipx_output_type20(m);
|
2003-03-04 23:19:55 +00:00
|
|
|
return;
|
2005-01-09 04:39:16 +00:00
|
|
|
} else {
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
1997-05-10 09:58:58 +00:00
|
|
|
}
|
|
|
|
|
1995-10-26 20:31:59 +00:00
|
|
|
/*
|
|
|
|
* Is this a directed broadcast?
|
|
|
|
*/
|
|
|
|
if (ipx_hosteqnh(ipx_broadhost,ipx->ipx_dna.x_host)) {
|
|
|
|
if ((!ipx_neteq(ipx->ipx_dna, ipx->ipx_sna)) &&
|
|
|
|
(!ipx_neteqnn(ipx->ipx_dna.x_net, ipx_broadnet)) &&
|
|
|
|
(!ipx_neteqnn(ipx->ipx_sna.x_net, ipx_zeronet)) &&
|
|
|
|
(!ipx_neteqnn(ipx->ipx_dna.x_net, ipx_zeronet)) ) {
|
1997-05-10 09:58:58 +00:00
|
|
|
/*
|
|
|
|
* If it is a broadcast to the net where it was
|
|
|
|
* received from, treat it as ours.
|
|
|
|
*/
|
2009-06-21 21:04:12 +00:00
|
|
|
IPX_IFADDR_RLOCK();
|
2009-06-24 20:57:50 +00:00
|
|
|
TAILQ_FOREACH(ia, &ipx_ifaddrhead, ia_link) {
|
|
|
|
if ((ia->ia_ifa.ifa_ifp == m->m_pkthdr.rcvif)
|
|
|
|
&& ipx_neteq(ia->ia_addr.sipx_addr,
|
|
|
|
ipx->ipx_dna)) {
|
2009-06-21 21:04:12 +00:00
|
|
|
IPX_IFADDR_RUNLOCK();
|
1997-05-10 09:58:58 +00:00
|
|
|
goto ours;
|
2009-06-21 21:04:12 +00:00
|
|
|
}
|
2009-06-24 20:57:50 +00:00
|
|
|
}
|
2009-06-21 21:04:12 +00:00
|
|
|
IPX_IFADDR_RUNLOCK();
|
1997-05-10 09:58:58 +00:00
|
|
|
|
1995-10-26 20:31:59 +00:00
|
|
|
/*
|
|
|
|
* Look to see if I need to eat this packet.
|
|
|
|
* Algorithm is to forward all young packets
|
|
|
|
* and prematurely age any packets which will
|
|
|
|
* by physically broadcasted.
|
|
|
|
* Any very old packets eaten without forwarding
|
|
|
|
* would die anyway.
|
|
|
|
*
|
|
|
|
* Suggestion of Bill Nesheim, Cornell U.
|
|
|
|
*/
|
|
|
|
if (ipx->ipx_tc < IPX_MAXHOPS) {
|
|
|
|
ipx_forward(m);
|
2003-03-04 23:19:55 +00:00
|
|
|
return;
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Is this our packet? If not, forward.
|
|
|
|
*/
|
1997-05-10 09:58:58 +00:00
|
|
|
} else {
|
2009-06-21 21:04:12 +00:00
|
|
|
IPX_IFADDR_RLOCK();
|
2009-06-24 20:57:50 +00:00
|
|
|
TAILQ_FOREACH(ia, &ipx_ifaddrhead, ia_link) {
|
1997-05-10 09:58:58 +00:00
|
|
|
if (ipx_hosteq(ipx->ipx_dna, ia->ia_addr.sipx_addr) &&
|
|
|
|
(ipx_neteq(ipx->ipx_dna, ia->ia_addr.sipx_addr) ||
|
|
|
|
ipx_neteqnn(ipx->ipx_dna.x_net, ipx_zeronet)))
|
|
|
|
break;
|
2009-06-24 20:57:50 +00:00
|
|
|
}
|
2009-06-21 21:04:12 +00:00
|
|
|
IPX_IFADDR_RUNLOCK();
|
1997-05-10 09:58:58 +00:00
|
|
|
if (ia == NULL) {
|
|
|
|
ipx_forward(m);
|
2003-03-04 23:19:55 +00:00
|
|
|
return;
|
1997-05-10 09:58:58 +00:00
|
|
|
}
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
1997-05-10 09:58:58 +00:00
|
|
|
ours:
|
1995-10-26 20:31:59 +00:00
|
|
|
/*
|
|
|
|
* Locate pcb for datagram.
|
|
|
|
*/
|
2005-01-09 05:06:19 +00:00
|
|
|
IPX_LIST_LOCK();
|
1995-10-26 20:31:59 +00:00
|
|
|
ipxp = ipx_pcblookup(&ipx->ipx_sna, ipx->ipx_dna.x_port, IPX_WILDCARD);
|
|
|
|
/*
|
|
|
|
* Switch out to protocol's input routine.
|
|
|
|
*/
|
1997-05-10 09:58:58 +00:00
|
|
|
if (ipxp != NULL) {
|
|
|
|
ipxstat.ipxs_delivered++;
|
|
|
|
if ((ipxp->ipxp_flags & IPXP_ALL_PACKETS) == 0)
|
1995-10-26 20:31:59 +00:00
|
|
|
switch (ipx->ipx_pt) {
|
2003-03-04 23:19:55 +00:00
|
|
|
case IPXPROTO_SPX:
|
2005-01-09 05:31:16 +00:00
|
|
|
IPX_LOCK(ipxp);
|
|
|
|
/* Will release both locks. */
|
2003-03-04 23:19:55 +00:00
|
|
|
spx_input(m, ipxp);
|
|
|
|
return;
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
2005-01-09 05:08:47 +00:00
|
|
|
IPX_LOCK(ipxp);
|
1995-10-26 20:31:59 +00:00
|
|
|
ipx_input(m, ipxp);
|
2005-01-09 05:08:47 +00:00
|
|
|
IPX_UNLOCK(ipxp);
|
1997-06-26 19:36:03 +00:00
|
|
|
} else
|
2005-01-09 04:39:16 +00:00
|
|
|
m_freem(m);
|
2005-01-09 05:06:19 +00:00
|
|
|
IPX_LIST_UNLOCK();
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1995-12-16 02:14:44 +00:00
|
|
|
ipx_ctlinput(cmd, arg_as_sa, dummy)
|
1995-10-26 20:31:59 +00:00
|
|
|
int cmd;
|
1995-12-16 02:14:44 +00:00
|
|
|
struct sockaddr *arg_as_sa; /* XXX should be swapped with dummy */
|
|
|
|
void *dummy;
|
1995-10-26 20:31:59 +00:00
|
|
|
{
|
|
|
|
|
2006-03-23 19:50:00 +00:00
|
|
|
/* Currently, nothing. */
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
|
1997-05-10 09:58:58 +00:00
|
|
|
/*
|
|
|
|
* Forward a packet. If some error occurs drop the packet. IPX don't
|
|
|
|
* have a way to return errors to the sender.
|
|
|
|
*/
|
|
|
|
|
1998-02-09 06:11:36 +00:00
|
|
|
static struct route ipx_droute;
|
|
|
|
static struct route ipx_sroute;
|
1995-10-26 20:31:59 +00:00
|
|
|
|
1997-05-10 09:58:58 +00:00
|
|
|
static void
|
2007-05-11 10:38:34 +00:00
|
|
|
ipx_forward(struct mbuf *m)
|
1995-10-26 20:31:59 +00:00
|
|
|
{
|
2007-05-11 10:38:34 +00:00
|
|
|
struct ipx *ipx = mtod(m, struct ipx *);
|
|
|
|
int error;
|
1995-10-26 20:31:59 +00:00
|
|
|
int agedelta = 1;
|
|
|
|
int flags = IPX_FORWARDING;
|
|
|
|
int ok_there = 0;
|
|
|
|
int ok_back = 0;
|
|
|
|
|
|
|
|
if (ipxforwarding == 0) {
|
|
|
|
/* can't tell difference between net and host */
|
1997-05-10 09:58:58 +00:00
|
|
|
ipxstat.ipxs_cantforward++;
|
|
|
|
m_freem(m);
|
|
|
|
goto cleanup;
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
ipx->ipx_tc++;
|
|
|
|
if (ipx->ipx_tc > IPX_MAXHOPS) {
|
1997-05-10 09:58:58 +00:00
|
|
|
ipxstat.ipxs_cantforward++;
|
|
|
|
m_freem(m);
|
|
|
|
goto cleanup;
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
1997-05-10 09:58:58 +00:00
|
|
|
|
|
|
|
if ((ok_there = ipx_do_route(&ipx->ipx_dna,&ipx_droute)) == 0) {
|
|
|
|
ipxstat.ipxs_noroute++;
|
|
|
|
m_freem(m);
|
|
|
|
goto cleanup;
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Here we think about forwarding broadcast packets,
|
|
|
|
* so we try to insure that it doesn't go back out
|
|
|
|
* on the interface it came in on. Also, if we
|
|
|
|
* are going to physically broadcast this, let us
|
|
|
|
* age the packet so we can eat it safely the second time around.
|
|
|
|
*/
|
|
|
|
if (ipx->ipx_dna.x_host.c_host[0] & 0x1) {
|
2009-06-21 21:04:12 +00:00
|
|
|
struct ipx_ifaddr *ia;
|
1995-10-26 20:31:59 +00:00
|
|
|
struct ifnet *ifp;
|
2009-06-21 21:04:12 +00:00
|
|
|
|
|
|
|
IPX_IFADDR_RLOCK();
|
|
|
|
ia = ipx_iaonnetof(&ipx->ipx_dna);
|
1997-05-10 09:58:58 +00:00
|
|
|
if (ia != NULL) {
|
1995-10-26 20:31:59 +00:00
|
|
|
/* I'm gonna hafta eat this packet */
|
|
|
|
agedelta += IPX_MAXHOPS - ipx->ipx_tc;
|
|
|
|
ipx->ipx_tc = IPX_MAXHOPS;
|
|
|
|
}
|
2009-06-21 21:04:12 +00:00
|
|
|
IPX_IFADDR_RUNLOCK();
|
1997-05-10 09:58:58 +00:00
|
|
|
if ((ok_back = ipx_do_route(&ipx->ipx_sna,&ipx_sroute)) == 0) {
|
1995-10-26 20:31:59 +00:00
|
|
|
/* error = ENETUNREACH; He'll never get it! */
|
1997-05-10 09:58:58 +00:00
|
|
|
ipxstat.ipxs_noroute++;
|
1995-10-26 20:31:59 +00:00
|
|
|
m_freem(m);
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
if (ipx_droute.ro_rt &&
|
1997-05-10 09:58:58 +00:00
|
|
|
(ifp = ipx_droute.ro_rt->rt_ifp) &&
|
1995-10-26 20:31:59 +00:00
|
|
|
ipx_sroute.ro_rt &&
|
1997-05-10 09:58:58 +00:00
|
|
|
(ifp != ipx_sroute.ro_rt->rt_ifp)) {
|
1995-10-26 20:31:59 +00:00
|
|
|
flags |= IPX_ALLOWBROADCAST;
|
|
|
|
} else {
|
1997-05-10 09:58:58 +00:00
|
|
|
ipxstat.ipxs_noroute++;
|
|
|
|
m_freem(m);
|
|
|
|
goto cleanup;
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|
|
|
|
}
|
1999-08-28 18:21:55 +00:00
|
|
|
/*
|
|
|
|
* We don't need to recompute checksum because ipx_tc field
|
|
|
|
* is ignored by checksum calculation routine, however
|
|
|
|
* it may be desirable to reset checksum if ipxcksum == 0
|
1997-05-10 09:58:58 +00:00
|
|
|
*/
|
1999-08-28 18:21:55 +00:00
|
|
|
#if 0
|
|
|
|
if (!ipxcksum)
|
1995-10-26 20:31:59 +00:00
|
|
|
ipx->ipx_sum = 0xffff;
|
1999-08-28 18:21:55 +00:00
|
|
|
#endif
|
1995-10-26 20:31:59 +00:00
|
|
|
|
|
|
|
error = ipx_outputfl(m, &ipx_droute, flags);
|
1997-05-10 09:58:58 +00:00
|
|
|
if (error == 0) {
|
|
|
|
ipxstat.ipxs_forward++;
|
|
|
|
|
|
|
|
if (ipxprintfs) {
|
|
|
|
printf("forward: ");
|
|
|
|
ipx_printhost(&ipx->ipx_sna);
|
|
|
|
printf(" to ");
|
|
|
|
ipx_printhost(&ipx->ipx_dna);
|
|
|
|
printf(" hops %d\n", ipx->ipx_tc);
|
|
|
|
}
|
2006-01-13 23:47:55 +00:00
|
|
|
}
|
1995-10-26 20:31:59 +00:00
|
|
|
cleanup:
|
|
|
|
if (ok_there)
|
|
|
|
ipx_undo_route(&ipx_droute);
|
|
|
|
if (ok_back)
|
|
|
|
ipx_undo_route(&ipx_sroute);
|
|
|
|
}
|
|
|
|
|
1997-05-10 09:58:58 +00:00
|
|
|
static int
|
2007-05-11 10:38:34 +00:00
|
|
|
ipx_do_route(struct ipx_addr *src, struct route *ro)
|
1995-10-26 20:31:59 +00:00
|
|
|
{
|
|
|
|
struct sockaddr_ipx *dst;
|
|
|
|
|
1997-05-10 09:58:58 +00:00
|
|
|
bzero((caddr_t)ro, sizeof(*ro));
|
1995-10-26 20:31:59 +00:00
|
|
|
dst = (struct sockaddr_ipx *)&ro->ro_dst;
|
|
|
|
|
|
|
|
dst->sipx_len = sizeof(*dst);
|
|
|
|
dst->sipx_family = AF_IPX;
|
|
|
|
dst->sipx_addr = *src;
|
|
|
|
dst->sipx_addr.x_port = 0;
|
2005-01-02 01:39:38 +00:00
|
|
|
rtalloc_ign(ro, 0);
|
1997-05-10 09:58:58 +00:00
|
|
|
if (ro->ro_rt == NULL || ro->ro_rt->rt_ifp == NULL) {
|
1995-10-26 20:31:59 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
ro->ro_rt->rt_use++;
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
1997-05-10 09:58:58 +00:00
|
|
|
static void
|
2007-05-11 10:38:34 +00:00
|
|
|
ipx_undo_route(struct route *ro)
|
1995-10-26 20:31:59 +00:00
|
|
|
{
|
2007-05-11 10:38:34 +00:00
|
|
|
|
1997-05-10 09:58:58 +00:00
|
|
|
if (ro->ro_rt != NULL) {
|
|
|
|
RTFREE(ro->ro_rt);
|
|
|
|
}
|
1995-10-26 20:31:59 +00:00
|
|
|
}
|