The goals of the new API is to provide consumers with minimal needed information, but as fast as possible. So we provide full nexthop info copied into alighed on-cache structure instead of rte/ia pointers, their refcounts and locks. This does not provide solution for protecting from egress ifp destruction, but does not make it any worse. Current changes: nhops: Add fib4_lookup_prepend() function which stores either full L2+L3 prepend info (e.g. MAC header in case of plain IPv4) or L3 info with NH_FLAGS_L2_INCOMPLETE flag indicating that no valid L2 info exists and we have to take "slow" path. ip_output: Currently ip[ 46]_output consumers use 'struct route' for the following purposes: 1) double lookup avoidance(route caching) 2) plain route caching 3) get path MTU to be able to notify source. The former pattern is mostly used by various tunnels (gif, gre, stf). (Actually, gre is the only remaining, others were already converted. Their locking model did not scale good enogh to benefit from such caching, so we have (temporarily) removed it without any performance loss). Plain route caching used by SCTP is simply wrong and should be removed. Temporary break it for now just to be able to compile. Optimize path mtu reporting by providing it in new 'route_info' stucture. Minimize games with @ia locking/refcounting for route lookup: add special nhop[46]_extended structure to store more route attributes. Pointer to given structure can be passed to fib4_lookup_prepend() to indicate we want this info (we actually needs it for UDP and raw IP). ether_output: Provide light-weight ether_output2() call to deal with transmitting L2 frame (e.g. properly handle broadcast/simloop/bridge/ other L2 hooks before actually transmitting frame by if_transmit()). Add a hack based on new RT_NHOP ro_flag to distinguish which version should we call. Better way is probably to add a new "if_output_frame" driver callbacks. Next steps: * Convert ip_fastfwd part * Implement auto-growing array for per-radix nexthops * Implement LLE tracking for nexthop calculations to be able to immediately provide all necessary info in single route lookup for gateway routes * Switch radix locking scheme to runtime/cfg lock * Implement multipath support for rtsock * Implement "tracked nexthops" for tunnels (e.g. _proper_ nexthop caching) * Add IPv6 support for remaining parts (postponed not to interfere with user/ae/inet6 branch) * Consider adding "if_output_frame" driver call to ease logical frame pushing.
130 lines
4.7 KiB
C
130 lines
4.7 KiB
C
/*-
|
|
* Copyright (c) 1982, 1986, 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.
|
|
* 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.
|
|
*
|
|
* @(#)if_ether.h 8.3 (Berkeley) 5/2/95
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifndef _NETINET_IF_ETHER_H_
|
|
#define _NETINET_IF_ETHER_H_
|
|
|
|
#include <net/ethernet.h>
|
|
#include <net/if_arp.h>
|
|
|
|
/*
|
|
* Macro to map an IP multicast address to an Ethernet multicast address.
|
|
* The high-order 25 bits of the Ethernet address are statically assigned,
|
|
* and the low-order 23 bits are taken from the low end of the IP address.
|
|
*/
|
|
#define ETHER_MAP_IP_MULTICAST(ipaddr, enaddr) \
|
|
/* struct in_addr *ipaddr; */ \
|
|
/* u_char enaddr[ETHER_ADDR_LEN]; */ \
|
|
{ \
|
|
(enaddr)[0] = 0x01; \
|
|
(enaddr)[1] = 0x00; \
|
|
(enaddr)[2] = 0x5e; \
|
|
(enaddr)[3] = ((const u_char *)ipaddr)[1] & 0x7f; \
|
|
(enaddr)[4] = ((const u_char *)ipaddr)[2]; \
|
|
(enaddr)[5] = ((const u_char *)ipaddr)[3]; \
|
|
}
|
|
/*
|
|
* Macro to map an IP6 multicast address to an Ethernet multicast address.
|
|
* The high-order 16 bits of the Ethernet address are statically assigned,
|
|
* and the low-order 32 bits are taken from the low end of the IP6 address.
|
|
*/
|
|
#define ETHER_MAP_IPV6_MULTICAST(ip6addr, enaddr) \
|
|
/* struct in6_addr *ip6addr; */ \
|
|
/* u_char enaddr[ETHER_ADDR_LEN]; */ \
|
|
{ \
|
|
(enaddr)[0] = 0x33; \
|
|
(enaddr)[1] = 0x33; \
|
|
(enaddr)[2] = ((const u_char *)ip6addr)[12]; \
|
|
(enaddr)[3] = ((const u_char *)ip6addr)[13]; \
|
|
(enaddr)[4] = ((const u_char *)ip6addr)[14]; \
|
|
(enaddr)[5] = ((const u_char *)ip6addr)[15]; \
|
|
}
|
|
|
|
/*
|
|
* Ethernet Address Resolution Protocol.
|
|
*
|
|
* See RFC 826 for protocol description. Structure below is adapted
|
|
* to resolving internet addresses. Field names used correspond to
|
|
* RFC 826.
|
|
*/
|
|
struct ether_arp {
|
|
struct arphdr ea_hdr; /* fixed-size header */
|
|
u_char arp_sha[ETHER_ADDR_LEN]; /* sender hardware address */
|
|
u_char arp_spa[4]; /* sender protocol address */
|
|
u_char arp_tha[ETHER_ADDR_LEN]; /* target hardware address */
|
|
u_char arp_tpa[4]; /* target protocol address */
|
|
};
|
|
#define arp_hrd ea_hdr.ar_hrd
|
|
#define arp_pro ea_hdr.ar_pro
|
|
#define arp_hln ea_hdr.ar_hln
|
|
#define arp_pln ea_hdr.ar_pln
|
|
#define arp_op ea_hdr.ar_op
|
|
|
|
#ifndef BURN_BRIDGES /* Can be used by third party software. */
|
|
struct sockaddr_inarp {
|
|
u_char sin_len;
|
|
u_char sin_family;
|
|
u_short sin_port;
|
|
struct in_addr sin_addr;
|
|
struct in_addr sin_srcaddr;
|
|
u_short sin_tos;
|
|
u_short sin_other;
|
|
#define SIN_PROXY 1
|
|
};
|
|
#endif /* !BURN_BRIDGES */
|
|
|
|
/*
|
|
* IP and ethernet specific routing flags
|
|
*/
|
|
#define RTF_USETRAILERS RTF_PROTO1 /* use trailers */
|
|
#define RTF_ANNOUNCE RTF_PROTO2 /* announce new arp entry */
|
|
|
|
#ifdef _KERNEL
|
|
extern u_char ether_ipmulticast_min[ETHER_ADDR_LEN];
|
|
extern u_char ether_ipmulticast_max[ETHER_ADDR_LEN];
|
|
|
|
struct llentry;
|
|
struct ifaddr;
|
|
|
|
int arpresolve(struct ifnet *ifp, struct rtentry *rt, struct mbuf *m,
|
|
const struct sockaddr *dst, u_char *desten, struct llentry **lle);
|
|
int arpresolve_fast(struct ifnet *ifp, struct in_addr dst, u_int mflags,
|
|
u_char *dst_addr);
|
|
void arprequest(struct ifnet *, const struct in_addr *,
|
|
const struct in_addr *, u_char *);
|
|
void arp_ifinit(struct ifnet *, struct ifaddr *);
|
|
void arp_ifinit2(struct ifnet *, struct ifaddr *, u_char *);
|
|
void arp_ifscrub(struct ifnet *, uint32_t);
|
|
#endif
|
|
|
|
#endif
|