/* * Copyright (C) 2007-2010 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_TYPES_H_ #define _NET_BATMAN_ADV_TYPES_H_ #include "packet.h" #include "bitarray.h" #define BAT_HEADER_LEN (sizeof(struct ethhdr) + \ ((sizeof(struct unicast_packet) > sizeof(struct bcast_packet) ? \ sizeof(struct unicast_packet) : \ sizeof(struct bcast_packet)))) struct batman_if { struct list_head list; int16_t if_num; char *dev; char if_status; char addr_str[ETH_STR_LEN]; struct net_device *net_dev; atomic_t seqno; unsigned char *packet_buff; int packet_len; struct kobject *hardif_obj; struct rcu_head rcu; }; /** * orig_node - structure for orig_list maintaining nodes of mesh * @primary_addr: hosts primary interface address * @last_valid: when last packet from this node was received * @bcast_seqno_reset: time when the broadcast seqno window was reset * @batman_seqno_reset: time when the batman seqno window was reset * @flags: for now only VIS_SERVER flag * @last_real_seqno: last and best known squence number * @last_ttl: ttl of last received packet * @last_bcast_seqno: last broadcast sequence number received by this host * * @candidates: how many candidates are available * @selected: next bonding candidate */ struct orig_node { uint8_t orig[ETH_ALEN]; uint8_t primary_addr[ETH_ALEN]; struct neigh_node *router; TYPE_OF_WORD *bcast_own; uint8_t *bcast_own_sum; uint8_t tq_own; int tq_asym_penalty; unsigned long last_valid; unsigned long bcast_seqno_reset; unsigned long batman_seqno_reset; uint8_t flags; unsigned char *hna_buff; int16_t hna_buff_len; uint32_t last_real_seqno; uint8_t last_ttl; TYPE_OF_WORD bcast_bits[NUM_WORDS]; uint32_t last_bcast_seqno; struct list_head neigh_list; struct { uint8_t candidates; struct neigh_node *selected; } bond; }; /** * neigh_node * @last_valid: when last packet via this neighbor was received */ struct neigh_node { struct list_head list; uint8_t addr[ETH_ALEN]; uint8_t real_packet_count; uint8_t tq_recv[TQ_GLOBAL_WINDOW_SIZE]; uint8_t tq_index; uint8_t tq_avg; uint8_t last_ttl; struct neigh_node *next_bond_candidate; unsigned long last_valid; TYPE_OF_WORD real_bits[NUM_WORDS]; struct orig_node *orig_node; struct batman_if *if_incoming; }; struct bat_priv { struct net_device_stats stats; atomic_t aggregation_enabled; atomic_t bonding_enabled; atomic_t vis_mode; atomic_t orig_interval; atomic_t log_level; char num_ifaces; struct debug_log *debug_log; struct batman_if *primary_if; struct kobject *mesh_obj; struct dentry *debug_dir; }; struct socket_client { struct list_head queue_list; unsigned int queue_len; unsigned char index; spinlock_t lock; wait_queue_head_t queue_wait; struct bat_priv *bat_priv; }; struct socket_packet { struct list_head list; size_t icmp_len; struct icmp_packet_rr icmp_packet; }; struct hna_local_entry { uint8_t addr[ETH_ALEN]; unsigned long last_seen; char never_purge; }; struct hna_global_entry { uint8_t addr[ETH_ALEN]; struct orig_node *orig_node; }; /** * forw_packet - structure for forw_list maintaining packets to be * send/forwarded */ struct forw_packet { struct hlist_node list; unsigned long send_time; uint8_t own; struct sk_buff *skb; unsigned char *packet_buff; uint16_t packet_len; uint32_t direct_link_flags; uint8_t num_packets; struct delayed_work delayed_work; struct batman_if *if_incoming; }; /* While scanning for vis-entries of a particular vis-originator * this list collects its interfaces to create a subgraph/cluster * out of them later */ struct if_list_entry { uint8_t addr[ETH_ALEN]; bool primary; struct hlist_node list; }; struct debug_log { char log_buff[LOG_BUF_LEN]; unsigned long log_start; unsigned long log_end; spinlock_t lock; wait_queue_head_t queue_wait; }; #endif /* _NET_BATMAN_ADV_TYPES_H_ */