2 * Copyright (C) 2007-2010 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
32 #define BAT_HEADER_LEN (sizeof(struct ethhdr) + \
33 ((sizeof(struct unicast_packet) > sizeof(struct bcast_packet) ? \
34 sizeof(struct unicast_packet) : \
35 sizeof(struct bcast_packet))))
39 struct list_head list;
43 char addr_str[ETH_STR_LEN];
44 struct net_device *net_dev;
46 unsigned char *packet_buff;
48 struct kobject *hardif_obj;
54 * orig_node - structure for orig_list maintaining nodes of mesh
55 * @primary_addr: hosts primary interface address
56 * @last_valid: when last packet from this node was received
57 * @bcast_seqno_reset: time when the broadcast seqno window was reset
58 * @batman_seqno_reset: time when the batman seqno window was reset
59 * @flags: for now only VIS_SERVER flag
60 * @last_real_seqno: last and best known squence number
61 * @last_ttl: ttl of last received packet
62 * @last_bcast_seqno: last broadcast sequence number received by this host
64 * @candidates: how many candidates are available
65 * @selected: next bonding candidate
68 uint8_t orig[ETH_ALEN];
69 uint8_t primary_addr[ETH_ALEN];
70 struct neigh_node *router;
71 TYPE_OF_WORD *bcast_own;
72 uint8_t *bcast_own_sum;
75 unsigned long last_valid;
76 unsigned long bcast_seqno_reset;
77 unsigned long batman_seqno_reset;
79 unsigned char *hna_buff;
81 uint32_t last_real_seqno;
83 TYPE_OF_WORD bcast_bits[NUM_WORDS];
84 uint32_t last_bcast_seqno;
85 struct list_head neigh_list;
88 struct neigh_node *selected;
94 * @last_valid: when last packet via this neighbor was received
97 struct list_head list;
98 uint8_t addr[ETH_ALEN];
99 uint8_t real_packet_count;
100 uint8_t tq_recv[TQ_GLOBAL_WINDOW_SIZE];
104 struct neigh_node *next_bond_candidate;
105 unsigned long last_valid;
106 TYPE_OF_WORD real_bits[NUM_WORDS];
107 struct orig_node *orig_node;
108 struct batman_if *if_incoming;
112 struct net_device_stats stats;
113 atomic_t aggregation_enabled;
114 atomic_t bonding_enabled;
116 atomic_t orig_interval;
118 struct batman_if *primary_if;
119 struct kobject *mesh_obj;
120 struct dentry *debug_dir;
123 struct socket_client {
124 struct list_head queue_list;
125 unsigned int queue_len;
128 wait_queue_head_t queue_wait;
131 struct socket_packet {
132 struct list_head list;
134 struct icmp_packet_rr icmp_packet;
137 struct hna_local_entry {
138 uint8_t addr[ETH_ALEN];
139 unsigned long last_seen;
143 struct hna_global_entry {
144 uint8_t addr[ETH_ALEN];
145 struct orig_node *orig_node;
149 * forw_packet - structure for forw_list maintaining packets to be
153 struct hlist_node list;
154 unsigned long send_time;
157 unsigned char *packet_buff;
159 uint32_t direct_link_flags;
161 struct delayed_work delayed_work;
162 struct batman_if *if_incoming;
165 /* While scanning for vis-entries of a particular vis-originator
166 * this list collects its interfaces to create a subgraph/cluster
169 struct if_list_entry {
170 uint8_t addr[ETH_ALEN];
172 struct hlist_node list;