[net-next-2.6.git] / net / mac80211 / mesh.h

/*
 * Copyright (c) 2008, 2009 open80211s Ltd.
 * Authors:    Luis Carlos Cobo <luisca@cozybit.com>
 *             Javier Cardona <javier@cozybit.com>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */

#ifndef IEEE80211S_H
#define IEEE80211S_H

#include <linux/types.h>
#include <linux/jhash.h>
#include <asm/unaligned.h>
#include "ieee80211_i.h"


/* Data structures */

/**
 * enum mesh_path_flags - mac80211 mesh path flags
 *
 *
 *
 * @MESH_PATH_ACTIVE: the mesh path can be used for forwarding
 * @MESH_PATH_RESOLVING: the discovery process is running for this mesh path
 * @MESH_PATH_SN_VALID: the mesh path contains a valid destination sequence
 * 	number
 * @MESH_PATH_FIXED: the mesh path has been manually set and should not be
 * 	modified
 * @MESH_PATH_RESOLVED: the mesh path can has been resolved
 *
 * MESH_PATH_RESOLVED is used by the mesh path timer to
 * decide when to stop or cancel the mesh path discovery.
 */
enum mesh_path_flags {
	MESH_PATH_ACTIVE =	BIT(0),
	MESH_PATH_RESOLVING =	BIT(1),
	MESH_PATH_SN_VALID =	BIT(2),
	MESH_PATH_FIXED	=	BIT(3),
	MESH_PATH_RESOLVED =	BIT(4),
};

/**
 * enum mesh_deferred_task_flags - mac80211 mesh deferred tasks
 *
 *
 *
 * @MESH_WORK_HOUSEKEEPING: run the periodic mesh housekeeping tasks
 * @MESH_WORK_GROW_MPATH_TABLE: the mesh path table is full and needs
 * to grow.
 * @MESH_WORK_GROW_MPP_TABLE: the mesh portals table is full and needs to
 * grow
 * @MESH_WORK_ROOT: the mesh root station needs to send a frame
 */
enum mesh_deferred_task_flags {
	MESH_WORK_HOUSEKEEPING,
	MESH_WORK_GROW_MPATH_TABLE,
	MESH_WORK_GROW_MPP_TABLE,
	MESH_WORK_ROOT,
};

/**
 * struct mesh_path - mac80211 mesh path structure
 *
 * @dst: mesh path destination mac address
 * @sdata: mesh subif
 * @next_hop: mesh neighbor to which frames for this destination will be
 * 	forwarded
 * @timer: mesh path discovery timer
 * @frame_queue: pending queue for frames sent to this destination while the
 * 	path is unresolved
 * @sn: target sequence number
 * @metric: current metric to this destination
 * @hop_count: hops to destination
 * @exp_time: in jiffies, when the path will expire or when it expired
 * @discovery_timeout: timeout (lapse in jiffies) used for the last discovery
 * 	retry
 * @discovery_retries: number of discovery retries
 * @flags: mesh path flags, as specified on &enum mesh_path_flags
 * @state_lock: mesh path state lock
 *
 *
 * The combination of dst and sdata is unique in the mesh path table. Since the
 * next_hop STA is only protected by RCU as well, deleting the STA must also
 * remove/substitute the mesh_path structure and wait until that is no longer
 * reachable before destroying the STA completely.
 */
struct mesh_path {
	u8 dst[ETH_ALEN];
	u8 mpp[ETH_ALEN];	/* used for MPP or MAP */
	struct ieee80211_sub_if_data *sdata;
	struct sta_info *next_hop;
	struct timer_list timer;
	struct sk_buff_head frame_queue;
	struct rcu_head rcu;
	u32 sn;
	u32 metric;
	u8 hop_count;
	unsigned long exp_time;
	u32 discovery_timeout;
	u8 discovery_retries;
	enum mesh_path_flags flags;
	spinlock_t state_lock;
};

/**
 * struct mesh_table
 *
 * @hash_buckets: array of hash buckets of the table
 * @hashwlock: array of locks to protect write operations, one per bucket
 * @hash_mask: 2^size_order - 1, used to compute hash idx
 * @hash_rnd: random value used for hash computations
 * @entries: number of entries in the table
 * @free_node: function to free nodes of the table
 * @copy_node: function to copy nodes of the table
 * @size_order: determines size of the table, there will be 2^size_order hash
 *	buckets
 * @mean_chain_len: maximum average length for the hash buckets' list, if it is
 *	reached, the table will grow
 */
struct mesh_table {
	/* Number of buckets will be 2^N */
	struct hlist_head *hash_buckets;
	spinlock_t *hashwlock;		/* One per bucket, for add/del */
	unsigned int hash_mask;		/* (2^size_order) - 1 */
	__u32 hash_rnd;			/* Used for hash generation */
	atomic_t entries;		/* Up to MAX_MESH_NEIGHBOURS */
	void (*free_node) (struct hlist_node *p, bool free_leafs);
	int (*copy_node) (struct hlist_node *p, struct mesh_table *newtbl);
	int size_order;
	int mean_chain_len;
};

/* Recent multicast cache */
/* RMC_BUCKETS must be a power of 2, maximum 256 */
#define RMC_BUCKETS		256
#define RMC_QUEUE_MAX_LEN	4
#define RMC_TIMEOUT		(3 * HZ)

/**
 * struct rmc_entry - entry in the Recent Multicast Cache
 *
 * @seqnum: mesh sequence number of the frame
 * @exp_time: expiration time of the entry, in jiffies
 * @sa: source address of the frame
 *
 * The Recent Multicast Cache keeps track of the latest multicast frames that
 * have been received by a mesh interface and discards received multicast frames
 * that are found in the cache.
 */
struct rmc_entry {
	struct list_head list;
	u32 seqnum;
	unsigned long exp_time;
	u8 sa[ETH_ALEN];
};

struct mesh_rmc {
	struct rmc_entry bucket[RMC_BUCKETS];
	u32 idx_mask;
};


/*
 * MESH_CFG_COMP_LEN Includes:
 * 	- Active path selection protocol ID.
 * 	- Active path selection metric ID.
 * 	- Congestion control mode identifier.
 * 	- Channel precedence.
 * Does not include mesh capabilities, which may vary across nodes in the same
 * mesh
 */
#define MESH_CFG_CMP_LEN 	(IEEE80211_MESH_CONFIG_LEN - 2)

/* Default values, timeouts in ms */
#define MESH_TTL 		31
#define MESH_MAX_RETR	 	3
#define MESH_RET_T 		100
#define MESH_CONF_T 		100
#define MESH_HOLD_T 		100

#define MESH_PATH_TIMEOUT	5000
/* Minimum interval between two consecutive PREQs originated by the same
 * interface
 */
#define MESH_PREQ_MIN_INT	10
#define MESH_DIAM_TRAVERSAL_TIME 50
/* A path will be refreshed if it is used PATH_REFRESH_TIME milliseconds before
 * timing out.  This way it will remain ACTIVE and no data frames will be
 * unnecesarily held in the pending queue.
 */
#define MESH_PATH_REFRESH_TIME			1000
#define MESH_MIN_DISCOVERY_TIMEOUT (2 * MESH_DIAM_TRAVERSAL_TIME)
#define MESH_DEFAULT_BEACON_INTERVAL		1000 	/* in 1024 us units */

#define MESH_MAX_PREQ_RETRIES 4
#define MESH_PATH_EXPIRE (600 * HZ)

/* Default maximum number of established plinks per interface */
#define MESH_MAX_ESTAB_PLINKS	32

/* Default maximum number of plinks per interface */
#define MESH_MAX_PLINKS		256

/* Maximum number of paths per interface */
#define MESH_MAX_MPATHS		1024

/* Pending ANA approval */
#define MESH_PATH_SEL_ACTION	0

/* PERR reason codes */
#define PEER_RCODE_UNSPECIFIED  11
#define PERR_RCODE_NO_ROUTE     12
#define PERR_RCODE_DEST_UNREACH 13

/* Public interfaces */
/* Various */
int ieee80211_fill_mesh_addresses(struct ieee80211_hdr *hdr, __le16 *fc,
				  const u8 *da, const u8 *sa);
int ieee80211_new_mesh_header(struct ieee80211s_hdr *meshhdr,
		struct ieee80211_sub_if_data *sdata, char *addr4,
		char *addr5, char *addr6);
int mesh_rmc_check(u8 *addr, struct ieee80211s_hdr *mesh_hdr,
		struct ieee80211_sub_if_data *sdata);
bool mesh_matches_local(struct ieee802_11_elems *ie,
		struct ieee80211_sub_if_data *sdata);
void mesh_ids_set_default(struct ieee80211_if_mesh *mesh);
void mesh_mgmt_ies_add(struct sk_buff *skb,
		struct ieee80211_sub_if_data *sdata);
void mesh_rmc_free(struct ieee80211_sub_if_data *sdata);
int mesh_rmc_init(struct ieee80211_sub_if_data *sdata);
void ieee80211s_init(void);
void ieee80211s_update_metric(struct ieee80211_local *local,
		struct sta_info *stainfo, struct sk_buff *skb);
void ieee80211s_stop(void);
void ieee80211_mesh_init_sdata(struct ieee80211_sub_if_data *sdata);
void ieee80211_start_mesh(struct ieee80211_sub_if_data *sdata);
void ieee80211_stop_mesh(struct ieee80211_sub_if_data *sdata);
void ieee80211_mesh_root_setup(struct ieee80211_if_mesh *ifmsh);

/* Mesh paths */
int mesh_nexthop_lookup(struct sk_buff *skb,
		struct ieee80211_sub_if_data *sdata);
void mesh_path_start_discovery(struct ieee80211_sub_if_data *sdata);
struct mesh_path *mesh_path_lookup(u8 *dst,
		struct ieee80211_sub_if_data *sdata);
struct mesh_path *mpp_path_lookup(u8 *dst,
				  struct ieee80211_sub_if_data *sdata);
int mpp_path_add(u8 *dst, u8 *mpp, struct ieee80211_sub_if_data *sdata);
struct mesh_path *mesh_path_lookup_by_idx(int idx,
		struct ieee80211_sub_if_data *sdata);
void mesh_path_fix_nexthop(struct mesh_path *mpath, struct sta_info *next_hop);
void mesh_path_expire(struct ieee80211_sub_if_data *sdata);
void mesh_path_flush(struct ieee80211_sub_if_data *sdata);
void mesh_rx_path_sel_frame(struct ieee80211_sub_if_data *sdata,
		struct ieee80211_mgmt *mgmt, size_t len);
int mesh_path_add(u8 *dst, struct ieee80211_sub_if_data *sdata);
/* Mesh plinks */
void mesh_neighbour_update(u8 *hw_addr, u32 rates,
		struct ieee80211_sub_if_data *sdata, bool add);
bool mesh_peer_accepts_plinks(struct ieee802_11_elems *ie);
void mesh_accept_plinks_update(struct ieee80211_sub_if_data *sdata);
void mesh_plink_broken(struct sta_info *sta);
void mesh_plink_deactivate(struct sta_info *sta);
int mesh_plink_open(struct sta_info *sta);
void mesh_plink_block(struct sta_info *sta);
void mesh_rx_plink_frame(struct ieee80211_sub_if_data *sdata,
			 struct ieee80211_mgmt *mgmt, size_t len,
			 struct ieee80211_rx_status *rx_status);

/* Private interfaces */
/* Mesh tables */
struct mesh_table *mesh_table_alloc(int size_order);
void mesh_table_free(struct mesh_table *tbl, bool free_leafs);
void mesh_mpath_table_grow(void);
void mesh_mpp_table_grow(void);
u32 mesh_table_hash(u8 *addr, struct ieee80211_sub_if_data *sdata,
		struct mesh_table *tbl);
/* Mesh paths */
int mesh_path_error_tx(u8 ttl, u8 *target, __le32 target_sn, __le16 target_rcode,
		       const u8 *ra, struct ieee80211_sub_if_data *sdata);
void mesh_path_assign_nexthop(struct mesh_path *mpath, struct sta_info *sta);
void mesh_path_flush_pending(struct mesh_path *mpath);
void mesh_path_tx_pending(struct mesh_path *mpath);
int mesh_pathtbl_init(void);
void mesh_pathtbl_unregister(void);
int mesh_path_del(u8 *addr, struct ieee80211_sub_if_data *sdata);
void mesh_path_timer(unsigned long data);
void mesh_path_flush_by_nexthop(struct sta_info *sta);
void mesh_path_discard_frame(struct sk_buff *skb,
		struct ieee80211_sub_if_data *sdata);
void mesh_path_quiesce(struct ieee80211_sub_if_data *sdata);
void mesh_path_restart(struct ieee80211_sub_if_data *sdata);
void mesh_path_tx_root_frame(struct ieee80211_sub_if_data *sdata);

extern int mesh_paths_generation;

#ifdef CONFIG_MAC80211_MESH
extern int mesh_allocated;

static inline int mesh_plink_free_count(struct ieee80211_sub_if_data *sdata)
{
	return sdata->u.mesh.mshcfg.dot11MeshMaxPeerLinks -
	       atomic_read(&sdata->u.mesh.mshstats.estab_plinks);
}

static inline bool mesh_plink_availables(struct ieee80211_sub_if_data *sdata)
{
	return (min_t(long, mesh_plink_free_count(sdata),
		   MESH_MAX_PLINKS - sdata->local->num_sta)) > 0;
}

static inline void mesh_path_activate(struct mesh_path *mpath)
{
	mpath->flags |= MESH_PATH_ACTIVE | MESH_PATH_RESOLVED;
}

#define for_each_mesh_entry(x, p, node, i) \
	for (i = 0; i <= x->hash_mask; i++) \
		hlist_for_each_entry_rcu(node, p, &x->hash_buckets[i], list)

void ieee80211_mesh_notify_scan_completed(struct ieee80211_local *local);

void ieee80211_mesh_quiesce(struct ieee80211_sub_if_data *sdata);
void ieee80211_mesh_restart(struct ieee80211_sub_if_data *sdata);
void mesh_plink_quiesce(struct sta_info *sta);
void mesh_plink_restart(struct sta_info *sta);
#else
#define mesh_allocated	0
static inline void
ieee80211_mesh_notify_scan_completed(struct ieee80211_local *local) {}
static inline void ieee80211_mesh_quiesce(struct ieee80211_sub_if_data *sdata)
{}
static inline void ieee80211_mesh_restart(struct ieee80211_sub_if_data *sdata)
{}
static inline void mesh_plink_quiesce(struct sta_info *sta) {}
static inline void mesh_plink_restart(struct sta_info *sta) {}
#endif

#endif /* IEEE80211S_H */
Commit	Line	Data
ccf80ddf	1	/*
264d9b7d	2	* Copyright (c) 2008, 2009 open80211s Ltd.
ccf80ddf LCC	3	* Authors: Luis Carlos Cobo <luisca@cozybit.com>
	4	* Javier Cardona <javier@cozybit.com>
	5	*
	6	* This program is free software; you can redistribute it and/or modify
	7	* it under the terms of the GNU General Public License version 2 as
	8	* published by the Free Software Foundation.
	9	*/
	10
	11	#ifndef IEEE80211S_H
	12	#define IEEE80211S_H
	13
902acc78	14	#include <linux/types.h>
ccf80ddf	15	#include <linux/jhash.h>
f375d558	16	#include <asm/unaligned.h>
902acc78	17	#include "ieee80211_i.h"
ccf80ddf	18
ccf80ddf LCC	19
	20	/* Data structures */
	21
	22	/**
	23	* enum mesh_path_flags - mac80211 mesh path flags
	24	*
	25	*
	26	*
eb80ed8d RR	27	* @MESH_PATH_ACTIVE: the mesh path can be used for forwarding
eb80ed8d RR	28	* @MESH_PATH_RESOLVING: the discovery process is running for this mesh path
d19b3bf6	29	* @MESH_PATH_SN_VALID: the mesh path contains a valid destination sequence
ccf80ddf LCC	30	* number
	31	* @MESH_PATH_FIXED: the mesh path has been manually set and should not be
	32	* modified
	33	* @MESH_PATH_RESOLVED: the mesh path can has been resolved
ccf80ddf	34	*
eb80ed8d	35	* MESH_PATH_RESOLVED is used by the mesh path timer to
ccf80ddf LCC	36	* decide when to stop or cancel the mesh path discovery.
	37	*/
	38	enum mesh_path_flags {
	39	MESH_PATH_ACTIVE = BIT(0),
	40	MESH_PATH_RESOLVING = BIT(1),
d19b3bf6	41	MESH_PATH_SN_VALID = BIT(2),
ccf80ddf LCC	42	MESH_PATH_FIXED = BIT(3),
ccf80ddf LCC	43	MESH_PATH_RESOLVED = BIT(4),
ccf80ddf LCC	44	};
ccf80ddf LCC	45
18889231 JC	46	/**
	47	* enum mesh_deferred_task_flags - mac80211 mesh deferred tasks
	48	*
	49	*
	50	*
	51	* @MESH_WORK_HOUSEKEEPING: run the periodic mesh housekeeping tasks
	52	* @MESH_WORK_GROW_MPATH_TABLE: the mesh path table is full and needs
	53	* to grow.
	54	* @MESH_WORK_GROW_MPP_TABLE: the mesh portals table is full and needs to
	55	* grow
e304bfd3	56	* @MESH_WORK_ROOT: the mesh root station needs to send a frame
18889231 JC	57	*/
	58	enum mesh_deferred_task_flags {
	59	MESH_WORK_HOUSEKEEPING,
	60	MESH_WORK_GROW_MPATH_TABLE,
	61	MESH_WORK_GROW_MPP_TABLE,
e304bfd3	62	MESH_WORK_ROOT,
18889231 JC	63	};
18889231 JC	64
ccf80ddf LCC	65	/**
	66	* struct mesh_path - mac80211 mesh path structure
	67	*
	68	* @dst: mesh path destination mac address
f698d856	69	* @sdata: mesh subif
ccf80ddf LCC	70	* @next_hop: mesh neighbor to which frames for this destination will be
	71	* forwarded
	72	* @timer: mesh path discovery timer
	73	* @frame_queue: pending queue for frames sent to this destination while the
	74	* path is unresolved
d19b3bf6	75	* @sn: target sequence number
ccf80ddf LCC	76	* @metric: current metric to this destination
	77	* @hop_count: hops to destination
	78	* @exp_time: in jiffies, when the path will expire or when it expired
	79	* @discovery_timeout: timeout (lapse in jiffies) used for the last discovery
	80	* retry
	81	* @discovery_retries: number of discovery retries
	82	* @flags: mesh path flags, as specified on &enum mesh_path_flags
fe583434	83	* @state_lock: mesh path state lock
ccf80ddf LCC	84	*
ccf80ddf LCC	85	*
f698d856	86	* The combination of dst and sdata is unique in the mesh path table. Since the
d0709a65 JB	87	* next_hop STA is only protected by RCU as well, deleting the STA must also
	88	* remove/substitute the mesh_path structure and wait until that is no longer
	89	* reachable before destroying the STA completely.
ccf80ddf LCC	90	*/
	91	struct mesh_path {
	92	u8 dst[ETH_ALEN];
79617dee	93	u8 mpp[ETH_ALEN]; /* used for MPP or MAP */
f698d856	94	struct ieee80211_sub_if_data *sdata;
ccf80ddf LCC	95	struct sta_info *next_hop;
	96	struct timer_list timer;
	97	struct sk_buff_head frame_queue;
	98	struct rcu_head rcu;
d19b3bf6	99	u32 sn;
ccf80ddf LCC	100	u32 metric;
	101	u8 hop_count;
	102	unsigned long exp_time;
	103	u32 discovery_timeout;
	104	u8 discovery_retries;
	105	enum mesh_path_flags flags;
	106	spinlock_t state_lock;
	107	};
	108
	109	/**
	110	* struct mesh_table
	111	*
	112	* @hash_buckets: array of hash buckets of the table
	113	* @hashwlock: array of locks to protect write operations, one per bucket
	114	* @hash_mask: 2^size_order - 1, used to compute hash idx
	115	* @hash_rnd: random value used for hash computations
	116	* @entries: number of entries in the table
	117	* @free_node: function to free nodes of the table
eef35c2d	118	* @copy_node: function to copy nodes of the table
ccf80ddf LCC	119	* @size_order: determines size of the table, there will be 2^size_order hash
	120	* buckets
	121	* @mean_chain_len: maximum average length for the hash buckets' list, if it is
	122	* reached, the table will grow
	123	*/
	124	struct mesh_table {
	125	/* Number of buckets will be 2^N */
	126	struct hlist_head *hash_buckets;
	127	spinlock_t hashwlock; / One per bucket, for add/del */
	128	unsigned int hash_mask; /* (2^size_order) - 1 */
	129	__u32 hash_rnd; /* Used for hash generation */
	130	atomic_t entries; /* Up to MAX_MESH_NEIGHBOURS */
	131	void (free_node) (struct hlist_node p, bool free_leafs);
4caf86c6	132	int (copy_node) (struct hlist_node p, struct mesh_table *newtbl);
ccf80ddf LCC	133	int size_order;
	134	int mean_chain_len;
	135	};
	136
	137	/* Recent multicast cache */
	138	/* RMC_BUCKETS must be a power of 2, maximum 256 */
	139	#define RMC_BUCKETS 256
	140	#define RMC_QUEUE_MAX_LEN 4
	141	#define RMC_TIMEOUT (3 * HZ)
	142
	143	/**
	144	* struct rmc_entry - entry in the Recent Multicast Cache
	145	*
	146	* @seqnum: mesh sequence number of the frame
	147	* @exp_time: expiration time of the entry, in jiffies
	148	* @sa: source address of the frame
	149	*
	150	* The Recent Multicast Cache keeps track of the latest multicast frames that
	151	* have been received by a mesh interface and discards received multicast frames
	152	* that are found in the cache.
	153	*/
	154	struct rmc_entry {
	155	struct list_head list;
	156	u32 seqnum;
	157	unsigned long exp_time;
	158	u8 sa[ETH_ALEN];
	159	};
	160
	161	struct mesh_rmc {
	162	struct rmc_entry bucket[RMC_BUCKETS];
51ceddad	163	u32 idx_mask;
ccf80ddf LCC	164	};
	165
	166
ccf80ddf LCC	167	/*
	168	* MESH_CFG_COMP_LEN Includes:
	169	* - Active path selection protocol ID.
	170	* - Active path selection metric ID.
	171	* - Congestion control mode identifier.
	172	* - Channel precedence.
	173	* Does not include mesh capabilities, which may vary across nodes in the same
	174	* mesh
	175	*/
1239cd58	176	#define MESH_CFG_CMP_LEN (IEEE80211_MESH_CONFIG_LEN - 2)
ccf80ddf LCC	177
ccf80ddf LCC	178	/* Default values, timeouts in ms */
a1935218	179	#define MESH_TTL 31
ccf80ddf LCC	180	#define MESH_MAX_RETR 3
	181	#define MESH_RET_T 100
	182	#define MESH_CONF_T 100
	183	#define MESH_HOLD_T 100
	184
	185	#define MESH_PATH_TIMEOUT 5000
	186	/* Minimum interval between two consecutive PREQs originated by the same
	187	* interface
	188	*/
	189	#define MESH_PREQ_MIN_INT 10
	190	#define MESH_DIAM_TRAVERSAL_TIME 50
7b324d28 JC	191	/* A path will be refreshed if it is used PATH_REFRESH_TIME milliseconds before
	192	* timing out. This way it will remain ACTIVE and no data frames will be
	193	* unnecesarily held in the pending queue.
ccf80ddf LCC	194	*/
	195	#define MESH_PATH_REFRESH_TIME 1000
	196	#define MESH_MIN_DISCOVERY_TIMEOUT (2 * MESH_DIAM_TRAVERSAL_TIME)
5b365834	197	#define MESH_DEFAULT_BEACON_INTERVAL 1000 /* in 1024 us units */
ccf80ddf LCC	198
	199	#define MESH_MAX_PREQ_RETRIES 4
	200	#define MESH_PATH_EXPIRE (600 * HZ)
	201
	202	/* Default maximum number of established plinks per interface */
	203	#define MESH_MAX_ESTAB_PLINKS 32
	204
	205	/* Default maximum number of plinks per interface */
	206	#define MESH_MAX_PLINKS 256
	207
	208	/* Maximum number of paths per interface */
	209	#define MESH_MAX_MPATHS 1024
	210
	211	/* Pending ANA approval */
095de013	212	#define MESH_PATH_SEL_ACTION 0
ccf80ddf	213
d611f062 RP	214	/* PERR reason codes */
	215	#define PEER_RCODE_UNSPECIFIED 11
	216	#define PERR_RCODE_NO_ROUTE 12
	217	#define PERR_RCODE_DEST_UNREACH 13
	218
ccf80ddf LCC	219	/* Public interfaces */
ccf80ddf LCC	220	/* Various */
3c5772a5	221	int ieee80211_fill_mesh_addresses(struct ieee80211_hdr hdr, __le16 fc,
15ff6365	222	const u8 da, const u8 sa);
ccf80ddf	223	int ieee80211_new_mesh_header(struct ieee80211s_hdr *meshhdr,
3c5772a5 JC	224	struct ieee80211_sub_if_data sdata, char addr4,
3c5772a5 JC	225	char addr5, char addr6);
ccf80ddf	226	int mesh_rmc_check(u8 addr, struct ieee80211s_hdr mesh_hdr,
f698d856 JBG	227	struct ieee80211_sub_if_data *sdata);
	228	bool mesh_matches_local(struct ieee802_11_elems *ie,
	229	struct ieee80211_sub_if_data *sdata);
472dbc45	230	void mesh_ids_set_default(struct ieee80211_if_mesh *mesh);
f698d856 JBG	231	void mesh_mgmt_ies_add(struct sk_buff *skb,
	232	struct ieee80211_sub_if_data *sdata);
	233	void mesh_rmc_free(struct ieee80211_sub_if_data *sdata);
	234	int mesh_rmc_init(struct ieee80211_sub_if_data *sdata);
ccf80ddf	235	void ieee80211s_init(void);
bfc32e6a JC	236	void ieee80211s_update_metric(struct ieee80211_local *local,
bfc32e6a JC	237	struct sta_info stainfo, struct sk_buff skb);
ccf80ddf	238	void ieee80211s_stop(void);
902acc78	239	void ieee80211_mesh_init_sdata(struct ieee80211_sub_if_data *sdata);
472dbc45 JB	240	void ieee80211_start_mesh(struct ieee80211_sub_if_data *sdata);
472dbc45 JB	241	void ieee80211_stop_mesh(struct ieee80211_sub_if_data *sdata);
63c5723b	242	void ieee80211_mesh_root_setup(struct ieee80211_if_mesh *ifmsh);
902acc78	243
ccf80ddf	244	/* Mesh paths */
f698d856 JBG	245	int mesh_nexthop_lookup(struct sk_buff *skb,
	246	struct ieee80211_sub_if_data *sdata);
	247	void mesh_path_start_discovery(struct ieee80211_sub_if_data *sdata);
	248	struct mesh_path mesh_path_lookup(u8 dst,
	249	struct ieee80211_sub_if_data *sdata);
79617dee Y	250	struct mesh_path mpp_path_lookup(u8 dst,
	251	struct ieee80211_sub_if_data *sdata);
	252	int mpp_path_add(u8 dst, u8 mpp, struct ieee80211_sub_if_data *sdata);
f698d856 JBG	253	struct mesh_path *mesh_path_lookup_by_idx(int idx,
f698d856 JBG	254	struct ieee80211_sub_if_data *sdata);
ccf80ddf	255	void mesh_path_fix_nexthop(struct mesh_path mpath, struct sta_info next_hop);
f698d856 JBG	256	void mesh_path_expire(struct ieee80211_sub_if_data *sdata);
	257	void mesh_path_flush(struct ieee80211_sub_if_data *sdata);
	258	void mesh_rx_path_sel_frame(struct ieee80211_sub_if_data *sdata,
	259	struct ieee80211_mgmt *mgmt, size_t len);
	260	int mesh_path_add(u8 dst, struct ieee80211_sub_if_data sdata);
ccf80ddf	261	/* Mesh plinks */
881d948c	262	void mesh_neighbour_update(u8 *hw_addr, u32 rates,
f698d856 JBG	263	struct ieee80211_sub_if_data *sdata, bool add);
f698d856 JBG	264	bool mesh_peer_accepts_plinks(struct ieee802_11_elems *ie);
d0709a65	265	void mesh_accept_plinks_update(struct ieee80211_sub_if_data *sdata);
ccf80ddf LCC	266	void mesh_plink_broken(struct sta_info *sta);
	267	void mesh_plink_deactivate(struct sta_info *sta);
	268	int mesh_plink_open(struct sta_info *sta);
ccf80ddf	269	void mesh_plink_block(struct sta_info *sta);
f698d856 JBG	270	void mesh_rx_plink_frame(struct ieee80211_sub_if_data *sdata,
	271	struct ieee80211_mgmt *mgmt, size_t len,
	272	struct ieee80211_rx_status *rx_status);
ccf80ddf LCC	273
	274	/* Private interfaces */
	275	/* Mesh tables */
	276	struct mesh_table *mesh_table_alloc(int size_order);
	277	void mesh_table_free(struct mesh_table *tbl, bool free_leafs);
18889231 JC	278	void mesh_mpath_table_grow(void);
18889231 JC	279	void mesh_mpp_table_grow(void);
f698d856 JBG	280	u32 mesh_table_hash(u8 addr, struct ieee80211_sub_if_data sdata,
f698d856 JBG	281	struct mesh_table *tbl);
ccf80ddf	282	/* Mesh paths */
d19b3bf6	283	int mesh_path_error_tx(u8 ttl, u8 *target, __le32 target_sn, __le16 target_rcode,
15ff6365	284	const u8 ra, struct ieee80211_sub_if_data sdata);
ccf80ddf LCC	285	void mesh_path_assign_nexthop(struct mesh_path mpath, struct sta_info sta);
	286	void mesh_path_flush_pending(struct mesh_path *mpath);
	287	void mesh_path_tx_pending(struct mesh_path *mpath);
	288	int mesh_pathtbl_init(void);
	289	void mesh_pathtbl_unregister(void);
f698d856	290	int mesh_path_del(u8 addr, struct ieee80211_sub_if_data sdata);
ccf80ddf LCC	291	void mesh_path_timer(unsigned long data);
ccf80ddf LCC	292	void mesh_path_flush_by_nexthop(struct sta_info *sta);
f698d856 JBG	293	void mesh_path_discard_frame(struct sk_buff *skb,
f698d856 JBG	294	struct ieee80211_sub_if_data *sdata);
5bb644a0 JB	295	void mesh_path_quiesce(struct ieee80211_sub_if_data *sdata);
5bb644a0 JB	296	void mesh_path_restart(struct ieee80211_sub_if_data *sdata);
e304bfd3	297	void mesh_path_tx_root_frame(struct ieee80211_sub_if_data *sdata);
ccf80ddf	298
f5ea9120 JB	299	extern int mesh_paths_generation;
f5ea9120 JB	300
902acc78 JB	301	#ifdef CONFIG_MAC80211_MESH
	302	extern int mesh_allocated;
	303
ccf80ddf LCC	304	static inline int mesh_plink_free_count(struct ieee80211_sub_if_data *sdata)
ccf80ddf LCC	305	{
472dbc45 JB	306	return sdata->u.mesh.mshcfg.dot11MeshMaxPeerLinks -
472dbc45 JB	307	atomic_read(&sdata->u.mesh.mshstats.estab_plinks);
ccf80ddf LCC	308	}
	309
	310	static inline bool mesh_plink_availables(struct ieee80211_sub_if_data *sdata)
	311	{
d0709a65	312	return (min_t(long, mesh_plink_free_count(sdata),
ccf80ddf LCC	313	MESH_MAX_PLINKS - sdata->local->num_sta)) > 0;
	314	}
	315
	316	static inline void mesh_path_activate(struct mesh_path *mpath)
	317	{
	318	mpath->flags \|= MESH_PATH_ACTIVE \| MESH_PATH_RESOLVED;
	319	}
	320
	321	#define for_each_mesh_entry(x, p, node, i) \
	322	for (i = 0; i <= x->hash_mask; i++) \
	323	hlist_for_each_entry_rcu(node, p, &x->hash_buckets[i], list)
	324
472dbc45 JB	325	void ieee80211_mesh_notify_scan_completed(struct ieee80211_local *local);
472dbc45 JB	326
5bb644a0 JB	327	void ieee80211_mesh_quiesce(struct ieee80211_sub_if_data *sdata);
	328	void ieee80211_mesh_restart(struct ieee80211_sub_if_data *sdata);
	329	void mesh_plink_quiesce(struct sta_info *sta);
	330	void mesh_plink_restart(struct sta_info *sta);
902acc78 JB	331	#else
902acc78 JB	332	#define mesh_allocated 0
472dbc45 JB	333	static inline void
472dbc45 JB	334	ieee80211_mesh_notify_scan_completed(struct ieee80211_local *local) {}
5bb644a0 JB	335	static inline void ieee80211_mesh_quiesce(struct ieee80211_sub_if_data *sdata)
	336	{}
	337	static inline void ieee80211_mesh_restart(struct ieee80211_sub_if_data *sdata)
	338	{}
	339	static inline void mesh_plink_quiesce(struct sta_info *sta) {}
	340	static inline void mesh_plink_restart(struct sta_info *sta) {}
902acc78 JB	341	#endif
902acc78 JB	342
ccf80ddf	343	#endif /* IEEE80211S_H */