net/batman-adv/main.h

   1 /*
   2  * Copyright (C) 2007-2012 B.A.T.M.A.N. contributors:
   3  *
   4  * Marek Lindner, Simon Wunderlich
   5  *
   6  * This program is free software; you can redistribute it and/or
   7  * modify it under the terms of version 2 of the GNU General Public
   8  * License as published by the Free Software Foundation.
   9  *
  10  * This program is distributed in the hope that it will be useful, but
  11  * WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13  * General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU General Public License
  16  * along with this program; if not, write to the Free Software
  17  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  18  * 02110-1301, USA
  19  *
  20  */
  21
  22 #ifndef _NET_BATMAN_ADV_MAIN_H_
  23 #define _NET_BATMAN_ADV_MAIN_H_
  24
  25 #define DRIVER_AUTHOR "Marek Lindner <lindner_marek@yahoo.de>, " \
  26                       "Simon Wunderlich <siwu@hrz.tu-chemnitz.de>"
  27 #define DRIVER_DESC   "B.A.T.M.A.N. advanced"
  28 #define DRIVER_DEVICE "batman-adv"
  29
  30 #ifndef SOURCE_VERSION
  31 #define SOURCE_VERSION "2012.1.0"
  32 #endif
  33
  34 /* B.A.T.M.A.N. parameters */
  35
  36 #define TQ_MAX_VALUE 255
  37 #define JITTER 20
  38
  39  /* Time To Live of broadcast messages */
  40 #define TTL 50
  41
  42 /* purge originators after time in seconds if no valid packet comes in
  43  * -> TODO: check influence on TQ_LOCAL_WINDOW_SIZE */
  44 #define PURGE_TIMEOUT 200000 /* 200 seconds */
  45 #define TT_LOCAL_TIMEOUT 3600000 /* in miliseconds */
  46 #define TT_CLIENT_ROAM_TIMEOUT 600000 /* in miliseconds */
  47 /* sliding packet range of received originator messages in sequence numbers
  48  * (should be a multiple of our word size) */
  49 #define TQ_LOCAL_WINDOW_SIZE 64
  50 #define TT_REQUEST_TIMEOUT 3000 /* miliseconds we have to keep
  51                                  * pending tt_req */
  52
  53 #define TQ_GLOBAL_WINDOW_SIZE 5
  54 #define TQ_LOCAL_BIDRECT_SEND_MINIMUM 1
  55 #define TQ_LOCAL_BIDRECT_RECV_MINIMUM 1
  56 #define TQ_TOTAL_BIDRECT_LIMIT 1
  57
  58 #define TT_OGM_APPEND_MAX 3 /* number of OGMs sent with the last tt diff */
  59
  60 #define ROAMING_MAX_TIME 20000 /* Time in which a client can roam at most
  61                                 * ROAMING_MAX_COUNT times in miliseconds*/
  62 #define ROAMING_MAX_COUNT 5
  63
  64 #define NO_FLAGS 0
  65
  66 #define NULL_IFINDEX 0 /* dummy ifindex used to avoid iface checks */
  67
  68 #define NUM_WORDS BITS_TO_LONGS(TQ_LOCAL_WINDOW_SIZE)
  69
  70 #define LOG_BUF_LEN 8192          /* has to be a power of 2 */
  71
  72 #define VIS_INTERVAL 5000       /* 5 seconds */
  73
  74 /* how much worse secondary interfaces may be to be considered as bonding
  75  * candidates */
  76 #define BONDING_TQ_THRESHOLD    50
  77
  78 /* should not be bigger than 512 bytes or change the size of
  79  * forw_packet->direct_link_flags */
  80 #define MAX_AGGREGATION_BYTES 512
  81 #define MAX_AGGREGATION_MS 100
  82
  83 #define BLA_PERIOD_LENGTH       10000   /* 10 seconds */
  84 #define BLA_BACKBONE_TIMEOUT    (BLA_PERIOD_LENGTH * 3)
  85 #define BLA_CLAIM_TIMEOUT       (BLA_PERIOD_LENGTH * 10)
  86
  87 #define DUPLIST_SIZE            16
  88 #define DUPLIST_TIMEOUT         500     /* 500 ms */
  89 /* don't reset again within 30 seconds */
  90 #define RESET_PROTECTION_MS 30000
  91 #define EXPECTED_SEQNO_RANGE    65536
  92
  93 enum mesh_state {
  94         MESH_INACTIVE,
  95         MESH_ACTIVE,
  96         MESH_DEACTIVATING
  97 };
  98
  99 #define BCAST_QUEUE_LEN         256
 100 #define BATMAN_QUEUE_LEN        256
 101
 102 enum uev_action {
 103         UEV_ADD = 0,
 104         UEV_DEL,
 105         UEV_CHANGE
 106 };
 107
 108 enum uev_type {
 109         UEV_GW = 0
 110 };
 111
 112 #define GW_THRESHOLD    50
 113
 114 /* Debug Messages */
 115 #ifdef pr_fmt
 116 #undef pr_fmt
 117 #endif
 118 /* Append 'batman-adv: ' before kernel messages */
 119 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
 120
 121 /* all messages related to routing / flooding / broadcasting / etc */
 122 enum dbg_level {
 123         DBG_BATMAN = 1 << 0,
 124         DBG_ROUTES = 1 << 1, /* route added / changed / deleted */
 125         DBG_TT     = 1 << 2, /* translation table operations */
 126         DBG_BLA    = 1 << 3, /* bridge loop avoidance */
 127         DBG_ALL    = 15
 128 };
 129
 130 /* Kernel headers */
 131
 132 #include <linux/mutex.h>        /* mutex */
 133 #include <linux/module.h>       /* needed by all modules */
 134 #include <linux/netdevice.h>    /* netdevice */
 135 #include <linux/etherdevice.h>  /* ethernet address classification */
 136 #include <linux/if_ether.h>     /* ethernet header */
 137 #include <linux/poll.h>         /* poll_table */
 138 #include <linux/kthread.h>      /* kernel threads */
 139 #include <linux/pkt_sched.h>    /* schedule types */
 140 #include <linux/workqueue.h>    /* workqueue */
 141 #include <linux/slab.h>
 142 #include <net/sock.h>           /* struct sock */
 143 #include <linux/jiffies.h>
 144 #include <linux/seq_file.h>
 145 #include "types.h"
 146
 147 extern char bat_routing_algo[];
 148 extern struct list_head hardif_list;
 149
 150 extern unsigned char broadcast_addr[];
 151 extern struct workqueue_struct *bat_event_workqueue;
 152
 153 int mesh_init(struct net_device *soft_iface);
 154 void mesh_free(struct net_device *soft_iface);
 155 void inc_module_count(void);
 156 void dec_module_count(void);
 157 int is_my_mac(const uint8_t *addr);
 158 int batman_skb_recv(struct sk_buff *skb, struct net_device *dev,
 159                     struct packet_type *ptype, struct net_device *orig_dev);
 160 int recv_handler_register(uint8_t packet_type,
 161                           int (*recv_handler)(struct sk_buff *,
 162                                               struct hard_iface *));
 163 void recv_handler_unregister(uint8_t packet_type);
 164 int bat_algo_register(struct bat_algo_ops *bat_algo_ops);
 165 int bat_algo_select(struct bat_priv *bat_priv, char *name);
 166 int bat_algo_seq_print_text(struct seq_file *seq, void *offset);
 167
 168 #ifdef CONFIG_BATMAN_ADV_DEBUG
 169 int debug_log(struct bat_priv *bat_priv, const char *fmt, ...) __printf(2, 3);
 170
 171 #define bat_dbg(type, bat_priv, fmt, arg...)                    \
 172         do {                                                    \
 173                 if (atomic_read(&bat_priv->log_level) & type)   \
 174                         debug_log(bat_priv, fmt, ## arg);       \
 175         }                                                       \
 176         while (0)
 177 #else /* !CONFIG_BATMAN_ADV_DEBUG */
 178 __printf(3, 4)
 179 static inline void bat_dbg(int type __always_unused,
 180                            struct bat_priv *bat_priv __always_unused,
 181                            const char *fmt __always_unused, ...)
 182 {
 183 }
 184 #endif
 185
 186 #define bat_info(net_dev, fmt, arg...)                                  \
 187         do {                                                            \
 188                 struct net_device *_netdev = (net_dev);                 \
 189                 struct bat_priv *_batpriv = netdev_priv(_netdev);       \
 190                 bat_dbg(DBG_ALL, _batpriv, fmt, ## arg);                \
 191                 pr_info("%s: " fmt, _netdev->name, ## arg);             \
 192         } while (0)
 193 #define bat_err(net_dev, fmt, arg...)                                   \
 194         do {                                                            \
 195                 struct net_device *_netdev = (net_dev);                 \
 196                 struct bat_priv *_batpriv = netdev_priv(_netdev);       \
 197                 bat_dbg(DBG_ALL, _batpriv, fmt, ## arg);                \
 198                 pr_err("%s: " fmt, _netdev->name, ## arg);              \
 199         } while (0)
 200
 201 /**
 202  * returns 1 if they are the same ethernet addr
 203  *
 204  * note: can't use compare_ether_addr() as it requires aligned memory
 205  */
 206
 207 static inline int compare_eth(const void *data1, const void *data2)
 208 {
 209         return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
 210 }
 211
 212 /**
 213  * has_timed_out - compares current time (jiffies) and timestamp + timeout
 214  * @timestamp:          base value to compare with (in jiffies)
 215  * @timeout:            added to base value before comparing (in milliseconds)
 216  *
 217  * Returns true if current time is after timestamp + timeout
 218  */
 219 static inline bool has_timed_out(unsigned long timestamp, unsigned int timeout)
 220 {
 221         return time_is_before_jiffies(timestamp + msecs_to_jiffies(timeout));
 222 }
 223
 224 #define atomic_dec_not_zero(v)  atomic_add_unless((v), -1, 0)
 225
 226 /* Returns the smallest signed integer in two's complement with the sizeof x */
 227 #define smallest_signed_int(x) (1u << (7u + 8u * (sizeof(x) - 1u)))
 228
 229 /* Checks if a sequence number x is a predecessor/successor of y.
 230  * they handle overflows/underflows and can correctly check for a
 231  * predecessor/successor unless the variable sequence number has grown by
 232  * more then 2**(bitwidth(x)-1)-1.
 233  * This means that for a uint8_t with the maximum value 255, it would think:
 234  *  - when adding nothing - it is neither a predecessor nor a successor
 235  *  - before adding more than 127 to the starting value - it is a predecessor,
 236  *  - when adding 128 - it is neither a predecessor nor a successor,
 237  *  - after adding more than 127 to the starting value - it is a successor */
 238 #define seq_before(x, y) ({typeof(x) _d1 = (x); \
 239                           typeof(y) _d2 = (y); \
 240                           typeof(x) _dummy = (_d1 - _d2); \
 241                           (void) (&_d1 == &_d2); \
 242                           _dummy > smallest_signed_int(_dummy); })
 243 #define seq_after(x, y) seq_before(y, x)
 244
 245 #endif /* _NET_BATMAN_ADV_MAIN_H_ */