2008-02-23 22:17:14 +08:00
|
|
|
/*
|
2009-11-10 07:46:58 +08:00
|
|
|
* Copyright (c) 2008, 2009 open80211s Ltd.
|
2008-02-23 22:17:14 +08:00
|
|
|
* Author: Luis Carlos Cobo <luisca@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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/etherdevice.h>
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/random.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2008-02-23 22:17:14 +08:00
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <net/mac80211.h>
|
|
|
|
#include "ieee80211_i.h"
|
|
|
|
#include "mesh.h"
|
|
|
|
|
|
|
|
/* There will be initially 2^INIT_PATHS_SIZE_ORDER buckets */
|
|
|
|
#define INIT_PATHS_SIZE_ORDER 2
|
|
|
|
|
|
|
|
/* Keep the mean chain length below this constant */
|
|
|
|
#define MEAN_CHAIN_LEN 2
|
|
|
|
|
|
|
|
#define MPATH_EXPIRED(mpath) ((mpath->flags & MESH_PATH_ACTIVE) && \
|
|
|
|
time_after(jiffies, mpath->exp_time) && \
|
|
|
|
!(mpath->flags & MESH_PATH_FIXED))
|
|
|
|
|
|
|
|
struct mpath_node {
|
|
|
|
struct hlist_node list;
|
|
|
|
struct rcu_head rcu;
|
|
|
|
/* This indirection allows two different tables to point to the same
|
|
|
|
* mesh_path structure, useful when resizing
|
|
|
|
*/
|
|
|
|
struct mesh_path *mpath;
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct mesh_table *mesh_paths;
|
2008-09-22 13:30:32 +08:00
|
|
|
static struct mesh_table *mpp_paths; /* Store paths for MPP&MAP */
|
2008-02-23 22:17:14 +08:00
|
|
|
|
2009-08-07 22:17:38 +08:00
|
|
|
int mesh_paths_generation;
|
2009-08-11 03:15:52 +08:00
|
|
|
static void __mesh_table_free(struct mesh_table *tbl)
|
|
|
|
{
|
|
|
|
kfree(tbl->hash_buckets);
|
|
|
|
kfree(tbl->hashwlock);
|
|
|
|
kfree(tbl);
|
|
|
|
}
|
|
|
|
|
|
|
|
void mesh_table_free(struct mesh_table *tbl, bool free_leafs)
|
|
|
|
{
|
|
|
|
struct hlist_head *mesh_hash;
|
|
|
|
struct hlist_node *p, *q;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
mesh_hash = tbl->hash_buckets;
|
|
|
|
for (i = 0; i <= tbl->hash_mask; i++) {
|
|
|
|
spin_lock(&tbl->hashwlock[i]);
|
|
|
|
hlist_for_each_safe(p, q, &mesh_hash[i]) {
|
|
|
|
tbl->free_node(p, free_leafs);
|
|
|
|
atomic_dec(&tbl->entries);
|
|
|
|
}
|
|
|
|
spin_unlock(&tbl->hashwlock[i]);
|
|
|
|
}
|
|
|
|
__mesh_table_free(tbl);
|
|
|
|
}
|
|
|
|
|
2011-04-14 02:10:28 +08:00
|
|
|
static int mesh_table_grow(struct mesh_table *oldtbl,
|
|
|
|
struct mesh_table *newtbl)
|
2009-08-11 03:15:52 +08:00
|
|
|
{
|
|
|
|
struct hlist_head *oldhash;
|
|
|
|
struct hlist_node *p, *q;
|
|
|
|
int i;
|
|
|
|
|
2011-04-14 02:10:28 +08:00
|
|
|
if (atomic_read(&oldtbl->entries)
|
|
|
|
< oldtbl->mean_chain_len * (oldtbl->hash_mask + 1))
|
|
|
|
return -EAGAIN;
|
2009-08-11 03:15:52 +08:00
|
|
|
|
|
|
|
|
2011-04-14 02:10:28 +08:00
|
|
|
newtbl->free_node = oldtbl->free_node;
|
|
|
|
newtbl->mean_chain_len = oldtbl->mean_chain_len;
|
|
|
|
newtbl->copy_node = oldtbl->copy_node;
|
|
|
|
atomic_set(&newtbl->entries, atomic_read(&oldtbl->entries));
|
2009-08-11 03:15:52 +08:00
|
|
|
|
2011-04-14 02:10:28 +08:00
|
|
|
oldhash = oldtbl->hash_buckets;
|
|
|
|
for (i = 0; i <= oldtbl->hash_mask; i++)
|
2009-08-11 03:15:52 +08:00
|
|
|
hlist_for_each(p, &oldhash[i])
|
2011-04-14 02:10:28 +08:00
|
|
|
if (oldtbl->copy_node(p, newtbl) < 0)
|
2009-08-11 03:15:52 +08:00
|
|
|
goto errcopy;
|
|
|
|
|
2011-04-14 02:10:28 +08:00
|
|
|
return 0;
|
2009-08-11 03:15:52 +08:00
|
|
|
|
|
|
|
errcopy:
|
|
|
|
for (i = 0; i <= newtbl->hash_mask; i++) {
|
|
|
|
hlist_for_each_safe(p, q, &newtbl->hash_buckets[i])
|
2011-04-14 02:10:28 +08:00
|
|
|
oldtbl->free_node(p, 0);
|
2009-08-11 03:15:52 +08:00
|
|
|
}
|
2011-04-14 02:10:28 +08:00
|
|
|
return -ENOMEM;
|
2009-08-11 03:15:52 +08:00
|
|
|
}
|
|
|
|
|
2009-08-07 22:17:38 +08:00
|
|
|
|
2008-02-23 22:17:14 +08:00
|
|
|
/* This lock will have the grow table function as writer and add / delete nodes
|
|
|
|
* as readers. When reading the table (i.e. doing lookups) we are well protected
|
|
|
|
* by RCU
|
|
|
|
*/
|
|
|
|
static DEFINE_RWLOCK(pathtbl_resize_lock);
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* mesh_path_assign_nexthop - update mesh path next hop
|
|
|
|
*
|
|
|
|
* @mpath: mesh path to update
|
|
|
|
* @sta: next hop to assign
|
|
|
|
*
|
|
|
|
* Locking: mpath->state_lock must be held when calling this function
|
|
|
|
*/
|
|
|
|
void mesh_path_assign_nexthop(struct mesh_path *mpath, struct sta_info *sta)
|
|
|
|
{
|
2009-07-10 05:42:16 +08:00
|
|
|
struct sk_buff *skb;
|
|
|
|
struct ieee80211_hdr *hdr;
|
|
|
|
struct sk_buff_head tmpq;
|
|
|
|
unsigned long flags;
|
|
|
|
|
2008-02-25 23:27:46 +08:00
|
|
|
rcu_assign_pointer(mpath->next_hop, sta);
|
2009-07-10 05:42:16 +08:00
|
|
|
|
|
|
|
__skb_queue_head_init(&tmpq);
|
|
|
|
|
|
|
|
spin_lock_irqsave(&mpath->frame_queue.lock, flags);
|
|
|
|
|
|
|
|
while ((skb = __skb_dequeue(&mpath->frame_queue)) != NULL) {
|
|
|
|
hdr = (struct ieee80211_hdr *) skb->data;
|
|
|
|
memcpy(hdr->addr1, sta->sta.addr, ETH_ALEN);
|
|
|
|
__skb_queue_tail(&tmpq, skb);
|
|
|
|
}
|
|
|
|
|
|
|
|
skb_queue_splice(&tmpq, &mpath->frame_queue);
|
|
|
|
spin_unlock_irqrestore(&mpath->frame_queue.lock, flags);
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mesh_path_lookup - look up a path in the mesh path table
|
|
|
|
* @dst: hardware address (ETH_ALEN length) of destination
|
2008-08-03 08:04:37 +08:00
|
|
|
* @sdata: local subif
|
2008-02-23 22:17:14 +08:00
|
|
|
*
|
|
|
|
* Returns: pointer to the mesh path structure, or NULL if not found
|
|
|
|
*
|
|
|
|
* Locking: must be called within a read rcu section.
|
|
|
|
*/
|
2008-08-03 08:04:37 +08:00
|
|
|
struct mesh_path *mesh_path_lookup(u8 *dst, struct ieee80211_sub_if_data *sdata)
|
2008-02-23 22:17:14 +08:00
|
|
|
{
|
|
|
|
struct mesh_path *mpath;
|
|
|
|
struct hlist_node *n;
|
|
|
|
struct hlist_head *bucket;
|
|
|
|
struct mesh_table *tbl;
|
|
|
|
struct mpath_node *node;
|
|
|
|
|
|
|
|
tbl = rcu_dereference(mesh_paths);
|
|
|
|
|
2008-08-03 08:04:37 +08:00
|
|
|
bucket = &tbl->hash_buckets[mesh_table_hash(dst, sdata, tbl)];
|
2008-02-23 22:17:14 +08:00
|
|
|
hlist_for_each_entry_rcu(node, n, bucket, list) {
|
|
|
|
mpath = node->mpath;
|
2008-08-03 08:04:37 +08:00
|
|
|
if (mpath->sdata == sdata &&
|
2008-02-23 22:17:14 +08:00
|
|
|
memcmp(dst, mpath->dst, ETH_ALEN) == 0) {
|
|
|
|
if (MPATH_EXPIRED(mpath)) {
|
|
|
|
spin_lock_bh(&mpath->state_lock);
|
|
|
|
if (MPATH_EXPIRED(mpath))
|
|
|
|
mpath->flags &= ~MESH_PATH_ACTIVE;
|
|
|
|
spin_unlock_bh(&mpath->state_lock);
|
|
|
|
}
|
|
|
|
return mpath;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2008-09-22 13:30:32 +08:00
|
|
|
struct mesh_path *mpp_path_lookup(u8 *dst, struct ieee80211_sub_if_data *sdata)
|
|
|
|
{
|
|
|
|
struct mesh_path *mpath;
|
|
|
|
struct hlist_node *n;
|
|
|
|
struct hlist_head *bucket;
|
|
|
|
struct mesh_table *tbl;
|
|
|
|
struct mpath_node *node;
|
|
|
|
|
|
|
|
tbl = rcu_dereference(mpp_paths);
|
|
|
|
|
|
|
|
bucket = &tbl->hash_buckets[mesh_table_hash(dst, sdata, tbl)];
|
|
|
|
hlist_for_each_entry_rcu(node, n, bucket, list) {
|
|
|
|
mpath = node->mpath;
|
|
|
|
if (mpath->sdata == sdata &&
|
|
|
|
memcmp(dst, mpath->dst, ETH_ALEN) == 0) {
|
|
|
|
if (MPATH_EXPIRED(mpath)) {
|
|
|
|
spin_lock_bh(&mpath->state_lock);
|
|
|
|
if (MPATH_EXPIRED(mpath))
|
|
|
|
mpath->flags &= ~MESH_PATH_ACTIVE;
|
|
|
|
spin_unlock_bh(&mpath->state_lock);
|
|
|
|
}
|
|
|
|
return mpath;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-02-23 22:17:14 +08:00
|
|
|
/**
|
|
|
|
* mesh_path_lookup_by_idx - look up a path in the mesh path table by its index
|
|
|
|
* @idx: index
|
2008-08-03 08:04:37 +08:00
|
|
|
* @sdata: local subif, or NULL for all entries
|
2008-02-23 22:17:14 +08:00
|
|
|
*
|
|
|
|
* Returns: pointer to the mesh path structure, or NULL if not found.
|
|
|
|
*
|
|
|
|
* Locking: must be called within a read rcu section.
|
|
|
|
*/
|
2008-08-03 08:04:37 +08:00
|
|
|
struct mesh_path *mesh_path_lookup_by_idx(int idx, struct ieee80211_sub_if_data *sdata)
|
2008-02-23 22:17:14 +08:00
|
|
|
{
|
|
|
|
struct mpath_node *node;
|
|
|
|
struct hlist_node *p;
|
|
|
|
int i;
|
|
|
|
int j = 0;
|
|
|
|
|
2008-03-01 09:51:25 +08:00
|
|
|
for_each_mesh_entry(mesh_paths, p, node, i) {
|
2008-08-03 08:04:37 +08:00
|
|
|
if (sdata && node->mpath->sdata != sdata)
|
2008-03-01 09:51:25 +08:00
|
|
|
continue;
|
2008-02-23 22:17:14 +08:00
|
|
|
if (j++ == idx) {
|
|
|
|
if (MPATH_EXPIRED(node->mpath)) {
|
|
|
|
spin_lock_bh(&node->mpath->state_lock);
|
|
|
|
if (MPATH_EXPIRED(node->mpath))
|
|
|
|
node->mpath->flags &= ~MESH_PATH_ACTIVE;
|
|
|
|
spin_unlock_bh(&node->mpath->state_lock);
|
|
|
|
}
|
|
|
|
return node->mpath;
|
|
|
|
}
|
2008-03-01 09:51:25 +08:00
|
|
|
}
|
2008-02-23 22:17:14 +08:00
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mesh_path_add - allocate and add a new path to the mesh path table
|
|
|
|
* @addr: destination address of the path (ETH_ALEN length)
|
2008-08-03 08:04:37 +08:00
|
|
|
* @sdata: local subif
|
2008-02-23 22:17:14 +08:00
|
|
|
*
|
tree-wide: fix assorted typos all over the place
That is "success", "unknown", "through", "performance", "[re|un]mapping"
, "access", "default", "reasonable", "[con]currently", "temperature"
, "channel", "[un]used", "application", "example","hierarchy", "therefore"
, "[over|under]flow", "contiguous", "threshold", "enough" and others.
Signed-off-by: André Goddard Rosa <andre.goddard@gmail.com>
Signed-off-by: Jiri Kosina <jkosina@suse.cz>
2009-11-14 23:09:05 +08:00
|
|
|
* Returns: 0 on success
|
2008-02-23 22:17:14 +08:00
|
|
|
*
|
|
|
|
* State: the initial state of the new path is set to 0
|
|
|
|
*/
|
2008-08-03 08:04:37 +08:00
|
|
|
int mesh_path_add(u8 *dst, struct ieee80211_sub_if_data *sdata)
|
2008-02-23 22:17:14 +08:00
|
|
|
{
|
2009-08-11 03:15:52 +08:00
|
|
|
struct ieee80211_if_mesh *ifmsh = &sdata->u.mesh;
|
|
|
|
struct ieee80211_local *local = sdata->local;
|
2008-02-23 22:17:14 +08:00
|
|
|
struct mesh_path *mpath, *new_mpath;
|
|
|
|
struct mpath_node *node, *new_node;
|
|
|
|
struct hlist_head *bucket;
|
|
|
|
struct hlist_node *n;
|
|
|
|
int grow = 0;
|
|
|
|
int err = 0;
|
|
|
|
u32 hash_idx;
|
|
|
|
|
2009-11-26 00:46:19 +08:00
|
|
|
if (memcmp(dst, sdata->vif.addr, ETH_ALEN) == 0)
|
2008-02-23 22:17:14 +08:00
|
|
|
/* never add ourselves as neighbours */
|
|
|
|
return -ENOTSUPP;
|
|
|
|
|
|
|
|
if (is_multicast_ether_addr(dst))
|
|
|
|
return -ENOTSUPP;
|
|
|
|
|
2008-09-11 06:01:49 +08:00
|
|
|
if (atomic_add_unless(&sdata->u.mesh.mpaths, 1, MESH_MAX_MPATHS) == 0)
|
2008-02-23 22:17:14 +08:00
|
|
|
return -ENOSPC;
|
|
|
|
|
2008-05-06 22:53:43 +08:00
|
|
|
err = -ENOMEM;
|
2009-08-11 03:15:52 +08:00
|
|
|
new_mpath = kzalloc(sizeof(struct mesh_path), GFP_ATOMIC);
|
2008-05-06 22:53:43 +08:00
|
|
|
if (!new_mpath)
|
|
|
|
goto err_path_alloc;
|
|
|
|
|
2009-08-11 03:15:52 +08:00
|
|
|
new_node = kmalloc(sizeof(struct mpath_node), GFP_ATOMIC);
|
2008-05-06 22:53:43 +08:00
|
|
|
if (!new_node)
|
|
|
|
goto err_node_alloc;
|
2008-05-06 22:46:36 +08:00
|
|
|
|
|
|
|
read_lock(&pathtbl_resize_lock);
|
2008-02-23 22:17:14 +08:00
|
|
|
memcpy(new_mpath->dst, dst, ETH_ALEN);
|
2008-08-03 08:04:37 +08:00
|
|
|
new_mpath->sdata = sdata;
|
2008-02-23 22:17:14 +08:00
|
|
|
new_mpath->flags = 0;
|
|
|
|
skb_queue_head_init(&new_mpath->frame_queue);
|
|
|
|
new_node->mpath = new_mpath;
|
|
|
|
new_mpath->timer.data = (unsigned long) new_mpath;
|
|
|
|
new_mpath->timer.function = mesh_path_timer;
|
|
|
|
new_mpath->exp_time = jiffies;
|
|
|
|
spin_lock_init(&new_mpath->state_lock);
|
|
|
|
init_timer(&new_mpath->timer);
|
|
|
|
|
2008-08-03 08:04:37 +08:00
|
|
|
hash_idx = mesh_table_hash(dst, sdata, mesh_paths);
|
2008-02-23 22:17:14 +08:00
|
|
|
bucket = &mesh_paths->hash_buckets[hash_idx];
|
|
|
|
|
|
|
|
spin_lock(&mesh_paths->hashwlock[hash_idx]);
|
|
|
|
|
2008-05-06 22:53:43 +08:00
|
|
|
err = -EEXIST;
|
2008-02-23 22:17:14 +08:00
|
|
|
hlist_for_each_entry(node, n, bucket, list) {
|
|
|
|
mpath = node->mpath;
|
2008-08-03 08:04:37 +08:00
|
|
|
if (mpath->sdata == sdata && memcmp(dst, mpath->dst, ETH_ALEN) == 0)
|
2008-05-06 22:53:43 +08:00
|
|
|
goto err_exists;
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
hlist_add_head_rcu(&new_node->list, bucket);
|
|
|
|
if (atomic_inc_return(&mesh_paths->entries) >=
|
|
|
|
mesh_paths->mean_chain_len * (mesh_paths->hash_mask + 1))
|
|
|
|
grow = 1;
|
|
|
|
|
2009-08-07 22:17:38 +08:00
|
|
|
mesh_paths_generation++;
|
|
|
|
|
2008-02-23 22:17:14 +08:00
|
|
|
spin_unlock(&mesh_paths->hashwlock[hash_idx]);
|
|
|
|
read_unlock(&pathtbl_resize_lock);
|
2008-05-06 22:53:43 +08:00
|
|
|
if (grow) {
|
2009-08-11 03:15:52 +08:00
|
|
|
set_bit(MESH_WORK_GROW_MPATH_TABLE, &ifmsh->wrkq_flags);
|
2010-06-10 16:21:31 +08:00
|
|
|
ieee80211_queue_work(&local->hw, &sdata->work);
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
2008-05-06 22:53:43 +08:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
err_exists:
|
|
|
|
spin_unlock(&mesh_paths->hashwlock[hash_idx]);
|
|
|
|
read_unlock(&pathtbl_resize_lock);
|
|
|
|
kfree(new_node);
|
|
|
|
err_node_alloc:
|
|
|
|
kfree(new_mpath);
|
|
|
|
err_path_alloc:
|
2008-09-11 06:01:49 +08:00
|
|
|
atomic_dec(&sdata->u.mesh.mpaths);
|
2008-02-23 22:17:14 +08:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2009-08-11 03:15:52 +08:00
|
|
|
void mesh_mpath_table_grow(void)
|
|
|
|
{
|
|
|
|
struct mesh_table *oldtbl, *newtbl;
|
|
|
|
|
2011-04-14 02:10:28 +08:00
|
|
|
newtbl = mesh_table_alloc(mesh_paths->size_order + 1);
|
|
|
|
if (!newtbl)
|
|
|
|
return;
|
2009-08-11 03:15:52 +08:00
|
|
|
write_lock(&pathtbl_resize_lock);
|
|
|
|
oldtbl = mesh_paths;
|
2011-04-14 02:10:28 +08:00
|
|
|
if (mesh_table_grow(mesh_paths, newtbl) < 0) {
|
|
|
|
__mesh_table_free(newtbl);
|
2009-08-11 03:15:52 +08:00
|
|
|
write_unlock(&pathtbl_resize_lock);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
rcu_assign_pointer(mesh_paths, newtbl);
|
|
|
|
write_unlock(&pathtbl_resize_lock);
|
|
|
|
|
|
|
|
synchronize_rcu();
|
|
|
|
mesh_table_free(oldtbl, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
void mesh_mpp_table_grow(void)
|
|
|
|
{
|
|
|
|
struct mesh_table *oldtbl, *newtbl;
|
|
|
|
|
2011-04-14 02:10:28 +08:00
|
|
|
newtbl = mesh_table_alloc(mpp_paths->size_order + 1);
|
|
|
|
if (!newtbl)
|
|
|
|
return;
|
2009-08-11 03:15:52 +08:00
|
|
|
write_lock(&pathtbl_resize_lock);
|
|
|
|
oldtbl = mpp_paths;
|
2011-04-14 02:10:28 +08:00
|
|
|
if (mesh_table_grow(mpp_paths, newtbl) < 0) {
|
|
|
|
__mesh_table_free(newtbl);
|
2009-08-11 03:15:52 +08:00
|
|
|
write_unlock(&pathtbl_resize_lock);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
rcu_assign_pointer(mpp_paths, newtbl);
|
|
|
|
write_unlock(&pathtbl_resize_lock);
|
|
|
|
|
|
|
|
synchronize_rcu();
|
|
|
|
mesh_table_free(oldtbl, false);
|
|
|
|
}
|
2008-02-23 22:17:14 +08:00
|
|
|
|
2008-09-22 13:30:32 +08:00
|
|
|
int mpp_path_add(u8 *dst, u8 *mpp, struct ieee80211_sub_if_data *sdata)
|
|
|
|
{
|
2009-08-11 03:15:52 +08:00
|
|
|
struct ieee80211_if_mesh *ifmsh = &sdata->u.mesh;
|
|
|
|
struct ieee80211_local *local = sdata->local;
|
2008-09-22 13:30:32 +08:00
|
|
|
struct mesh_path *mpath, *new_mpath;
|
|
|
|
struct mpath_node *node, *new_node;
|
|
|
|
struct hlist_head *bucket;
|
|
|
|
struct hlist_node *n;
|
|
|
|
int grow = 0;
|
|
|
|
int err = 0;
|
|
|
|
u32 hash_idx;
|
|
|
|
|
2009-11-26 00:46:19 +08:00
|
|
|
if (memcmp(dst, sdata->vif.addr, ETH_ALEN) == 0)
|
2008-09-22 13:30:32 +08:00
|
|
|
/* never add ourselves as neighbours */
|
|
|
|
return -ENOTSUPP;
|
|
|
|
|
|
|
|
if (is_multicast_ether_addr(dst))
|
|
|
|
return -ENOTSUPP;
|
|
|
|
|
|
|
|
err = -ENOMEM;
|
2009-08-11 03:15:52 +08:00
|
|
|
new_mpath = kzalloc(sizeof(struct mesh_path), GFP_ATOMIC);
|
2008-09-22 13:30:32 +08:00
|
|
|
if (!new_mpath)
|
|
|
|
goto err_path_alloc;
|
|
|
|
|
2009-08-11 03:15:52 +08:00
|
|
|
new_node = kmalloc(sizeof(struct mpath_node), GFP_ATOMIC);
|
2008-09-22 13:30:32 +08:00
|
|
|
if (!new_node)
|
|
|
|
goto err_node_alloc;
|
|
|
|
|
|
|
|
read_lock(&pathtbl_resize_lock);
|
|
|
|
memcpy(new_mpath->dst, dst, ETH_ALEN);
|
|
|
|
memcpy(new_mpath->mpp, mpp, ETH_ALEN);
|
|
|
|
new_mpath->sdata = sdata;
|
|
|
|
new_mpath->flags = 0;
|
|
|
|
skb_queue_head_init(&new_mpath->frame_queue);
|
|
|
|
new_node->mpath = new_mpath;
|
|
|
|
new_mpath->exp_time = jiffies;
|
|
|
|
spin_lock_init(&new_mpath->state_lock);
|
|
|
|
|
|
|
|
hash_idx = mesh_table_hash(dst, sdata, mpp_paths);
|
|
|
|
bucket = &mpp_paths->hash_buckets[hash_idx];
|
|
|
|
|
|
|
|
spin_lock(&mpp_paths->hashwlock[hash_idx]);
|
|
|
|
|
|
|
|
err = -EEXIST;
|
|
|
|
hlist_for_each_entry(node, n, bucket, list) {
|
|
|
|
mpath = node->mpath;
|
|
|
|
if (mpath->sdata == sdata && memcmp(dst, mpath->dst, ETH_ALEN) == 0)
|
|
|
|
goto err_exists;
|
|
|
|
}
|
|
|
|
|
|
|
|
hlist_add_head_rcu(&new_node->list, bucket);
|
|
|
|
if (atomic_inc_return(&mpp_paths->entries) >=
|
|
|
|
mpp_paths->mean_chain_len * (mpp_paths->hash_mask + 1))
|
|
|
|
grow = 1;
|
|
|
|
|
|
|
|
spin_unlock(&mpp_paths->hashwlock[hash_idx]);
|
|
|
|
read_unlock(&pathtbl_resize_lock);
|
|
|
|
if (grow) {
|
2009-08-11 03:15:52 +08:00
|
|
|
set_bit(MESH_WORK_GROW_MPP_TABLE, &ifmsh->wrkq_flags);
|
2010-06-10 16:21:31 +08:00
|
|
|
ieee80211_queue_work(&local->hw, &sdata->work);
|
2008-09-22 13:30:32 +08:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
err_exists:
|
|
|
|
spin_unlock(&mpp_paths->hashwlock[hash_idx]);
|
|
|
|
read_unlock(&pathtbl_resize_lock);
|
|
|
|
kfree(new_node);
|
|
|
|
err_node_alloc:
|
|
|
|
kfree(new_mpath);
|
|
|
|
err_path_alloc:
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-02-23 22:17:14 +08:00
|
|
|
/**
|
|
|
|
* mesh_plink_broken - deactivates paths and sends perr when a link breaks
|
|
|
|
*
|
|
|
|
* @sta: broken peer link
|
|
|
|
*
|
|
|
|
* This function must be called from the rate control algorithm if enough
|
|
|
|
* delivery errors suggest that a peer link is no longer usable.
|
|
|
|
*/
|
|
|
|
void mesh_plink_broken(struct sta_info *sta)
|
|
|
|
{
|
2009-11-17 20:34:04 +08:00
|
|
|
static const u8 bcast[ETH_ALEN] = {0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
|
2008-02-23 22:17:14 +08:00
|
|
|
struct mesh_path *mpath;
|
|
|
|
struct mpath_node *node;
|
|
|
|
struct hlist_node *p;
|
2008-08-03 08:04:37 +08:00
|
|
|
struct ieee80211_sub_if_data *sdata = sta->sdata;
|
2008-02-23 22:17:14 +08:00
|
|
|
int i;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
for_each_mesh_entry(mesh_paths, p, node, i) {
|
|
|
|
mpath = node->mpath;
|
|
|
|
spin_lock_bh(&mpath->state_lock);
|
|
|
|
if (mpath->next_hop == sta &&
|
|
|
|
mpath->flags & MESH_PATH_ACTIVE &&
|
|
|
|
!(mpath->flags & MESH_PATH_FIXED)) {
|
|
|
|
mpath->flags &= ~MESH_PATH_ACTIVE;
|
2009-11-10 07:46:55 +08:00
|
|
|
++mpath->sn;
|
2008-02-23 22:17:14 +08:00
|
|
|
spin_unlock_bh(&mpath->state_lock);
|
2010-12-03 16:20:40 +08:00
|
|
|
mesh_path_error_tx(sdata->u.mesh.mshcfg.element_ttl,
|
|
|
|
mpath->dst, cpu_to_le32(mpath->sn),
|
2009-11-19 23:49:10 +08:00
|
|
|
cpu_to_le16(PERR_RCODE_DEST_UNREACH),
|
2009-11-17 20:34:04 +08:00
|
|
|
bcast, sdata);
|
2008-02-23 22:17:14 +08:00
|
|
|
} else
|
|
|
|
spin_unlock_bh(&mpath->state_lock);
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mesh_path_flush_by_nexthop - Deletes mesh paths if their next hop matches
|
|
|
|
*
|
|
|
|
* @sta - mesh peer to match
|
|
|
|
*
|
2008-03-01 07:46:08 +08:00
|
|
|
* RCU notes: this function is called when a mesh plink transitions from
|
|
|
|
* PLINK_ESTAB to any other state, since PLINK_ESTAB state is the only one that
|
|
|
|
* allows path creation. This will happen before the sta can be freed (because
|
2008-02-25 23:27:46 +08:00
|
|
|
* sta_info_destroy() calls this) so any reader in a rcu read block will be
|
|
|
|
* protected against the plink disappearing.
|
2008-02-23 22:17:14 +08:00
|
|
|
*/
|
|
|
|
void mesh_path_flush_by_nexthop(struct sta_info *sta)
|
|
|
|
{
|
|
|
|
struct mesh_path *mpath;
|
|
|
|
struct mpath_node *node;
|
|
|
|
struct hlist_node *p;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for_each_mesh_entry(mesh_paths, p, node, i) {
|
|
|
|
mpath = node->mpath;
|
|
|
|
if (mpath->next_hop == sta)
|
2008-08-03 08:04:37 +08:00
|
|
|
mesh_path_del(mpath->dst, mpath->sdata);
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-08-03 08:04:37 +08:00
|
|
|
void mesh_path_flush(struct ieee80211_sub_if_data *sdata)
|
2008-02-23 22:17:14 +08:00
|
|
|
{
|
|
|
|
struct mesh_path *mpath;
|
|
|
|
struct mpath_node *node;
|
|
|
|
struct hlist_node *p;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for_each_mesh_entry(mesh_paths, p, node, i) {
|
|
|
|
mpath = node->mpath;
|
2008-08-03 08:04:37 +08:00
|
|
|
if (mpath->sdata == sdata)
|
|
|
|
mesh_path_del(mpath->dst, mpath->sdata);
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mesh_path_node_reclaim(struct rcu_head *rp)
|
|
|
|
{
|
|
|
|
struct mpath_node *node = container_of(rp, struct mpath_node, rcu);
|
2008-08-03 08:04:37 +08:00
|
|
|
struct ieee80211_sub_if_data *sdata = node->mpath->sdata;
|
2008-02-25 23:27:46 +08:00
|
|
|
|
2008-03-01 06:49:37 +08:00
|
|
|
del_timer_sync(&node->mpath->timer);
|
2008-09-11 06:01:49 +08:00
|
|
|
atomic_dec(&sdata->u.mesh.mpaths);
|
2008-02-23 22:17:14 +08:00
|
|
|
kfree(node->mpath);
|
|
|
|
kfree(node);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mesh_path_del - delete a mesh path from the table
|
|
|
|
*
|
|
|
|
* @addr: dst address (ETH_ALEN length)
|
2008-08-03 08:04:37 +08:00
|
|
|
* @sdata: local subif
|
2008-02-23 22:17:14 +08:00
|
|
|
*
|
tree-wide: fix assorted typos all over the place
That is "success", "unknown", "through", "performance", "[re|un]mapping"
, "access", "default", "reasonable", "[con]currently", "temperature"
, "channel", "[un]used", "application", "example","hierarchy", "therefore"
, "[over|under]flow", "contiguous", "threshold", "enough" and others.
Signed-off-by: André Goddard Rosa <andre.goddard@gmail.com>
Signed-off-by: Jiri Kosina <jkosina@suse.cz>
2009-11-14 23:09:05 +08:00
|
|
|
* Returns: 0 if successful
|
2008-02-23 22:17:14 +08:00
|
|
|
*/
|
2008-08-03 08:04:37 +08:00
|
|
|
int mesh_path_del(u8 *addr, struct ieee80211_sub_if_data *sdata)
|
2008-02-23 22:17:14 +08:00
|
|
|
{
|
|
|
|
struct mesh_path *mpath;
|
|
|
|
struct mpath_node *node;
|
|
|
|
struct hlist_head *bucket;
|
|
|
|
struct hlist_node *n;
|
|
|
|
int hash_idx;
|
|
|
|
int err = 0;
|
|
|
|
|
|
|
|
read_lock(&pathtbl_resize_lock);
|
2008-08-03 08:04:37 +08:00
|
|
|
hash_idx = mesh_table_hash(addr, sdata, mesh_paths);
|
2008-02-23 22:17:14 +08:00
|
|
|
bucket = &mesh_paths->hash_buckets[hash_idx];
|
|
|
|
|
|
|
|
spin_lock(&mesh_paths->hashwlock[hash_idx]);
|
|
|
|
hlist_for_each_entry(node, n, bucket, list) {
|
|
|
|
mpath = node->mpath;
|
2008-08-03 08:04:37 +08:00
|
|
|
if (mpath->sdata == sdata &&
|
2008-02-23 22:17:14 +08:00
|
|
|
memcmp(addr, mpath->dst, ETH_ALEN) == 0) {
|
|
|
|
spin_lock_bh(&mpath->state_lock);
|
2008-03-01 07:04:13 +08:00
|
|
|
mpath->flags |= MESH_PATH_RESOLVING;
|
|
|
|
hlist_del_rcu(&node->list);
|
|
|
|
call_rcu(&node->rcu, mesh_path_node_reclaim);
|
|
|
|
atomic_dec(&mesh_paths->entries);
|
2008-02-23 22:17:14 +08:00
|
|
|
spin_unlock_bh(&mpath->state_lock);
|
|
|
|
goto enddel;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
err = -ENXIO;
|
|
|
|
enddel:
|
2009-08-07 22:17:38 +08:00
|
|
|
mesh_paths_generation++;
|
2008-02-23 22:17:14 +08:00
|
|
|
spin_unlock(&mesh_paths->hashwlock[hash_idx]);
|
|
|
|
read_unlock(&pathtbl_resize_lock);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mesh_path_tx_pending - sends pending frames in a mesh path queue
|
|
|
|
*
|
|
|
|
* @mpath: mesh path to activate
|
|
|
|
*
|
|
|
|
* Locking: the state_lock of the mpath structure must NOT be held when calling
|
|
|
|
* this function.
|
|
|
|
*/
|
|
|
|
void mesh_path_tx_pending(struct mesh_path *mpath)
|
|
|
|
{
|
2009-07-08 01:55:03 +08:00
|
|
|
if (mpath->flags & MESH_PATH_ACTIVE)
|
|
|
|
ieee80211_add_pending_skbs(mpath->sdata->local,
|
|
|
|
&mpath->frame_queue);
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mesh_path_discard_frame - discard a frame whose path could not be resolved
|
|
|
|
*
|
|
|
|
* @skb: frame to discard
|
2008-08-03 08:04:37 +08:00
|
|
|
* @sdata: network subif the frame was to be sent through
|
2008-02-23 22:17:14 +08:00
|
|
|
*
|
2009-07-14 08:00:10 +08:00
|
|
|
* If the frame was being forwarded from another MP, a PERR frame will be sent
|
|
|
|
* to the precursor. The precursor's address (i.e. the previous hop) was saved
|
|
|
|
* in addr1 of the frame-to-be-forwarded, and would only be overwritten once
|
|
|
|
* the destination is successfully resolved.
|
2008-02-23 22:17:14 +08:00
|
|
|
*
|
|
|
|
* Locking: the function must me called within a rcu_read_lock region
|
|
|
|
*/
|
2008-08-03 08:04:37 +08:00
|
|
|
void mesh_path_discard_frame(struct sk_buff *skb,
|
|
|
|
struct ieee80211_sub_if_data *sdata)
|
2008-02-23 22:17:14 +08:00
|
|
|
{
|
2008-08-06 01:34:52 +08:00
|
|
|
struct ieee80211_hdr *hdr = (struct ieee80211_hdr *) skb->data;
|
2008-02-23 22:17:14 +08:00
|
|
|
struct mesh_path *mpath;
|
2009-11-10 07:46:55 +08:00
|
|
|
u32 sn = 0;
|
2008-02-23 22:17:14 +08:00
|
|
|
|
2009-11-26 00:46:19 +08:00
|
|
|
if (memcmp(hdr->addr4, sdata->vif.addr, ETH_ALEN) != 0) {
|
2008-02-23 22:17:14 +08:00
|
|
|
u8 *ra, *da;
|
|
|
|
|
2008-08-06 01:34:52 +08:00
|
|
|
da = hdr->addr3;
|
2009-07-14 08:00:10 +08:00
|
|
|
ra = hdr->addr1;
|
2008-08-03 08:04:37 +08:00
|
|
|
mpath = mesh_path_lookup(da, sdata);
|
2008-02-23 22:17:14 +08:00
|
|
|
if (mpath)
|
2009-11-10 07:46:55 +08:00
|
|
|
sn = ++mpath->sn;
|
2010-12-03 16:20:40 +08:00
|
|
|
mesh_path_error_tx(sdata->u.mesh.mshcfg.element_ttl, skb->data,
|
|
|
|
cpu_to_le32(sn),
|
2009-11-19 23:49:10 +08:00
|
|
|
cpu_to_le16(PERR_RCODE_NO_ROUTE), ra, sdata);
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
kfree_skb(skb);
|
2008-09-11 06:01:49 +08:00
|
|
|
sdata->u.mesh.mshstats.dropped_frames_no_route++;
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mesh_path_flush_pending - free the pending queue of a mesh path
|
|
|
|
*
|
|
|
|
* @mpath: mesh path whose queue has to be freed
|
|
|
|
*
|
2011-03-31 09:57:33 +08:00
|
|
|
* Locking: the function must me called within a rcu_read_lock region
|
2008-02-23 22:17:14 +08:00
|
|
|
*/
|
|
|
|
void mesh_path_flush_pending(struct mesh_path *mpath)
|
|
|
|
{
|
|
|
|
struct sk_buff *skb;
|
|
|
|
|
|
|
|
while ((skb = skb_dequeue(&mpath->frame_queue)) &&
|
|
|
|
(mpath->flags & MESH_PATH_ACTIVE))
|
2008-08-03 08:04:37 +08:00
|
|
|
mesh_path_discard_frame(skb, mpath->sdata);
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* mesh_path_fix_nexthop - force a specific next hop for a mesh path
|
|
|
|
*
|
|
|
|
* @mpath: the mesh path to modify
|
|
|
|
* @next_hop: the next hop to force
|
|
|
|
*
|
|
|
|
* Locking: this function must be called holding mpath->state_lock
|
|
|
|
*/
|
|
|
|
void mesh_path_fix_nexthop(struct mesh_path *mpath, struct sta_info *next_hop)
|
|
|
|
{
|
|
|
|
spin_lock_bh(&mpath->state_lock);
|
|
|
|
mesh_path_assign_nexthop(mpath, next_hop);
|
2009-11-10 07:46:55 +08:00
|
|
|
mpath->sn = 0xffff;
|
2008-02-23 22:17:14 +08:00
|
|
|
mpath->metric = 0;
|
|
|
|
mpath->hop_count = 0;
|
|
|
|
mpath->exp_time = 0;
|
|
|
|
mpath->flags |= MESH_PATH_FIXED;
|
|
|
|
mesh_path_activate(mpath);
|
|
|
|
spin_unlock_bh(&mpath->state_lock);
|
|
|
|
mesh_path_tx_pending(mpath);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mesh_path_node_free(struct hlist_node *p, bool free_leafs)
|
|
|
|
{
|
|
|
|
struct mesh_path *mpath;
|
|
|
|
struct mpath_node *node = hlist_entry(p, struct mpath_node, list);
|
|
|
|
mpath = node->mpath;
|
|
|
|
hlist_del_rcu(p);
|
|
|
|
if (free_leafs)
|
|
|
|
kfree(mpath);
|
|
|
|
kfree(node);
|
|
|
|
}
|
|
|
|
|
2008-05-07 23:47:01 +08:00
|
|
|
static int mesh_path_node_copy(struct hlist_node *p, struct mesh_table *newtbl)
|
2008-02-23 22:17:14 +08:00
|
|
|
{
|
|
|
|
struct mesh_path *mpath;
|
|
|
|
struct mpath_node *node, *new_node;
|
|
|
|
u32 hash_idx;
|
|
|
|
|
2008-05-07 23:51:51 +08:00
|
|
|
new_node = kmalloc(sizeof(struct mpath_node), GFP_ATOMIC);
|
2008-05-07 23:48:14 +08:00
|
|
|
if (new_node == NULL)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2008-02-23 22:17:14 +08:00
|
|
|
node = hlist_entry(p, struct mpath_node, list);
|
|
|
|
mpath = node->mpath;
|
|
|
|
new_node->mpath = mpath;
|
2008-08-03 08:04:37 +08:00
|
|
|
hash_idx = mesh_table_hash(mpath->dst, mpath->sdata, newtbl);
|
2008-02-23 22:17:14 +08:00
|
|
|
hlist_add_head(&new_node->list,
|
|
|
|
&newtbl->hash_buckets[hash_idx]);
|
2008-05-07 23:47:01 +08:00
|
|
|
return 0;
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int mesh_pathtbl_init(void)
|
|
|
|
{
|
|
|
|
mesh_paths = mesh_table_alloc(INIT_PATHS_SIZE_ORDER);
|
2008-09-22 13:30:32 +08:00
|
|
|
if (!mesh_paths)
|
|
|
|
return -ENOMEM;
|
2008-02-23 22:17:14 +08:00
|
|
|
mesh_paths->free_node = &mesh_path_node_free;
|
|
|
|
mesh_paths->copy_node = &mesh_path_node_copy;
|
|
|
|
mesh_paths->mean_chain_len = MEAN_CHAIN_LEN;
|
2008-09-22 13:30:32 +08:00
|
|
|
|
|
|
|
mpp_paths = mesh_table_alloc(INIT_PATHS_SIZE_ORDER);
|
|
|
|
if (!mpp_paths) {
|
|
|
|
mesh_table_free(mesh_paths, true);
|
2008-02-23 22:17:14 +08:00
|
|
|
return -ENOMEM;
|
2008-09-22 13:30:32 +08:00
|
|
|
}
|
|
|
|
mpp_paths->free_node = &mesh_path_node_free;
|
|
|
|
mpp_paths->copy_node = &mesh_path_node_copy;
|
|
|
|
mpp_paths->mean_chain_len = MEAN_CHAIN_LEN;
|
|
|
|
|
2008-02-23 22:17:14 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-08-03 08:04:37 +08:00
|
|
|
void mesh_path_expire(struct ieee80211_sub_if_data *sdata)
|
2008-02-23 22:17:14 +08:00
|
|
|
{
|
|
|
|
struct mesh_path *mpath;
|
|
|
|
struct mpath_node *node;
|
|
|
|
struct hlist_node *p;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
read_lock(&pathtbl_resize_lock);
|
|
|
|
for_each_mesh_entry(mesh_paths, p, node, i) {
|
2008-08-03 08:04:37 +08:00
|
|
|
if (node->mpath->sdata != sdata)
|
2008-02-23 22:17:14 +08:00
|
|
|
continue;
|
|
|
|
mpath = node->mpath;
|
|
|
|
spin_lock_bh(&mpath->state_lock);
|
|
|
|
if ((!(mpath->flags & MESH_PATH_RESOLVING)) &&
|
|
|
|
(!(mpath->flags & MESH_PATH_FIXED)) &&
|
|
|
|
time_after(jiffies,
|
|
|
|
mpath->exp_time + MESH_PATH_EXPIRE)) {
|
|
|
|
spin_unlock_bh(&mpath->state_lock);
|
2008-08-03 08:04:37 +08:00
|
|
|
mesh_path_del(mpath->dst, mpath->sdata);
|
2008-02-23 22:17:14 +08:00
|
|
|
} else
|
|
|
|
spin_unlock_bh(&mpath->state_lock);
|
|
|
|
}
|
|
|
|
read_unlock(&pathtbl_resize_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
void mesh_pathtbl_unregister(void)
|
|
|
|
{
|
|
|
|
mesh_table_free(mesh_paths, true);
|
2008-09-22 13:30:32 +08:00
|
|
|
mesh_table_free(mpp_paths, true);
|
2008-02-23 22:17:14 +08:00
|
|
|
}
|