2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* INET An implementation of the TCP/IP protocol suite for the LINUX
|
|
|
|
* operating system. NET is implemented using the BSD Socket
|
|
|
|
* interface as the means of communication with the user level.
|
|
|
|
*
|
|
|
|
* Definitions for the Ethernet handlers.
|
|
|
|
*
|
|
|
|
* Version: @(#)eth.h 1.0.4 05/13/93
|
|
|
|
*
|
2005-05-06 03:16:16 +04:00
|
|
|
* Authors: Ross Biro
|
2005-04-17 02:20:36 +04:00
|
|
|
* Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
|
|
|
|
*
|
|
|
|
* Relocated to include/linux where it belongs by Alan Cox
|
|
|
|
* <gw4pts@gw4pts.ampr.org>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
#ifndef _LINUX_ETHERDEVICE_H
|
|
|
|
#define _LINUX_ETHERDEVICE_H
|
|
|
|
|
|
|
|
#include <linux/if_ether.h>
|
2005-06-29 02:58:50 +04:00
|
|
|
#include <linux/netdevice.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
#include <linux/random.h>
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
#include <asm/unaligned.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
#ifdef __KERNEL__
|
2005-07-12 23:08:43 +04:00
|
|
|
extern __be16 eth_type_trans(struct sk_buff *skb, struct net_device *dev);
|
2007-10-09 12:40:57 +04:00
|
|
|
extern const struct header_ops eth_header_ops;
|
|
|
|
|
|
|
|
extern int eth_header(struct sk_buff *skb, struct net_device *dev,
|
|
|
|
unsigned short type,
|
|
|
|
const void *daddr, const void *saddr, unsigned len);
|
|
|
|
extern int eth_rebuild_header(struct sk_buff *skb);
|
|
|
|
extern int eth_header_parse(const struct sk_buff *skb, unsigned char *haddr);
|
2011-07-13 10:28:12 +04:00
|
|
|
extern int eth_header_cache(const struct neighbour *neigh, struct hh_cache *hh, __be16 type);
|
2007-10-09 12:40:57 +04:00
|
|
|
extern void eth_header_cache_update(struct hh_cache *hh,
|
|
|
|
const struct net_device *dev,
|
|
|
|
const unsigned char *haddr);
|
2008-11-20 09:42:31 +03:00
|
|
|
extern int eth_mac_addr(struct net_device *dev, void *p);
|
|
|
|
extern int eth_change_mtu(struct net_device *dev, int new_mtu);
|
|
|
|
extern int eth_validate_addr(struct net_device *dev);
|
|
|
|
|
2007-10-09 12:40:57 +04:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2011-01-09 22:36:31 +03:00
|
|
|
extern struct net_device *alloc_etherdev_mqs(int sizeof_priv, unsigned int txqs,
|
|
|
|
unsigned int rxqs);
|
2007-07-07 00:36:20 +04:00
|
|
|
#define alloc_etherdev(sizeof_priv) alloc_etherdev_mq(sizeof_priv, 1)
|
2011-01-09 22:36:31 +03:00
|
|
|
#define alloc_etherdev_mq(sizeof_priv, count) alloc_etherdev_mqs(sizeof_priv, count, count)
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/**
|
2005-11-02 04:05:09 +03:00
|
|
|
* is_zero_ether_addr - Determine if give Ethernet address is all zeros.
|
|
|
|
* @addr: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
*
|
|
|
|
* Return true if the address is all zeroes.
|
2005-04-17 02:20:36 +04:00
|
|
|
*/
|
2012-05-08 10:44:40 +04:00
|
|
|
static inline bool is_zero_ether_addr(const u8 *addr)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
return !(addr[0] | addr[1] | addr[2] | addr[3] | addr[4] | addr[5]);
|
|
|
|
}
|
|
|
|
|
2005-05-30 07:24:30 +04:00
|
|
|
/**
|
2005-11-02 04:05:09 +03:00
|
|
|
* is_multicast_ether_addr - Determine if the Ethernet address is a multicast.
|
2005-05-30 07:24:30 +04:00
|
|
|
* @addr: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
*
|
|
|
|
* Return true if the address is a multicast address.
|
2006-01-04 02:25:45 +03:00
|
|
|
* By definition the broadcast address is also a multicast address.
|
2005-05-30 07:24:30 +04:00
|
|
|
*/
|
2012-05-08 10:44:40 +04:00
|
|
|
static inline bool is_multicast_ether_addr(const u8 *addr)
|
2005-05-30 07:24:30 +04:00
|
|
|
{
|
2010-09-23 00:43:57 +04:00
|
|
|
return 0x01 & addr[0];
|
2005-05-30 07:24:30 +04:00
|
|
|
}
|
|
|
|
|
2007-05-07 01:51:13 +04:00
|
|
|
/**
|
2008-02-14 02:03:25 +03:00
|
|
|
* is_local_ether_addr - Determine if the Ethernet address is locally-assigned one (IEEE 802).
|
2007-05-07 01:51:13 +04:00
|
|
|
* @addr: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
*
|
|
|
|
* Return true if the address is a local address.
|
|
|
|
*/
|
2012-05-08 10:44:40 +04:00
|
|
|
static inline bool is_local_ether_addr(const u8 *addr)
|
2007-05-07 01:51:13 +04:00
|
|
|
{
|
2010-09-23 00:43:57 +04:00
|
|
|
return 0x02 & addr[0];
|
2007-05-07 01:51:13 +04:00
|
|
|
}
|
|
|
|
|
2005-11-02 04:05:09 +03:00
|
|
|
/**
|
|
|
|
* is_broadcast_ether_addr - Determine if the Ethernet address is broadcast
|
|
|
|
* @addr: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
*
|
|
|
|
* Return true if the address is the broadcast address.
|
|
|
|
*/
|
2012-05-08 10:44:40 +04:00
|
|
|
static inline bool is_broadcast_ether_addr(const u8 *addr)
|
2005-06-28 09:46:35 +04:00
|
|
|
{
|
2005-11-02 03:52:11 +03:00
|
|
|
return (addr[0] & addr[1] & addr[2] & addr[3] & addr[4] & addr[5]) == 0xff;
|
2005-06-28 09:46:35 +04:00
|
|
|
}
|
|
|
|
|
2011-01-13 01:14:56 +03:00
|
|
|
/**
|
|
|
|
* is_unicast_ether_addr - Determine if the Ethernet address is unicast
|
|
|
|
* @addr: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
*
|
|
|
|
* Return true if the address is a unicast address.
|
|
|
|
*/
|
2012-05-08 10:44:40 +04:00
|
|
|
static inline bool is_unicast_ether_addr(const u8 *addr)
|
2011-01-13 01:14:56 +03:00
|
|
|
{
|
|
|
|
return !is_multicast_ether_addr(addr);
|
|
|
|
}
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/**
|
|
|
|
* is_valid_ether_addr - Determine if the given Ethernet address is valid
|
|
|
|
* @addr: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
*
|
|
|
|
* Check that the Ethernet address (MAC) is not 00:00:00:00:00:00, is not
|
2005-05-30 07:24:30 +04:00
|
|
|
* a multicast address, and is not FF:FF:FF:FF:FF:FF.
|
2005-04-17 02:20:36 +04:00
|
|
|
*
|
|
|
|
* Return true if the address is valid.
|
|
|
|
*/
|
2012-05-08 10:44:40 +04:00
|
|
|
static inline bool is_valid_ether_addr(const u8 *addr)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2005-05-30 07:24:30 +04:00
|
|
|
/* FF:FF:FF:FF:FF:FF is a multicast address so we don't need to
|
|
|
|
* explicitly check for it here. */
|
|
|
|
return !is_multicast_ether_addr(addr) && !is_zero_ether_addr(addr);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2012-07-12 23:33:05 +04:00
|
|
|
* eth_random_addr - Generate software assigned random Ethernet address
|
2005-04-17 02:20:36 +04:00
|
|
|
* @addr: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
*
|
|
|
|
* Generate a random Ethernet address (MAC) that is not multicast
|
|
|
|
* and has the local assigned bit set.
|
|
|
|
*/
|
2012-07-12 23:33:05 +04:00
|
|
|
static inline void eth_random_addr(u8 *addr)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2012-07-12 23:33:05 +04:00
|
|
|
get_random_bytes(addr, ETH_ALEN);
|
|
|
|
addr[0] &= 0xfe; /* clear multicast bit */
|
|
|
|
addr[0] |= 0x02; /* set local assignment bit (IEEE802) */
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
2005-10-26 02:03:41 +04:00
|
|
|
|
2012-07-12 23:33:05 +04:00
|
|
|
#define random_ether_addr(addr) eth_random_addr(addr)
|
|
|
|
|
2012-07-10 10:18:44 +04:00
|
|
|
/**
|
|
|
|
* eth_broadcast_addr - Assign broadcast address
|
|
|
|
* @addr: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
*
|
|
|
|
* Assign the broadcast address to the given address array.
|
|
|
|
*/
|
|
|
|
static inline void eth_broadcast_addr(u8 *addr)
|
|
|
|
{
|
|
|
|
memset(addr, 0xff, ETH_ALEN);
|
|
|
|
}
|
|
|
|
|
2010-07-22 06:50:21 +04:00
|
|
|
/**
|
2012-02-09 13:48:54 +04:00
|
|
|
* eth_hw_addr_random - Generate software assigned random Ethernet and
|
|
|
|
* set device flag
|
2010-07-22 06:50:21 +04:00
|
|
|
* @dev: pointer to net_device structure
|
|
|
|
*
|
2012-02-09 13:48:54 +04:00
|
|
|
* Generate a random Ethernet address (MAC) to be used by a net device
|
|
|
|
* and set addr_assign_type so the state can be read by sysfs and be
|
|
|
|
* used by userspace.
|
2010-07-22 06:50:21 +04:00
|
|
|
*/
|
2012-02-09 13:48:54 +04:00
|
|
|
static inline void eth_hw_addr_random(struct net_device *dev)
|
2010-07-22 06:50:21 +04:00
|
|
|
{
|
|
|
|
dev->addr_assign_type |= NET_ADDR_RANDOM;
|
2012-07-12 23:33:05 +04:00
|
|
|
eth_random_addr(dev->dev_addr);
|
2010-07-22 06:50:21 +04:00
|
|
|
}
|
|
|
|
|
2005-10-26 02:03:41 +04:00
|
|
|
/**
|
|
|
|
* compare_ether_addr - Compare two Ethernet addresses
|
|
|
|
* @addr1: Pointer to a six-byte array containing the Ethernet address
|
2005-11-02 04:05:09 +03:00
|
|
|
* @addr2: Pointer other six-byte array containing the Ethernet address
|
2005-10-26 02:03:41 +04:00
|
|
|
*
|
2012-05-17 09:17:28 +04:00
|
|
|
* Compare two Ethernet addresses, returns 0 if equal, non-zero otherwise.
|
2012-05-07 17:39:06 +04:00
|
|
|
* Unlike memcmp(), it doesn't return a value suitable for sorting.
|
2005-10-26 02:03:41 +04:00
|
|
|
*/
|
2005-11-02 04:05:09 +03:00
|
|
|
static inline unsigned compare_ether_addr(const u8 *addr1, const u8 *addr2)
|
2005-10-26 02:03:41 +04:00
|
|
|
{
|
2005-11-02 04:05:09 +03:00
|
|
|
const u16 *a = (const u16 *) addr1;
|
|
|
|
const u16 *b = (const u16 *) addr2;
|
2005-10-26 02:03:41 +04:00
|
|
|
|
|
|
|
BUILD_BUG_ON(ETH_ALEN != 6);
|
|
|
|
return ((a[0] ^ b[0]) | (a[1] ^ b[1]) | (a[2] ^ b[2])) != 0;
|
|
|
|
}
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
|
2012-05-08 22:56:45 +04:00
|
|
|
/**
|
|
|
|
* ether_addr_equal - Compare two Ethernet addresses
|
|
|
|
* @addr1: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
* @addr2: Pointer other six-byte array containing the Ethernet address
|
|
|
|
*
|
2012-05-17 09:17:28 +04:00
|
|
|
* Compare two Ethernet addresses, returns true if equal
|
2012-05-08 22:56:45 +04:00
|
|
|
*/
|
|
|
|
static inline bool ether_addr_equal(const u8 *addr1, const u8 *addr2)
|
|
|
|
{
|
|
|
|
return !compare_ether_addr(addr1, addr2);
|
|
|
|
}
|
|
|
|
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
static inline unsigned long zap_last_2bytes(unsigned long value)
|
|
|
|
{
|
|
|
|
#ifdef __BIG_ENDIAN
|
|
|
|
return value >> 16;
|
|
|
|
#else
|
|
|
|
return value << 16;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2012-05-11 16:21:06 +04:00
|
|
|
* ether_addr_equal_64bits - Compare two Ethernet addresses
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
* @addr1: Pointer to an array of 8 bytes
|
|
|
|
* @addr2: Pointer to an other array of 8 bytes
|
|
|
|
*
|
2012-05-17 09:17:28 +04:00
|
|
|
* Compare two Ethernet addresses, returns true if equal, false otherwise.
|
2012-05-11 16:21:06 +04:00
|
|
|
*
|
2012-05-07 17:39:06 +04:00
|
|
|
* The function doesn't need any conditional branches and possibly uses
|
|
|
|
* word memory accesses on CPU allowing cheap unaligned memory reads.
|
2012-05-17 09:17:28 +04:00
|
|
|
* arrays = { byte1, byte2, byte3, byte4, byte5, byte6, pad1, pad2 }
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
*
|
2012-05-17 09:17:28 +04:00
|
|
|
* Please note that alignment of addr1 & addr2 are only guaranteed to be 16 bits.
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
*/
|
|
|
|
|
2012-05-11 16:21:06 +04:00
|
|
|
static inline bool ether_addr_equal_64bits(const u8 addr1[6+2],
|
|
|
|
const u8 addr2[6+2])
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
{
|
|
|
|
#ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
|
|
|
|
unsigned long fold = ((*(unsigned long *)addr1) ^
|
|
|
|
(*(unsigned long *)addr2));
|
|
|
|
|
|
|
|
if (sizeof(fold) == 8)
|
2012-05-11 16:21:06 +04:00
|
|
|
return zap_last_2bytes(fold) == 0;
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
|
|
|
|
fold |= zap_last_2bytes((*(unsigned long *)(addr1 + 4)) ^
|
|
|
|
(*(unsigned long *)(addr2 + 4)));
|
2012-05-11 16:21:06 +04:00
|
|
|
return fold == 0;
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
#else
|
2012-05-11 16:21:06 +04:00
|
|
|
return ether_addr_equal(addr1, addr2);
|
eth: Declare an optimized compare_ether_addr_64bits() function
Linus mentioned we could try to perform long word operations, even
on potentially unaligned addresses, on x86 at least. David mentioned
the HAVE_EFFICIENT_UNALIGNED_ACCESS test to handle this on all
arches that have efficient unailgned accesses.
I tried this idea and got nice assembly on 32 bits:
158: 33 82 38 01 00 00 xor 0x138(%edx),%eax
15e: 33 8a 34 01 00 00 xor 0x134(%edx),%ecx
164: c1 e0 10 shl $0x10,%eax
167: 09 c1 or %eax,%ecx
169: 74 0b je 176 <eth_type_trans+0x87>
And very nice assembly on 64 bits of course (one xor, one shl)
Nice oprofile improvement in eth_type_trans(), 0.17 % instead of 0.41 %,
expected since we remove 8 instructions on a fast path.
This patch implements a compare_ether_addr_64bits() function, that
uses the CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS ifdef to efficiently
perform the 6 bytes comparison on all capable arches.
Signed-off-by: Eric Dumazet <dada1@cosmosbay.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
2008-11-24 10:24:32 +03:00
|
|
|
#endif
|
|
|
|
}
|
2009-05-05 06:48:28 +04:00
|
|
|
|
|
|
|
/**
|
|
|
|
* is_etherdev_addr - Tell if given Ethernet address belongs to the device.
|
|
|
|
* @dev: Pointer to a device structure
|
|
|
|
* @addr: Pointer to a six-byte array containing the Ethernet address
|
|
|
|
*
|
|
|
|
* Compare passed address with all addresses of the device. Return true if the
|
|
|
|
* address if one of the device addresses.
|
|
|
|
*
|
2012-05-11 16:21:06 +04:00
|
|
|
* Note that this function calls ether_addr_equal_64bits() so take care of
|
2009-05-05 06:48:28 +04:00
|
|
|
* the right padding.
|
|
|
|
*/
|
|
|
|
static inline bool is_etherdev_addr(const struct net_device *dev,
|
|
|
|
const u8 addr[6 + 2])
|
|
|
|
{
|
|
|
|
struct netdev_hw_addr *ha;
|
2012-05-11 16:21:06 +04:00
|
|
|
bool res = false;
|
2009-05-05 06:48:28 +04:00
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
for_each_dev_addr(dev, ha) {
|
2012-05-11 16:21:06 +04:00
|
|
|
res = ether_addr_equal_64bits(addr, ha->addr);
|
|
|
|
if (res)
|
2009-05-05 06:48:28 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
2012-05-11 16:21:06 +04:00
|
|
|
return res;
|
2009-05-05 06:48:28 +04:00
|
|
|
}
|
2005-05-30 07:24:30 +04:00
|
|
|
#endif /* __KERNEL__ */
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2009-02-08 21:00:37 +03:00
|
|
|
/**
|
|
|
|
* compare_ether_header - Compare two Ethernet headers
|
|
|
|
* @a: Pointer to Ethernet header
|
|
|
|
* @b: Pointer to Ethernet header
|
|
|
|
*
|
2012-05-17 09:17:28 +04:00
|
|
|
* Compare two Ethernet headers, returns 0 if equal.
|
2009-02-08 21:00:37 +03:00
|
|
|
* This assumes that the network header (i.e., IP header) is 4-byte
|
|
|
|
* aligned OR the platform can handle unaligned access. This is the
|
|
|
|
* case for all packets coming into netif_receive_skb or similar
|
|
|
|
* entry points.
|
|
|
|
*/
|
|
|
|
|
2010-08-27 09:03:08 +04:00
|
|
|
static inline unsigned long compare_ether_header(const void *a, const void *b)
|
2009-02-08 21:00:37 +03:00
|
|
|
{
|
2010-08-27 09:03:08 +04:00
|
|
|
#if defined(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) && BITS_PER_LONG == 64
|
|
|
|
unsigned long fold;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We want to compare 14 bytes:
|
|
|
|
* [a0 ... a13] ^ [b0 ... b13]
|
|
|
|
* Use two long XOR, ORed together, with an overlap of two bytes.
|
|
|
|
* [a0 a1 a2 a3 a4 a5 a6 a7 ] ^ [b0 b1 b2 b3 b4 b5 b6 b7 ] |
|
|
|
|
* [a6 a7 a8 a9 a10 a11 a12 a13] ^ [b6 b7 b8 b9 b10 b11 b12 b13]
|
|
|
|
* This means the [a6 a7] ^ [b6 b7] part is done two times.
|
|
|
|
*/
|
|
|
|
fold = *(unsigned long *)a ^ *(unsigned long *)b;
|
|
|
|
fold |= *(unsigned long *)(a + 6) ^ *(unsigned long *)(b + 6);
|
|
|
|
return fold;
|
|
|
|
#else
|
2009-02-08 21:00:37 +03:00
|
|
|
u32 *a32 = (u32 *)((u8 *)a + 2);
|
|
|
|
u32 *b32 = (u32 *)((u8 *)b + 2);
|
|
|
|
|
|
|
|
return (*(u16 *)a ^ *(u16 *)b) | (a32[0] ^ b32[0]) |
|
|
|
|
(a32[1] ^ b32[1]) | (a32[2] ^ b32[2]);
|
2010-08-27 09:03:08 +04:00
|
|
|
#endif
|
2009-02-08 21:00:37 +03:00
|
|
|
}
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
#endif /* _LINUX_ETHERDEVICE_H */
|