forked from luck/tmp_suning_uos_patched
a73105b8d4
The client announcement mechanism informs every mesh node in the network of any connected non-mesh client, in order to find the path towards that client from any given point in the mesh. The old implementation was based on the simple idea of appending a data buffer to each OGM containing all the client MAC addresses the node is serving. All other nodes can populate their global translation tables (table which links client MAC addresses to node addresses) using this MAC address buffer and linking it to the node's address contained in the OGM. A node that wants to contact a client has to lookup the node the client is connected to and its address in the global translation table. It is easy to understand that this implementation suffers from several issues: - big overhead (each and every OGM contains the entire list of connected clients) - high latencies for client route updates due to long OGM trip time and OGM losses The new implementation addresses these issues by appending client changes (new client joined or a client left) to the OGM instead of filling it with all the client addresses each time. In this way nodes can modify their global tables by means of "updates", thus reducing the overhead within the OGMs. To keep the entire network in sync each node maintains a translation table version number (ttvn) and a translation table checksum. These values are spread with the OGM to allow all the network participants to determine whether or not they need to update their translation table information. When a translation table lookup is performed in order to send a packet to a client attached to another node, the destination's ttvn is added to the payload packet. Forwarding nodes can compare the packet's ttvn with their destination's ttvn (this node could have a fresher information than the source) and re-route the packet if necessary. This greatly reduces the packet loss of clients roaming from one AP to the next. Signed-off-by: Antonio Quartulli <ordex@autistici.org> Signed-off-by: Marek Lindner <lindner_marek@yahoo.de> Signed-off-by: Sven Eckelmann <sven@narfation.org>
215 lines
6.3 KiB
C
215 lines
6.3 KiB
C
/*
|
|
* Copyright (C) 2007-2011 B.A.T.M.A.N. contributors:
|
|
*
|
|
* Marek Lindner, Simon Wunderlich
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of version 2 of the GNU General Public
|
|
* License as published by the Free Software Foundation.
|
|
*
|
|
* This program is distributed in the hope that it will be useful, but
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
|
* 02110-1301, USA
|
|
*
|
|
*/
|
|
|
|
#ifndef _NET_BATMAN_ADV_MAIN_H_
|
|
#define _NET_BATMAN_ADV_MAIN_H_
|
|
|
|
#define DRIVER_AUTHOR "Marek Lindner <lindner_marek@yahoo.de>, " \
|
|
"Simon Wunderlich <siwu@hrz.tu-chemnitz.de>"
|
|
#define DRIVER_DESC "B.A.T.M.A.N. advanced"
|
|
#define DRIVER_DEVICE "batman-adv"
|
|
|
|
#define SOURCE_VERSION "next"
|
|
|
|
|
|
/* B.A.T.M.A.N. parameters */
|
|
|
|
#define TQ_MAX_VALUE 255
|
|
#define JITTER 20
|
|
|
|
/* Time To Live of broadcast messages */
|
|
#define TTL 50
|
|
|
|
/* purge originators after time in seconds if no valid packet comes in
|
|
* -> TODO: check influence on TQ_LOCAL_WINDOW_SIZE */
|
|
#define PURGE_TIMEOUT 200
|
|
#define TT_LOCAL_TIMEOUT 3600 /* in seconds */
|
|
|
|
/* sliding packet range of received originator messages in squence numbers
|
|
* (should be a multiple of our word size) */
|
|
#define TQ_LOCAL_WINDOW_SIZE 64
|
|
#define TT_REQUEST_TIMEOUT 3 /* seconds we have to keep pending tt_req */
|
|
|
|
#define TQ_GLOBAL_WINDOW_SIZE 5
|
|
#define TQ_LOCAL_BIDRECT_SEND_MINIMUM 1
|
|
#define TQ_LOCAL_BIDRECT_RECV_MINIMUM 1
|
|
#define TQ_TOTAL_BIDRECT_LIMIT 1
|
|
|
|
#define TT_OGM_APPEND_MAX 3 /* number of OGMs sent with the last tt diff */
|
|
|
|
#define NO_FLAGS 0
|
|
|
|
#define NUM_WORDS (TQ_LOCAL_WINDOW_SIZE / WORD_BIT_SIZE)
|
|
|
|
#define LOG_BUF_LEN 8192 /* has to be a power of 2 */
|
|
|
|
#define VIS_INTERVAL 5000 /* 5 seconds */
|
|
|
|
/* how much worse secondary interfaces may be to be considered as bonding
|
|
* candidates */
|
|
#define BONDING_TQ_THRESHOLD 50
|
|
|
|
/* should not be bigger than 512 bytes or change the size of
|
|
* forw_packet->direct_link_flags */
|
|
#define MAX_AGGREGATION_BYTES 512
|
|
#define MAX_AGGREGATION_MS 100
|
|
|
|
#define SOFTIF_NEIGH_TIMEOUT 180000 /* 3 minutes */
|
|
|
|
/* don't reset again within 30 seconds */
|
|
#define RESET_PROTECTION_MS 30000
|
|
#define EXPECTED_SEQNO_RANGE 65536
|
|
|
|
enum mesh_state {
|
|
MESH_INACTIVE,
|
|
MESH_ACTIVE,
|
|
MESH_DEACTIVATING
|
|
};
|
|
|
|
#define BCAST_QUEUE_LEN 256
|
|
#define BATMAN_QUEUE_LEN 256
|
|
|
|
/*
|
|
* Debug Messages
|
|
*/
|
|
#ifdef pr_fmt
|
|
#undef pr_fmt
|
|
#endif
|
|
/* Append 'batman-adv: ' before kernel messages */
|
|
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
|
|
|
|
/* all messages related to routing / flooding / broadcasting / etc */
|
|
enum dbg_level {
|
|
DBG_BATMAN = 1 << 0,
|
|
DBG_ROUTES = 1 << 1, /* route added / changed / deleted */
|
|
DBG_TT = 1 << 2, /* translation table operations */
|
|
DBG_ALL = 7
|
|
};
|
|
|
|
|
|
/*
|
|
* Vis
|
|
*/
|
|
|
|
/*
|
|
* Kernel headers
|
|
*/
|
|
|
|
#include <linux/mutex.h> /* mutex */
|
|
#include <linux/module.h> /* needed by all modules */
|
|
#include <linux/netdevice.h> /* netdevice */
|
|
#include <linux/etherdevice.h> /* ethernet address classifaction */
|
|
#include <linux/if_ether.h> /* ethernet header */
|
|
#include <linux/poll.h> /* poll_table */
|
|
#include <linux/kthread.h> /* kernel threads */
|
|
#include <linux/pkt_sched.h> /* schedule types */
|
|
#include <linux/workqueue.h> /* workqueue */
|
|
#include <linux/slab.h>
|
|
#include <net/sock.h> /* struct sock */
|
|
#include <linux/jiffies.h>
|
|
#include <linux/seq_file.h>
|
|
#include "types.h"
|
|
|
|
#ifndef REVISION_VERSION
|
|
#define REVISION_VERSION_STR ""
|
|
#else
|
|
#define REVISION_VERSION_STR " "REVISION_VERSION
|
|
#endif
|
|
|
|
extern struct list_head hardif_list;
|
|
|
|
extern unsigned char broadcast_addr[];
|
|
extern struct workqueue_struct *bat_event_workqueue;
|
|
|
|
int mesh_init(struct net_device *soft_iface);
|
|
void mesh_free(struct net_device *soft_iface);
|
|
void inc_module_count(void);
|
|
void dec_module_count(void);
|
|
int is_my_mac(const uint8_t *addr);
|
|
|
|
#ifdef CONFIG_BATMAN_ADV_DEBUG
|
|
int debug_log(struct bat_priv *bat_priv, const char *fmt, ...) __printf(2, 3);
|
|
|
|
#define bat_dbg(type, bat_priv, fmt, arg...) \
|
|
do { \
|
|
if (atomic_read(&bat_priv->log_level) & type) \
|
|
debug_log(bat_priv, fmt, ## arg); \
|
|
} \
|
|
while (0)
|
|
#else /* !CONFIG_BATMAN_ADV_DEBUG */
|
|
__printf(3, 4)
|
|
static inline void bat_dbg(int type __always_unused,
|
|
struct bat_priv *bat_priv __always_unused,
|
|
const char *fmt __always_unused, ...)
|
|
{
|
|
}
|
|
#endif
|
|
|
|
#define bat_info(net_dev, fmt, arg...) \
|
|
do { \
|
|
struct net_device *_netdev = (net_dev); \
|
|
struct bat_priv *_batpriv = netdev_priv(_netdev); \
|
|
bat_dbg(DBG_ALL, _batpriv, fmt, ## arg); \
|
|
pr_info("%s: " fmt, _netdev->name, ## arg); \
|
|
} while (0)
|
|
#define bat_err(net_dev, fmt, arg...) \
|
|
do { \
|
|
struct net_device *_netdev = (net_dev); \
|
|
struct bat_priv *_batpriv = netdev_priv(_netdev); \
|
|
bat_dbg(DBG_ALL, _batpriv, fmt, ## arg); \
|
|
pr_err("%s: " fmt, _netdev->name, ## arg); \
|
|
} while (0)
|
|
|
|
/**
|
|
* returns 1 if they are the same ethernet addr
|
|
*
|
|
* note: can't use compare_ether_addr() as it requires aligned memory
|
|
*/
|
|
|
|
static inline int compare_eth(const void *data1, const void *data2)
|
|
{
|
|
return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
|
|
}
|
|
|
|
|
|
#define atomic_dec_not_zero(v) atomic_add_unless((v), -1, 0)
|
|
|
|
/* Returns the smallest signed integer in two's complement with the sizeof x */
|
|
#define smallest_signed_int(x) (1u << (7u + 8u * (sizeof(x) - 1u)))
|
|
|
|
/* Checks if a sequence number x is a predecessor/successor of y.
|
|
* they handle overflows/underflows and can correctly check for a
|
|
* predecessor/successor unless the variable sequence number has grown by
|
|
* more then 2**(bitwidth(x)-1)-1.
|
|
* This means that for a uint8_t with the maximum value 255, it would think:
|
|
* - when adding nothing - it is neither a predecessor nor a successor
|
|
* - before adding more than 127 to the starting value - it is a predecessor,
|
|
* - when adding 128 - it is neither a predecessor nor a successor,
|
|
* - after adding more than 127 to the starting value - it is a successor */
|
|
#define seq_before(x, y) ({typeof(x) _d1 = (x); \
|
|
typeof(y) _d2 = (y); \
|
|
typeof(x) _dummy = (_d1 - _d2); \
|
|
(void) (&_d1 == &_d2); \
|
|
_dummy > smallest_signed_int(_dummy); })
|
|
#define seq_after(x, y) seq_before(y, x)
|
|
|
|
#endif /* _NET_BATMAN_ADV_MAIN_H_ */
|