2 * Copyright (C) 2007-2011 B.A.T.M.A.N. contributors:
4 * Marek Lindner, Simon Wunderlich
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.
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.
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
22 #ifndef _NET_BATMAN_ADV_MAIN_H_
23 #define _NET_BATMAN_ADV_MAIN_H_
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"
30 #define SOURCE_VERSION "next"
33 /* B.A.T.M.A.N. parameters */
35 #define TQ_MAX_VALUE 255
38 /* Time To Live of broadcast messages */
41 /* purge originators after time in seconds if no valid packet comes in
42 * -> TODO: check influence on TQ_LOCAL_WINDOW_SIZE */
43 #define PURGE_TIMEOUT 200
44 #define TT_LOCAL_TIMEOUT 3600 /* in seconds */
45 #define TT_CLIENT_ROAM_TIMEOUT 600
46 /* sliding packet range of received originator messages in squence numbers
47 * (should be a multiple of our word size) */
48 #define TQ_LOCAL_WINDOW_SIZE 64
49 #define TT_REQUEST_TIMEOUT 3 /* seconds we have to keep pending tt_req */
51 #define TQ_GLOBAL_WINDOW_SIZE 5
52 #define TQ_LOCAL_BIDRECT_SEND_MINIMUM 1
53 #define TQ_LOCAL_BIDRECT_RECV_MINIMUM 1
54 #define TQ_TOTAL_BIDRECT_LIMIT 1
56 #define TT_OGM_APPEND_MAX 3 /* number of OGMs sent with the last tt diff */
58 #define ROAMING_MAX_TIME 20 /* Time in which a client can roam at most
59 * ROAMING_MAX_COUNT times */
60 #define ROAMING_MAX_COUNT 5
64 #define NUM_WORDS (TQ_LOCAL_WINDOW_SIZE / WORD_BIT_SIZE)
66 #define LOG_BUF_LEN 8192 /* has to be a power of 2 */
68 #define VIS_INTERVAL 5000 /* 5 seconds */
70 /* how much worse secondary interfaces may be to be considered as bonding
72 #define BONDING_TQ_THRESHOLD 50
74 /* should not be bigger than 512 bytes or change the size of
75 * forw_packet->direct_link_flags */
76 #define MAX_AGGREGATION_BYTES 512
77 #define MAX_AGGREGATION_MS 100
79 #define SOFTIF_NEIGH_TIMEOUT 180000 /* 3 minutes */
81 /* don't reset again within 30 seconds */
82 #define RESET_PROTECTION_MS 30000
83 #define EXPECTED_SEQNO_RANGE 65536
91 #define BCAST_QUEUE_LEN 256
92 #define BATMAN_QUEUE_LEN 256
111 /* Append 'batman-adv: ' before kernel messages */
112 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
114 /* all messages related to routing / flooding / broadcasting / etc */
117 DBG_ROUTES
= 1 << 1, /* route added / changed / deleted */
118 DBG_TT
= 1 << 2, /* translation table operations */
131 #include <linux/mutex.h> /* mutex */
132 #include <linux/module.h> /* needed by all modules */
133 #include <linux/netdevice.h> /* netdevice */
134 #include <linux/etherdevice.h> /* ethernet address classifaction */
135 #include <linux/if_ether.h> /* ethernet header */
136 #include <linux/poll.h> /* poll_table */
137 #include <linux/kthread.h> /* kernel threads */
138 #include <linux/pkt_sched.h> /* schedule types */
139 #include <linux/workqueue.h> /* workqueue */
140 #include <linux/slab.h>
141 #include <net/sock.h> /* struct sock */
142 #include <linux/jiffies.h>
143 #include <linux/seq_file.h>
146 #ifndef REVISION_VERSION
147 #define REVISION_VERSION_STR ""
149 #define REVISION_VERSION_STR " "REVISION_VERSION
152 extern struct list_head hardif_list
;
154 extern unsigned char broadcast_addr
[];
155 extern struct workqueue_struct
*bat_event_workqueue
;
157 int mesh_init(struct net_device
*soft_iface
);
158 void mesh_free(struct net_device
*soft_iface
);
159 void inc_module_count(void);
160 void dec_module_count(void);
161 int is_my_mac(const uint8_t *addr
);
163 #ifdef CONFIG_BATMAN_ADV_DEBUG
164 int debug_log(struct bat_priv
*bat_priv
, const char *fmt
, ...) __printf(2, 3);
166 #define bat_dbg(type, bat_priv, fmt, arg...) \
168 if (atomic_read(&bat_priv->log_level) & type) \
169 debug_log(bat_priv, fmt, ## arg); \
172 #else /* !CONFIG_BATMAN_ADV_DEBUG */
174 static inline void bat_dbg(int type __always_unused
,
175 struct bat_priv
*bat_priv __always_unused
,
176 const char *fmt __always_unused
, ...)
181 #define bat_info(net_dev, fmt, arg...) \
183 struct net_device *_netdev = (net_dev); \
184 struct bat_priv *_batpriv = netdev_priv(_netdev); \
185 bat_dbg(DBG_ALL, _batpriv, fmt, ## arg); \
186 pr_info("%s: " fmt, _netdev->name, ## arg); \
188 #define bat_err(net_dev, fmt, arg...) \
190 struct net_device *_netdev = (net_dev); \
191 struct bat_priv *_batpriv = netdev_priv(_netdev); \
192 bat_dbg(DBG_ALL, _batpriv, fmt, ## arg); \
193 pr_err("%s: " fmt, _netdev->name, ## arg); \
197 * returns 1 if they are the same ethernet addr
199 * note: can't use compare_ether_addr() as it requires aligned memory
202 static inline int compare_eth(const void *data1
, const void *data2
)
204 return (memcmp(data1
, data2
, ETH_ALEN
) == 0 ? 1 : 0);
208 #define atomic_dec_not_zero(v) atomic_add_unless((v), -1, 0)
210 /* Returns the smallest signed integer in two's complement with the sizeof x */
211 #define smallest_signed_int(x) (1u << (7u + 8u * (sizeof(x) - 1u)))
213 /* Checks if a sequence number x is a predecessor/successor of y.
214 * they handle overflows/underflows and can correctly check for a
215 * predecessor/successor unless the variable sequence number has grown by
216 * more then 2**(bitwidth(x)-1)-1.
217 * This means that for a uint8_t with the maximum value 255, it would think:
218 * - when adding nothing - it is neither a predecessor nor a successor
219 * - before adding more than 127 to the starting value - it is a predecessor,
220 * - when adding 128 - it is neither a predecessor nor a successor,
221 * - after adding more than 127 to the starting value - it is a successor */
222 #define seq_before(x, y) ({typeof(x) _d1 = (x); \
223 typeof(y) _d2 = (y); \
224 typeof(x) _dummy = (_d1 - _d2); \
225 (void) (&_d1 == &_d2); \
226 _dummy > smallest_signed_int(_dummy); })
227 #define seq_after(x, y) seq_before(y, x)
229 #endif /* _NET_BATMAN_ADV_MAIN_H_ */
This page took 0.043909 seconds and 5 git commands to generate.